./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 468953385e0ecb57effbe4a67e36beea0bc9797d81fab044af341dde527767a1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:53:32,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:53:32,620 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-19 07:53:32,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:53:32,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:53:32,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:53:32,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:53:32,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:53:32,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:53:32,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:53:32,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:53:32,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:53:32,683 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:53:32,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:53:32,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:53:32,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:53:32,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:53:32,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:53:32,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:53:32,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:53:32,688 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-19 07:53:32,689 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:53:32,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:53:32,690 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:53:32,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:53:32,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:53:32,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:53:32,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:53:32,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:53:32,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:53:32,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:53:32,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:53:32,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:53:32,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:53:32,696 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:53:32,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:53:32,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:53:32,697 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:53:32,697 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 468953385e0ecb57effbe4a67e36beea0bc9797d81fab044af341dde527767a1 [2023-11-19 07:53:33,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:53:33,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:53:33,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:53:33,077 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:53:33,078 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:53:33,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i [2023-11-19 07:53:36,195 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:53:36,497 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:53:36,498 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i [2023-11-19 07:53:36,516 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/data/653d4cb48/0a5eac017b4a4d92815bc6071756aa97/FLAG0c6a08b41 [2023-11-19 07:53:36,533 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/data/653d4cb48/0a5eac017b4a4d92815bc6071756aa97 [2023-11-19 07:53:36,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:53:36,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:53:36,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:53:36,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:53:36,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:53:36,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:36,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61553f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36, skipping insertion in model container [2023-11-19 07:53:36,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:36,593 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:53:36,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:53:36,913 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:53:36,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:53:36,980 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:53:36,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36 WrapperNode [2023-11-19 07:53:36,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:53:36,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:53:36,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:53:36,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:53:36,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:37,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:37,022 INFO L138 Inliner]: procedures = 111, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2023-11-19 07:53:37,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:53:37,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:53:37,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:53:37,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:53:37,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:37,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:37,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:37,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:37,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:37,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:37,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:37,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:37,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:53:37,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:53:37,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:53:37,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:53:37,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36" (1/1) ... [2023-11-19 07:53:37,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:53:37,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:53:37,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:53:37,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:53:37,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:53:37,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:53:37,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:53:37,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:53:37,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:53:37,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:53:37,237 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:53:37,240 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:53:37,411 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:53:37,419 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:53:37,424 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:53:37,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:37 BoogieIcfgContainer [2023-11-19 07:53:37,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:53:37,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:53:37,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:53:37,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:53:37,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:53:36" (1/3) ... [2023-11-19 07:53:37,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d34a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:37, skipping insertion in model container [2023-11-19 07:53:37,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:36" (2/3) ... [2023-11-19 07:53:37,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d34a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:37, skipping insertion in model container [2023-11-19 07:53:37,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:37" (3/3) ... [2023-11-19 07:53:37,448 INFO L112 eAbstractionObserver]: Analyzing ICFG b.07-alloca.i [2023-11-19 07:53:37,469 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:53:37,469 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-19 07:53:37,511 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:53:37,517 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d5c0a2f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:53:37,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-19 07:53:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 07:53:37,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:37,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 07:53:37,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 07:53:37,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:37,534 INFO L85 PathProgramCache]: Analyzing trace with hash 889569447, now seen corresponding path program 1 times [2023-11-19 07:53:37,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:37,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127483057] [2023-11-19 07:53:37,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:37,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:53:38,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:38,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127483057] [2023-11-19 07:53:38,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127483057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:38,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:38,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:53:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651726953] [2023-11-19 07:53:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:38,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:53:38,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:38,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:53:38,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:53:38,630 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:38,801 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-11-19 07:53:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:53:38,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-19 07:53:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:38,811 INFO L225 Difference]: With dead ends: 43 [2023-11-19 07:53:38,812 INFO L226 Difference]: Without dead ends: 28 [2023-11-19 07:53:38,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:53:38,818 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 32 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:38,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 35 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:53:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-19 07:53:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2023-11-19 07:53:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-11-19 07:53:38,851 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 6 [2023-11-19 07:53:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:38,852 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-11-19 07:53:38,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-11-19 07:53:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 07:53:38,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:38,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:38,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:53:38,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 07:53:38,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:38,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849133, now seen corresponding path program 1 times [2023-11-19 07:53:38,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:38,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691774467] [2023-11-19 07:53:38,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:38,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:53:39,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:39,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691774467] [2023-11-19 07:53:39,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691774467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:39,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:39,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:53:39,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712513859] [2023-11-19 07:53:39,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:39,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:53:39,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:39,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:53:39,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:53:39,206 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:39,237 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2023-11-19 07:53:39,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:53:39,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-19 07:53:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:39,239 INFO L225 Difference]: With dead ends: 17 [2023-11-19 07:53:39,239 INFO L226 Difference]: Without dead ends: 16 [2023-11-19 07:53:39,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:53:39,242 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:39,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 14 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:53:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-19 07:53:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-19 07:53:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:39,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-11-19 07:53:39,253 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 7 [2023-11-19 07:53:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:39,254 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-11-19 07:53:39,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:39,254 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-11-19 07:53:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 07:53:39,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:39,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:39,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:53:39,257 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 07:53:39,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:39,257 INFO L85 PathProgramCache]: Analyzing trace with hash 177748329, now seen corresponding path program 1 times [2023-11-19 07:53:39,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:39,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182494523] [2023-11-19 07:53:39,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:39,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:53:39,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:39,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182494523] [2023-11-19 07:53:39,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182494523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:39,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:39,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:53:39,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768474874] [2023-11-19 07:53:39,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:39,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:53:39,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:39,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:53:39,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:53:39,647 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:39,728 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2023-11-19 07:53:39,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:53:39,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-19 07:53:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:39,730 INFO L225 Difference]: With dead ends: 23 [2023-11-19 07:53:39,731 INFO L226 Difference]: Without dead ends: 22 [2023-11-19 07:53:39,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:53:39,733 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:39,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 21 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:53:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-19 07:53:39,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2023-11-19 07:53:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-11-19 07:53:39,739 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 8 [2023-11-19 07:53:39,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:39,740 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-11-19 07:53:39,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-11-19 07:53:39,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 07:53:39,741 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:39,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:39,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:53:39,742 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 07:53:39,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:39,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1215230959, now seen corresponding path program 1 times [2023-11-19 07:53:39,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:39,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379157999] [2023-11-19 07:53:39,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:39,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:53:40,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:40,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379157999] [2023-11-19 07:53:40,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379157999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:40,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:40,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:53:40,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311540470] [2023-11-19 07:53:40,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:40,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:53:40,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:40,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:53:40,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:53:40,153 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:40,188 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2023-11-19 07:53:40,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:53:40,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 07:53:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:40,190 INFO L225 Difference]: With dead ends: 20 [2023-11-19 07:53:40,190 INFO L226 Difference]: Without dead ends: 19 [2023-11-19 07:53:40,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:53:40,192 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:40,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:53:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-19 07:53:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-19 07:53:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-11-19 07:53:40,198 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2023-11-19 07:53:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:40,199 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-11-19 07:53:40,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-11-19 07:53:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 07:53:40,200 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:40,200 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:53:40,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:53:40,201 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 07:53:40,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:40,202 INFO L85 PathProgramCache]: Analyzing trace with hash -822685100, now seen corresponding path program 1 times [2023-11-19 07:53:40,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:40,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866428070] [2023-11-19 07:53:40,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:40,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:53:40,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:40,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866428070] [2023-11-19 07:53:40,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866428070] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:53:40,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528358518] [2023-11-19 07:53:40,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:40,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:53:40,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:53:40,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:53:40,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:53:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:40,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-19 07:53:40,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:53:40,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:53:41,174 INFO L349 Elim1Store]: treesize reduction 216, result has 27.5 percent of original size [2023-11-19 07:53:41,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 238 [2023-11-19 07:53:41,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 198 [2023-11-19 07:53:41,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-19 07:53:41,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-19 07:53:41,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-19 07:53:41,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-19 07:53:41,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-19 07:53:41,799 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:53:41,808 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:53:41,811 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:53:41,832 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-11-19 07:53:41,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 125 treesize of output 104 [2023-11-19 07:53:41,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-19 07:53:41,961 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:53:41,977 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:53:41,979 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:53:42,023 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-11-19 07:53:42,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 93 [2023-11-19 07:53:42,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-19 07:53:42,853 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:53:42,854 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:53:42,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-11-19 07:53:42,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-19 07:53:43,682 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:53:43,695 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-19 07:53:43,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 46 [2023-11-19 07:53:48,424 INFO L349 Elim1Store]: treesize reduction 140, result has 38.1 percent of original size [2023-11-19 07:53:48,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 13114 treesize of output 11915 [2023-11-19 07:53:48,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1394 treesize of output 1386 [2023-11-19 07:53:49,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1386 treesize of output 1380 [2023-11-19 07:53:49,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1380 treesize of output 1378 [2023-11-19 07:53:49,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1378 treesize of output 1372 [2023-11-19 07:53:49,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1372 treesize of output 1370 [2023-11-19 07:53:50,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2023-11-19 07:53:50,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-11-19 07:53:50,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-11-19 07:53:50,889 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-19 07:53:50,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2023-11-19 07:53:51,121 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:53:51,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2023-11-19 07:53:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:53:51,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:53:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:53:51,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528358518] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:53:51,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:53:51,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2023-11-19 07:53:51,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886876436] [2023-11-19 07:53:51,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:53:51,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-19 07:53:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:51,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-19 07:53:51,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=229, Unknown=7, NotChecked=0, Total=306 [2023-11-19 07:53:51,481 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:56,253 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2023-11-19 07:53:56,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:53:56,258 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 07:53:56,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:56,258 INFO L225 Difference]: With dead ends: 20 [2023-11-19 07:53:56,258 INFO L226 Difference]: Without dead ends: 19 [2023-11-19 07:53:56,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=213, Invalid=460, Unknown=29, NotChecked=0, Total=702 [2023-11-19 07:53:56,260 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 12 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:53:56,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 23 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 40 Invalid, 11 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:53:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-19 07:53:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2023-11-19 07:53:56,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-11-19 07:53:56,272 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2023-11-19 07:53:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:56,272 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-11-19 07:53:56,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:53:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-11-19 07:53:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 07:53:56,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:56,273 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-19 07:53:56,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:53:56,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:53:56,496 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 07:53:56,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash -326396970, now seen corresponding path program 1 times [2023-11-19 07:53:56,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:56,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701431575] [2023-11-19 07:53:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:53:57,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701431575] [2023-11-19 07:53:57,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701431575] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:53:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106703129] [2023-11-19 07:53:57,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:57,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:53:57,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:53:57,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:53:57,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:53:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:57,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-19 07:53:57,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:53:57,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:53:57,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:53:57,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:53:57,558 INFO L349 Elim1Store]: treesize reduction 123, result has 34.2 percent of original size [2023-11-19 07:53:57,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 220 [2023-11-19 07:53:57,607 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-19 07:53:57,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 104 [2023-11-19 07:53:57,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-19 07:53:57,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-19 07:53:57,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-19 07:53:57,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-19 07:53:57,963 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:53:57,985 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:53:58,032 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-11-19 07:53:58,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 124 [2023-11-19 07:53:58,655 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2023-11-19 07:53:58,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 59 [2023-11-19 07:54:00,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:54:00,109 INFO L349 Elim1Store]: treesize reduction 107, result has 29.1 percent of original size [2023-11-19 07:54:00,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 524 treesize of output 491 [2023-11-19 07:54:00,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-19 07:54:00,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-19 07:54:00,368 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-19 07:54:00,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2023-11-19 07:54:00,829 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:54:00,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2023-11-19 07:54:00,854 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:54:00,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2023-11-19 07:54:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:54:00,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:54:00,869 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_173 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_173) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483648))) is different from false [2023-11-19 07:54:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-19 07:54:03,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106703129] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:54:03,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:54:03,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 24 [2023-11-19 07:54:03,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480983027] [2023-11-19 07:54:03,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:54:03,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-19 07:54:03,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:03,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-19 07:54:03,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=420, Unknown=15, NotChecked=44, Total=600 [2023-11-19 07:54:03,906 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 25 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:54:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:04,910 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2023-11-19 07:54:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:54:04,910 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 25 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 07:54:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:04,911 INFO L225 Difference]: With dead ends: 22 [2023-11-19 07:54:04,911 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 07:54:04,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=354, Invalid=825, Unknown=15, NotChecked=66, Total=1260 [2023-11-19 07:54:04,913 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:04,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 16 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 59 Invalid, 0 Unknown, 13 Unchecked, 0.2s Time] [2023-11-19 07:54:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 07:54:04,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 07:54:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:54:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 07:54:04,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2023-11-19 07:54:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:04,915 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:54:04,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 25 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:54:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 07:54:04,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 07:54:04,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2023-11-19 07:54:04,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2023-11-19 07:54:04,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2023-11-19 07:54:04,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2023-11-19 07:54:04,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:54:05,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 07:54:05,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 07:54:05,914 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 558) no Hoare annotation was computed. [2023-11-19 07:54:05,914 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 07:54:05,914 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 559) no Hoare annotation was computed. [2023-11-19 07:54:05,915 INFO L899 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2023-11-19 07:54:05,915 INFO L899 garLoopResultBuilder]: For program point L558-1(line 558) no Hoare annotation was computed. [2023-11-19 07:54:05,915 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 07:54:05,915 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 563 565) no Hoare annotation was computed. [2023-11-19 07:54:05,915 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-19 07:54:05,915 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 558) no Hoare annotation was computed. [2023-11-19 07:54:05,915 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 559) no Hoare annotation was computed. [2023-11-19 07:54:05,915 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-19 07:54:05,915 INFO L899 garLoopResultBuilder]: For program point L559(line 559) no Hoare annotation was computed. [2023-11-19 07:54:05,915 INFO L899 garLoopResultBuilder]: For program point L559-1(line 559) no Hoare annotation was computed. [2023-11-19 07:54:05,916 INFO L899 garLoopResultBuilder]: For program point L557-1(line 557) no Hoare annotation was computed. [2023-11-19 07:54:05,916 INFO L899 garLoopResultBuilder]: For program point L557-3(lines 557 560) no Hoare annotation was computed. [2023-11-19 07:54:05,916 INFO L895 garLoopResultBuilder]: At program point L557-5(lines 557 560) the Hoare annotation is: (let ((.cse17 (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse9 (select .cse17 0)) (.cse12 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse0 (<= (select .cse12 0) 2147483647)) (.cse1 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse2 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse3 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse4 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse5 (<= .cse9 2147483647)) (.cse6 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse8 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 (+ .cse8 2147483648)) (<= .cse8 .cse9)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or (exists ((|ULTIMATE.start_test_fun_#t~malloc5#1.base| Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse20 (select |#memory_int| |ULTIMATE.start_test_fun_#t~malloc5#1.base|))) (let ((.cse16 (store (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_9) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_11) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse20))) (let ((.cse11 (select .cse16 |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse10 (select .cse16 |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse10 v_DerPreprocessor_10) (= v_DerPreprocessor_9 .cse11) (exists ((v_prenex_50 (Array Int Int)) (v_prenex_51 (Array Int Int)) (v_prenex_49 (Array Int Int))) (let ((.cse19 (store (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_49) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_51) |ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_50) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse20))) (let ((.cse18 (select .cse19 |ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (let ((.cse14 (select .cse19 |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse15 (select .cse18 0)) (.cse13 (select .cse19 |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse12 .cse13) (= .cse14 v_prenex_49) (= .cse8 .cse15) (= .cse14 .cse11) (= (select .cse16 |ULTIMATE.start_test_fun_~z_ref~0#1.base|) (store .cse14 0 .cse15)) (= .cse14 .cse17) (= .cse18 (store .cse13 0 .cse15)) (= .cse10 .cse13) (= .cse13 v_prenex_51))))))))))) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |ULTIMATE.start_test_fun_~z_ref~0#1.base|)))) (exists ((v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_prenex_38 (Array Int Int)) (v_prenex_37 (Array Int Int))) (let ((.cse22 (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_9) |ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_11) |ULTIMATE.start_test_fun_~y_ref~0#1.base| .cse12)) (.cse25 (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_37) |ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_38) |ULTIMATE.start_test_fun_~y_ref~0#1.base| .cse12))) (let ((.cse21 (select (select .cse25 |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 0)) (.cse24 (select .cse22 |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse23 (select .cse25 |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= .cse8 .cse21) (= (select .cse22 |ULTIMATE.start_test_fun_~z_ref~0#1.base|) (store .cse23 0 .cse21)) (= .cse23 .cse17) (= .cse24 v_DerPreprocessor_9) (= .cse24 .cse23) (= v_prenex_37 .cse23))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_prenex_47 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_prenex_48 (Array Int Int))) (let ((.cse31 (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_48) |ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_47) |ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse17))) (let ((.cse30 (select .cse31 |ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse28 (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_11) |ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse17))) (let ((.cse26 (select .cse28 |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse27 (select .cse31 |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse29 (select .cse30 0))) (and (= v_DerPreprocessor_10 .cse26) (= .cse27 .cse26) (= .cse12 .cse27) (= (select (select .cse28 |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 0) .cse29) (= v_prenex_48 .cse27) (= (store .cse27 0 .cse29) .cse30) (= .cse8 .cse29))))))) (forall ((|v_ULTIMATE.start_test_fun_#t~mem11#1_14| Int)) (or (< |v_ULTIMATE.start_test_fun_#t~mem11#1_14| .cse9) (forall ((v_ArrVal_173 (Array Int Int)) (|ULTIMATE.start_test_fun_#t~mem12#1| Int)) (let ((.cse32 (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse17 0 (+ (- 1) |v_ULTIMATE.start_test_fun_#t~mem11#1_14|))))) (let ((.cse33 (store (select .cse32 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 (+ (- 1) |ULTIMATE.start_test_fun_#t~mem12#1|)))) (or (< |ULTIMATE.start_test_fun_#t~mem12#1| (+ 2 (select (select (store .cse32 |ULTIMATE.start_test_fun_~y_ref~0#1.base| .cse33) |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 0))) (< 0 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| .cse33) |ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_173) |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) 2147483648))))))))))))) [2023-11-19 07:54:05,917 INFO L899 garLoopResultBuilder]: For program point L557-6(lines 557 560) no Hoare annotation was computed. [2023-11-19 07:54:05,917 INFO L899 garLoopResultBuilder]: For program point test_fun_returnLabel#1(lines 547 562) no Hoare annotation was computed. [2023-11-19 07:54:05,920 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-19 07:54:05,923 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:54:05,945 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-19 07:54:05,949 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-19 07:54:05,949 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~z_ref~0!base][0] could not be translated [2023-11-19 07:54:05,949 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~z_ref~0!base][0] could not be translated [2023-11-19 07:54:05,949 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-19 07:54:05,949 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-19 07:54:05,950 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-19 07:54:05,950 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_test_fun_#t~malloc5#1.base : int :: (exists v_DerPreprocessor_10 : [int]int, v_DerPreprocessor_9 : [int]int, v_DerPreprocessor_11 : [int]int :: (#memory_int[~x_ref~0!base := v_DerPreprocessor_9][~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~y_ref~0!base] == v_DerPreprocessor_10 && v_DerPreprocessor_9 == #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~x_ref~0!base]) && (exists v_prenex_50 : [int]int, v_prenex_51 : [int]int, v_prenex_49 : [int]int :: (((((((#memory_int[~y_ref~0!base] == #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~y_ref~0!base] && #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~x_ref~0!base] == v_prenex_49) && #memory_int[~z_ref~0!base][0] == #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~z_ref~0!base][0]) && #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~x_ref~0!base] == #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~x_ref~0!base]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~z_ref~0!base] == #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~x_ref~0!base][0 := #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~z_ref~0!base][0]]) && #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~x_ref~0!base] == #memory_int[~x_ref~0!base]) && #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~z_ref~0!base] == #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~y_ref~0!base][0 := #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~z_ref~0!base][0]]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~y_ref~0!base] == #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~y_ref~0!base]) && #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~y_ref~0!base] == v_prenex_51)) && !(ULTIMATE.start_test_fun_#t~malloc5#1.base == ~z_ref~0!base)) could not be translated [2023-11-19 07:54:05,951 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_9 : [int]int, v_DerPreprocessor_11 : [int]int, v_prenex_38 : [int]int, v_prenex_37 : [int]int :: ((((#memory_int[~z_ref~0!base][0] == #memory_int[~x_ref~0!base := v_prenex_37][~z_ref~0!base := v_prenex_38][~y_ref~0!base := #memory_int[~y_ref~0!base]][~z_ref~0!base][0] && #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~z_ref~0!base := v_DerPreprocessor_11][~y_ref~0!base := #memory_int[~y_ref~0!base]][~z_ref~0!base] == #memory_int[~x_ref~0!base := v_prenex_37][~z_ref~0!base := v_prenex_38][~y_ref~0!base := #memory_int[~y_ref~0!base]][~x_ref~0!base][0 := #memory_int[~x_ref~0!base := v_prenex_37][~z_ref~0!base := v_prenex_38][~y_ref~0!base := #memory_int[~y_ref~0!base]][~z_ref~0!base][0]]) && #memory_int[~x_ref~0!base := v_prenex_37][~z_ref~0!base := v_prenex_38][~y_ref~0!base := #memory_int[~y_ref~0!base]][~x_ref~0!base] == #memory_int[~x_ref~0!base]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~z_ref~0!base := v_DerPreprocessor_11][~y_ref~0!base := #memory_int[~y_ref~0!base]][~x_ref~0!base] == v_DerPreprocessor_9) && #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~z_ref~0!base := v_DerPreprocessor_11][~y_ref~0!base := #memory_int[~y_ref~0!base]][~x_ref~0!base] == #memory_int[~x_ref~0!base := v_prenex_37][~z_ref~0!base := v_prenex_38][~y_ref~0!base := #memory_int[~y_ref~0!base]][~x_ref~0!base]) && v_prenex_37 == #memory_int[~x_ref~0!base := v_prenex_37][~z_ref~0!base := v_prenex_38][~y_ref~0!base := #memory_int[~y_ref~0!base]][~x_ref~0!base]) could not be translated [2023-11-19 07:54:05,951 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_10 : [int]int, v_prenex_47 : [int]int, v_DerPreprocessor_11 : [int]int, v_prenex_48 : [int]int :: (((((v_DerPreprocessor_10 == #memory_int[~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base] && #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base] == #memory_int[~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base]) && #memory_int[~y_ref~0!base] == #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base]) && #memory_int[~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][~x_ref~0!base := #memory_int[~x_ref~0!base]][~z_ref~0!base][0] == #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~z_ref~0!base][0]) && v_prenex_48 == #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base]) && #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0 := #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~z_ref~0!base][0]] == #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~z_ref~0!base]) && #memory_int[~z_ref~0!base][0] == #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~z_ref~0!base][0]) could not be translated [2023-11-19 07:54:05,951 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_test_fun_#t~mem11#1_14 : int :: v_ULTIMATE.start_test_fun_#t~mem11#1_14 < #memory_int[~x_ref~0!base][0] || (forall v_ArrVal_173 : [int]int, ULTIMATE.start_test_fun_#t~mem12#1 : int :: ULTIMATE.start_test_fun_#t~mem12#1 < 2 + #memory_int[~x_ref~0!base := #memory_int[~x_ref~0!base][0 := -1 + v_ULTIMATE.start_test_fun_#t~mem11#1_14]][~y_ref~0!base := #memory_int[~x_ref~0!base := #memory_int[~x_ref~0!base][0 := -1 + v_ULTIMATE.start_test_fun_#t~mem11#1_14]][~y_ref~0!base][0 := -1 + ULTIMATE.start_test_fun_#t~mem12#1]][~z_ref~0!base][0] || 0 < #memory_int[~y_ref~0!base := #memory_int[~x_ref~0!base := #memory_int[~x_ref~0!base][0 := -1 + v_ULTIMATE.start_test_fun_#t~mem11#1_14]][~y_ref~0!base][0 := -1 + ULTIMATE.start_test_fun_#t~mem12#1]][~x_ref~0!base := v_ArrVal_173][~y_ref~0!base][0] + 2147483648)) could not be translated [2023-11-19 07:54:05,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:54:05 BoogieIcfgContainer [2023-11-19 07:54:05,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:54:05,953 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:54:05,953 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:54:05,953 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:54:05,954 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:37" (3/4) ... [2023-11-19 07:54:05,956 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 07:54:05,965 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-11-19 07:54:05,965 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-19 07:54:05,965 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-19 07:54:05,966 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 07:54:06,058 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:54:06,059 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 07:54:06,059 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:54:06,060 INFO L158 Benchmark]: Toolchain (without parser) took 29517.41ms. Allocated memory was 176.2MB in the beginning and 499.1MB in the end (delta: 323.0MB). Free memory was 146.0MB in the beginning and 220.6MB in the end (delta: -74.7MB). Peak memory consumption was 249.8MB. Max. memory is 16.1GB. [2023-11-19 07:54:06,060 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 113.2MB. Free memory was 63.0MB in the beginning and 62.8MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:54:06,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.27ms. Allocated memory is still 176.2MB. Free memory was 146.0MB in the beginning and 130.0MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:54:06,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.97ms. Allocated memory is still 176.2MB. Free memory was 130.0MB in the beginning and 128.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:54:06,062 INFO L158 Benchmark]: Boogie Preprocessor took 28.04ms. Allocated memory is still 176.2MB. Free memory was 128.0MB in the beginning and 126.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:54:06,062 INFO L158 Benchmark]: RCFGBuilder took 385.31ms. Allocated memory is still 176.2MB. Free memory was 126.7MB in the beginning and 114.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 07:54:06,063 INFO L158 Benchmark]: TraceAbstraction took 28512.66ms. Allocated memory was 176.2MB in the beginning and 499.1MB in the end (delta: 323.0MB). Free memory was 113.7MB in the beginning and 224.8MB in the end (delta: -111.1MB). Peak memory consumption was 214.1MB. Max. memory is 16.1GB. [2023-11-19 07:54:06,064 INFO L158 Benchmark]: Witness Printer took 106.19ms. Allocated memory is still 499.1MB. Free memory was 224.8MB in the beginning and 220.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:54:06,067 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 113.2MB. Free memory was 63.0MB in the beginning and 62.8MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.27ms. Allocated memory is still 176.2MB. Free memory was 146.0MB in the beginning and 130.0MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.97ms. Allocated memory is still 176.2MB. Free memory was 130.0MB in the beginning and 128.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.04ms. Allocated memory is still 176.2MB. Free memory was 128.0MB in the beginning and 126.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.31ms. Allocated memory is still 176.2MB. Free memory was 126.7MB in the beginning and 114.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28512.66ms. Allocated memory was 176.2MB in the beginning and 499.1MB in the end (delta: 323.0MB). Free memory was 113.7MB in the beginning and 224.8MB in the end (delta: -111.1MB). Peak memory consumption was 214.1MB. Max. memory is 16.1GB. * Witness Printer took 106.19ms. Allocated memory is still 499.1MB. Free memory was 224.8MB in the beginning and 220.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~z_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~z_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_test_fun_#t~malloc5#1.base : int :: (exists v_DerPreprocessor_10 : [int]int, v_DerPreprocessor_9 : [int]int, v_DerPreprocessor_11 : [int]int :: (#memory_int[~x_ref~0!base := v_DerPreprocessor_9][~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~y_ref~0!base] == v_DerPreprocessor_10 && v_DerPreprocessor_9 == #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~x_ref~0!base]) && (exists v_prenex_50 : [int]int, v_prenex_51 : [int]int, v_prenex_49 : [int]int :: (((((((#memory_int[~y_ref~0!base] == #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~y_ref~0!base] && #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~x_ref~0!base] == v_prenex_49) && #memory_int[~z_ref~0!base][0] == #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~z_ref~0!base][0]) && #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~x_ref~0!base] == #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~x_ref~0!base]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~z_ref~0!base] == #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~x_ref~0!base][0 := #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~z_ref~0!base][0]]) && #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~x_ref~0!base] == #memory_int[~x_ref~0!base]) && #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~z_ref~0!base] == #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~y_ref~0!base][0 := #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~z_ref~0!base][0]]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~y_ref~0!base] == #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~y_ref~0!base]) && #memory_int[~x_ref~0!base := v_prenex_49][~y_ref~0!base := v_prenex_51][~z_ref~0!base := v_prenex_50][ULTIMATE.start_test_fun_#t~malloc5#1.base := #memory_int[ULTIMATE.start_test_fun_#t~malloc5#1.base]][~y_ref~0!base] == v_prenex_51)) && !(ULTIMATE.start_test_fun_#t~malloc5#1.base == ~z_ref~0!base)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_9 : [int]int, v_DerPreprocessor_11 : [int]int, v_prenex_38 : [int]int, v_prenex_37 : [int]int :: ((((#memory_int[~z_ref~0!base][0] == #memory_int[~x_ref~0!base := v_prenex_37][~z_ref~0!base := v_prenex_38][~y_ref~0!base := #memory_int[~y_ref~0!base]][~z_ref~0!base][0] && #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~z_ref~0!base := v_DerPreprocessor_11][~y_ref~0!base := #memory_int[~y_ref~0!base]][~z_ref~0!base] == #memory_int[~x_ref~0!base := v_prenex_37][~z_ref~0!base := v_prenex_38][~y_ref~0!base := #memory_int[~y_ref~0!base]][~x_ref~0!base][0 := #memory_int[~x_ref~0!base := v_prenex_37][~z_ref~0!base := v_prenex_38][~y_ref~0!base := #memory_int[~y_ref~0!base]][~z_ref~0!base][0]]) && #memory_int[~x_ref~0!base := v_prenex_37][~z_ref~0!base := v_prenex_38][~y_ref~0!base := #memory_int[~y_ref~0!base]][~x_ref~0!base] == #memory_int[~x_ref~0!base]) && #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~z_ref~0!base := v_DerPreprocessor_11][~y_ref~0!base := #memory_int[~y_ref~0!base]][~x_ref~0!base] == v_DerPreprocessor_9) && #memory_int[~x_ref~0!base := v_DerPreprocessor_9][~z_ref~0!base := v_DerPreprocessor_11][~y_ref~0!base := #memory_int[~y_ref~0!base]][~x_ref~0!base] == #memory_int[~x_ref~0!base := v_prenex_37][~z_ref~0!base := v_prenex_38][~y_ref~0!base := #memory_int[~y_ref~0!base]][~x_ref~0!base]) && v_prenex_37 == #memory_int[~x_ref~0!base := v_prenex_37][~z_ref~0!base := v_prenex_38][~y_ref~0!base := #memory_int[~y_ref~0!base]][~x_ref~0!base]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_DerPreprocessor_10 : [int]int, v_prenex_47 : [int]int, v_DerPreprocessor_11 : [int]int, v_prenex_48 : [int]int :: (((((v_DerPreprocessor_10 == #memory_int[~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base] && #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base] == #memory_int[~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base]) && #memory_int[~y_ref~0!base] == #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base]) && #memory_int[~y_ref~0!base := v_DerPreprocessor_10][~z_ref~0!base := v_DerPreprocessor_11][~x_ref~0!base := #memory_int[~x_ref~0!base]][~z_ref~0!base][0] == #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~z_ref~0!base][0]) && v_prenex_48 == #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base]) && #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~y_ref~0!base][0 := #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~z_ref~0!base][0]] == #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~z_ref~0!base]) && #memory_int[~z_ref~0!base][0] == #memory_int[~y_ref~0!base := v_prenex_48][~z_ref~0!base := v_prenex_47][~x_ref~0!base := #memory_int[~x_ref~0!base]][~z_ref~0!base][0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_test_fun_#t~mem11#1_14 : int :: v_ULTIMATE.start_test_fun_#t~mem11#1_14 < #memory_int[~x_ref~0!base][0] || (forall v_ArrVal_173 : [int]int, ULTIMATE.start_test_fun_#t~mem12#1 : int :: ULTIMATE.start_test_fun_#t~mem12#1 < 2 + #memory_int[~x_ref~0!base := #memory_int[~x_ref~0!base][0 := -1 + v_ULTIMATE.start_test_fun_#t~mem11#1_14]][~y_ref~0!base := #memory_int[~x_ref~0!base := #memory_int[~x_ref~0!base][0 := -1 + v_ULTIMATE.start_test_fun_#t~mem11#1_14]][~y_ref~0!base][0 := -1 + ULTIMATE.start_test_fun_#t~mem12#1]][~z_ref~0!base][0] || 0 < #memory_int[~y_ref~0!base := #memory_int[~x_ref~0!base := #memory_int[~x_ref~0!base][0 := -1 + v_ULTIMATE.start_test_fun_#t~mem11#1_14]][~y_ref~0!base][0 := -1 + ULTIMATE.start_test_fun_#t~mem12#1]][~x_ref~0!base := v_ArrVal_173][~y_ref~0!base][0] + 2147483648)) could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 28.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 13 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 197 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 33 mSDtfsCounter, 197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=3, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 844 HoareAnnotationTreeSize, 1 FomulaSimplifications, 656 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 82 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 104 ConstructedInterpolants, 34 QuantifiedInterpolants, 11191 SizeOfPredicates, 48 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 0/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-19 07:54:06,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fbeda45-58e6-408f-bbf6-aef285675967/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE