./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/array-tiling/pnr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cf1a7837 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_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-tiling/pnr3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e32269e91be552d606173d0b8eafd4ffa81c0e735dd375e4417d1ccfc27eaf5e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:51:53,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:51:53,388 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-12 00:51:53,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:51:53,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:51:53,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:51:53,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:51:53,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:51:53,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:51:53,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:51:53,463 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:51:53,464 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:51:53,465 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:51:53,471 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:51:53,473 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:51:53,473 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:51:53,473 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:51:53,474 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:51:53,474 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:51:53,475 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:51:53,475 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:51:53,476 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:51:53,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:51:53,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:51:53,478 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:51:53,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:51:53,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:51:53,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:51:53,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:51:53,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:51:53,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:51:53,483 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 00:51:53,484 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:51:53,484 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:51:53,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:51:53,484 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:51:53,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:51:53,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:51:53,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:51:53,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:51:53,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:51:53,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:51:53,487 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:51:53,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:51:53,488 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:51:53,488 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:51:53,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:51:53,489 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/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_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e32269e91be552d606173d0b8eafd4ffa81c0e735dd375e4417d1ccfc27eaf5e [2023-11-12 00:51:53,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:51:53,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:51:53,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:51:53,798 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:51:53,799 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:51:53,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/array-tiling/pnr3.c [2023-11-12 00:51:56,973 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:51:57,179 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:51:57,180 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/sv-benchmarks/c/array-tiling/pnr3.c [2023-11-12 00:51:57,188 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/data/d8b88c97a/3db96a24157447e793c73fc526ad0369/FLAG1a46fec6e [2023-11-12 00:51:57,200 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/data/d8b88c97a/3db96a24157447e793c73fc526ad0369 [2023-11-12 00:51:57,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:51:57,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:51:57,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:51:57,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:51:57,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:51:57,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:51:57" (1/1) ... [2023-11-12 00:51:57,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@492399c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57, skipping insertion in model container [2023-11-12 00:51:57,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:51:57" (1/1) ... [2023-11-12 00:51:57,241 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:51:57,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:51:57,450 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:51:57,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:51:57,491 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:51:57,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57 WrapperNode [2023-11-12 00:51:57,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:51:57,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:51:57,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:51:57,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:51:57,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57" (1/1) ... [2023-11-12 00:51:57,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57" (1/1) ... [2023-11-12 00:51:57,537 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2023-11-12 00:51:57,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:51:57,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:51:57,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:51:57,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:51:57,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57" (1/1) ... [2023-11-12 00:51:57,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57" (1/1) ... [2023-11-12 00:51:57,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57" (1/1) ... [2023-11-12 00:51:57,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57" (1/1) ... [2023-11-12 00:51:57,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57" (1/1) ... [2023-11-12 00:51:57,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57" (1/1) ... [2023-11-12 00:51:57,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57" (1/1) ... [2023-11-12 00:51:57,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57" (1/1) ... [2023-11-12 00:51:57,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:51:57,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:51:57,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:51:57,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:51:57,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57" (1/1) ... [2023-11-12 00:51:57,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:51:57,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:57,606 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:51:57,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:51:57,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:51:57,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:51:57,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:51:57,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:51:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2023-11-12 00:51:57,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadFromPort [2023-11-12 00:51:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:51:57,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:51:57,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:51:57,717 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:51:57,719 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:51:58,031 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:51:58,086 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:51:58,086 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 00:51:58,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:58 BoogieIcfgContainer [2023-11-12 00:51:58,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:51:58,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:51:58,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:51:58,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:51:58,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:51:57" (1/3) ... [2023-11-12 00:51:58,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feaec54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:51:58, skipping insertion in model container [2023-11-12 00:51:58,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:57" (2/3) ... [2023-11-12 00:51:58,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feaec54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:51:58, skipping insertion in model container [2023-11-12 00:51:58,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:58" (3/3) ... [2023-11-12 00:51:58,100 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr3.c [2023-11-12 00:51:58,121 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:51:58,121 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-12 00:51:58,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:51:58,185 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=FINITE_AUTOMATA, 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;@65db35e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:51:58,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-11-12 00:51:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 46 states have (on average 1.826086956521739) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:51:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 00:51:58,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:58,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 00:51:58,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-12 00:51:58,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:58,203 INFO L85 PathProgramCache]: Analyzing trace with hash 5642302, now seen corresponding path program 1 times [2023-11-12 00:51:58,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:58,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300126301] [2023-11-12 00:51:58,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:58,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:58,765 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-12 00:51:58,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:58,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300126301] [2023-11-12 00:51:58,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300126301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:58,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:58,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:58,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981255701] [2023-11-12 00:51:58,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:58,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:51:58,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:58,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:51:58,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:51:58,811 INFO L87 Difference]: Start difference. First operand has 81 states, 46 states have (on average 1.826086956521739) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-12 00:51:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:58,948 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2023-11-12 00:51:58,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:51:58,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2023-11-12 00:51:58,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:58,960 INFO L225 Difference]: With dead ends: 95 [2023-11-12 00:51:58,961 INFO L226 Difference]: Without dead ends: 77 [2023-11-12 00:51:58,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:51:58,971 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 161 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:58,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 78 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-12 00:51:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-12 00:51:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 44 states have (on average 1.75) internal successors, (77), 72 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:51:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2023-11-12 00:51:59,033 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 4 [2023-11-12 00:51:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:59,034 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2023-11-12 00:51:59,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-12 00:51:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2023-11-12 00:51:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:51:59,035 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:59,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:51:59,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:51:59,036 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-12 00:51:59,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:59,038 INFO L85 PathProgramCache]: Analyzing trace with hash 174911418, now seen corresponding path program 1 times [2023-11-12 00:51:59,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:59,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152131412] [2023-11-12 00:51:59,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:59,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:59,303 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-12 00:51:59,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:59,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152131412] [2023-11-12 00:51:59,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152131412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:59,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:59,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:59,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286919040] [2023-11-12 00:51:59,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:59,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:51:59,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:59,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:51:59,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:59,312 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-12 00:51:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:59,416 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2023-11-12 00:51:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:51:59,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2023-11-12 00:51:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:59,419 INFO L225 Difference]: With dead ends: 77 [2023-11-12 00:51:59,420 INFO L226 Difference]: Without dead ends: 76 [2023-11-12 00:51:59,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:51:59,422 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:59,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 73 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:51:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-12 00:51:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-12 00:51:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 71 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:51:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2023-11-12 00:51:59,436 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 5 [2023-11-12 00:51:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:59,437 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2023-11-12 00:51:59,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-12 00:51:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2023-11-12 00:51:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:51:59,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:59,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:59,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:51:59,439 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-12 00:51:59,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:59,440 INFO L85 PathProgramCache]: Analyzing trace with hash 649560652, now seen corresponding path program 1 times [2023-11-12 00:51:59,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:59,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920007762] [2023-11-12 00:51:59,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:59,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:59,524 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-12 00:51:59,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920007762] [2023-11-12 00:51:59,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920007762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:59,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:59,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:59,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697536186] [2023-11-12 00:51:59,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:59,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:51:59,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:59,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:51:59,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:51:59,528 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-12 00:51:59,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:59,643 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2023-11-12 00:51:59,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:51:59,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-12 00:51:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:59,645 INFO L225 Difference]: With dead ends: 81 [2023-11-12 00:51:59,645 INFO L226 Difference]: Without dead ends: 79 [2023-11-12 00:51:59,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:59,648 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:59,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 173 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-12 00:51:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-12 00:51:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 74 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:51:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2023-11-12 00:51:59,662 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 9 [2023-11-12 00:51:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:59,662 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2023-11-12 00:51:59,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-12 00:51:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2023-11-12 00:51:59,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:51:59,664 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:59,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:59,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:51:59,665 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-12 00:51:59,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:59,666 INFO L85 PathProgramCache]: Analyzing trace with hash 761537654, now seen corresponding path program 1 times [2023-11-12 00:51:59,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:59,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113812130] [2023-11-12 00:51:59,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:59,720 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-12 00:51:59,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:59,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113812130] [2023-11-12 00:51:59,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113812130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:59,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:59,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:51:59,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139861464] [2023-11-12 00:51:59,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:59,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:51:59,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:59,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:51:59,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:51:59,727 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 00:51:59,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:59,907 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2023-11-12 00:51:59,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:51:59,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-12 00:51:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:59,912 INFO L225 Difference]: With dead ends: 145 [2023-11-12 00:51:59,912 INFO L226 Difference]: Without dead ends: 121 [2023-11-12 00:51:59,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:51:59,921 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 36 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:59,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 74 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-12 00:51:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2023-11-12 00:51:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 80 states have (on average 1.45) internal successors, (116), 107 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:51:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2023-11-12 00:51:59,939 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 12 [2023-11-12 00:51:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:59,941 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2023-11-12 00:51:59,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-12 00:51:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2023-11-12 00:51:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:51:59,942 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:59,942 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:59,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:51:59,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-12 00:51:59,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:59,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2061085254, now seen corresponding path program 1 times [2023-11-12 00:51:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:59,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661277746] [2023-11-12 00:51:59,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-12 00:52:00,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:00,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661277746] [2023-11-12 00:52:00,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661277746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:00,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:00,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:52:00,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214534429] [2023-11-12 00:52:00,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:00,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:52:00,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:00,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:52:00,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:52:00,131 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-12 00:52:00,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:00,332 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2023-11-12 00:52:00,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:52:00,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 12 [2023-11-12 00:52:00,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:00,334 INFO L225 Difference]: With dead ends: 129 [2023-11-12 00:52:00,334 INFO L226 Difference]: Without dead ends: 120 [2023-11-12 00:52:00,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:52:00,336 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 118 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:00,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 61 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:52:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-12 00:52:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2023-11-12 00:52:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 80 states have (on average 1.4375) internal successors, (115), 107 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:52:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2023-11-12 00:52:00,350 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 12 [2023-11-12 00:52:00,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:00,351 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2023-11-12 00:52:00,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-12 00:52:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2023-11-12 00:52:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-12 00:52:00,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:00,353 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:00,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:52:00,353 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-12 00:52:00,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:00,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1385228334, now seen corresponding path program 1 times [2023-11-12 00:52:00,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:00,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125446246] [2023-11-12 00:52:00,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:00,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:52:00,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:00,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125446246] [2023-11-12 00:52:00,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125446246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:00,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:00,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:52:00,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931476438] [2023-11-12 00:52:00,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:00,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:52:00,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:00,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:52:00,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:52:00,449 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:52:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:00,594 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2023-11-12 00:52:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:52:00,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2023-11-12 00:52:00,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:00,597 INFO L225 Difference]: With dead ends: 120 [2023-11-12 00:52:00,598 INFO L226 Difference]: Without dead ends: 118 [2023-11-12 00:52:00,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:52:00,601 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 18 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:00,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 121 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:52:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-12 00:52:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-12 00:52:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 110 states have internal predecessors, (118), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:52:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2023-11-12 00:52:00,626 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 35 [2023-11-12 00:52:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:00,626 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2023-11-12 00:52:00,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:52:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2023-11-12 00:52:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-12 00:52:00,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:00,629 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:00,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:52:00,629 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-12 00:52:00,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:00,630 INFO L85 PathProgramCache]: Analyzing trace with hash -406809134, now seen corresponding path program 1 times [2023-11-12 00:52:00,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:00,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314923447] [2023-11-12 00:52:00,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:00,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 00:52:00,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314923447] [2023-11-12 00:52:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314923447] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:52:00,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281361652] [2023-11-12 00:52:00,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:00,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:00,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:00,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:52:00,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:52:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:00,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:52:00,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 00:52:00,984 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:00,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281361652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:00,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:52:00,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-11-12 00:52:00,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844092235] [2023-11-12 00:52:00,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:00,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:52:00,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:00,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:52:00,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:52:00,986 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 00:52:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:01,194 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2023-11-12 00:52:01,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:52:01,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2023-11-12 00:52:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:01,196 INFO L225 Difference]: With dead ends: 118 [2023-11-12 00:52:01,196 INFO L226 Difference]: Without dead ends: 105 [2023-11-12 00:52:01,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:52:01,199 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 65 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:01,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 109 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:52:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-12 00:52:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-11-12 00:52:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 97 states have internal predecessors, (105), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:52:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2023-11-12 00:52:01,219 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 45 [2023-11-12 00:52:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:01,219 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2023-11-12 00:52:01,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 00:52:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2023-11-12 00:52:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-12 00:52:01,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:01,226 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:01,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:01,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:01,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-12 00:52:01,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:01,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1065535254, now seen corresponding path program 1 times [2023-11-12 00:52:01,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:01,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370749736] [2023-11-12 00:52:01,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:01,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:52:01,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:01,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370749736] [2023-11-12 00:52:01,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370749736] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:52:01,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786184135] [2023-11-12 00:52:01,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:01,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:01,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:01,579 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:52:01,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:52:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:01,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:52:01,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:52:01,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:01,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786184135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:01,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:52:01,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-12 00:52:01,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82242003] [2023-11-12 00:52:01,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:01,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:52:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:01,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:52:01,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:52:01,714 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:52:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:01,861 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2023-11-12 00:52:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:52:01,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-11-12 00:52:01,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:01,863 INFO L225 Difference]: With dead ends: 105 [2023-11-12 00:52:01,863 INFO L226 Difference]: Without dead ends: 104 [2023-11-12 00:52:01,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:52:01,864 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 46 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:01,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 108 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:52:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-12 00:52:01,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-11-12 00:52:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 96 states have internal predecessors, (104), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:52:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2023-11-12 00:52:01,872 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 45 [2023-11-12 00:52:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:01,873 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2023-11-12 00:52:01,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-12 00:52:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2023-11-12 00:52:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-12 00:52:01,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:01,874 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:01,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:02,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:02,087 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-12 00:52:02,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash 273818804, now seen corresponding path program 1 times [2023-11-12 00:52:02,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:02,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573378943] [2023-11-12 00:52:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:02,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 00:52:02,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:02,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573378943] [2023-11-12 00:52:02,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573378943] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:52:02,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398201406] [2023-11-12 00:52:02,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:02,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:02,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:02,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:52:02,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:52:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:02,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:52:02,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 00:52:02,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:52:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 00:52:02,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398201406] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:52:02,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1277400745] [2023-11-12 00:52:02,496 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-11-12 00:52:02,497 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:52:02,500 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:52:02,506 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:52:02,506 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:52:09,116 INFO L197 IcfgInterpreter]: Interpreting procedure ReadFromPort with input of size 1 for LOIs [2023-11-12 00:52:09,118 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:52:11,690 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2493#(and (<= 715827883 |ULTIMATE.start_main_~i~0#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= ~MAX~0 100000) (= |ULTIMATE.start_main_~DEFAULTVAL~0#1| 0) (<= 2 ~SIZE~0) (<= |ULTIMATE.start_main_~value~0#1| 2147483647) (= 10 |ULTIMATE.start_main_~FIXEDVAL~0#1|) (<= ~SIZE~0 99999) (not (= 0 |ULTIMATE.start_main_~value~0#1|)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_~value~0#1|)))' at error location [2023-11-12 00:52:11,690 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:52:11,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:52:11,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-11-12 00:52:11,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671797544] [2023-11-12 00:52:11,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:52:11,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 00:52:11,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:11,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 00:52:11,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=722, Unknown=8, NotChecked=0, Total=870 [2023-11-12 00:52:11,694 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 10 states, 9 states have (on average 10.222222222222221) internal successors, (92), 10 states have internal predecessors, (92), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-12 00:52:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:12,051 INFO L93 Difference]: Finished difference Result 158 states and 192 transitions. [2023-11-12 00:52:12,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:52:12,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.222222222222221) internal successors, (92), 10 states have internal predecessors, (92), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 46 [2023-11-12 00:52:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:12,054 INFO L225 Difference]: With dead ends: 158 [2023-11-12 00:52:12,054 INFO L226 Difference]: Without dead ends: 145 [2023-11-12 00:52:12,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=157, Invalid=827, Unknown=8, NotChecked=0, Total=992 [2023-11-12 00:52:12,056 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 105 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:12,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 138 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:52:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-12 00:52:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2023-11-12 00:52:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 128 states have (on average 1.1328125) internal successors, (145), 131 states have internal predecessors, (145), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-12 00:52:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 165 transitions. [2023-11-12 00:52:12,071 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 165 transitions. Word has length 46 [2023-11-12 00:52:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:12,071 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 165 transitions. [2023-11-12 00:52:12,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.222222222222221) internal successors, (92), 10 states have internal predecessors, (92), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-12 00:52:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 165 transitions. [2023-11-12 00:52:12,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-12 00:52:12,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:12,073 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:12,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:12,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-12 00:52:12,274 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-12 00:52:12,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1328145327, now seen corresponding path program 1 times [2023-11-12 00:52:12,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:12,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523799861] [2023-11-12 00:52:12,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:12,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:52:12,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:12,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523799861] [2023-11-12 00:52:12,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523799861] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:52:12,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334289722] [2023-11-12 00:52:12,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:12,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:12,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:12,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:52:12,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:52:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:12,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:52:12,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:52:12,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:52:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-12 00:52:12,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334289722] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:52:12,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [908717325] [2023-11-12 00:52:12,579 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2023-11-12 00:52:12,579 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:52:12,580 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:52:12,580 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:52:12,580 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:52:17,095 INFO L197 IcfgInterpreter]: Interpreting procedure ReadFromPort with input of size 1 for LOIs [2023-11-12 00:52:17,097 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:52:19,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [908717325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:19,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:52:19,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [5, 5, 5] total 33 [2023-11-12 00:52:19,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255603453] [2023-11-12 00:52:19,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:19,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-12 00:52:19,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:19,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-12 00:52:19,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=926, Unknown=6, NotChecked=0, Total=1122 [2023-11-12 00:52:19,699 INFO L87 Difference]: Start difference. First operand 143 states and 165 transitions. Second operand has 24 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:52:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:27,355 INFO L93 Difference]: Finished difference Result 380 states and 440 transitions. [2023-11-12 00:52:27,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-12 00:52:27,356 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 46 [2023-11-12 00:52:27,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:27,359 INFO L225 Difference]: With dead ends: 380 [2023-11-12 00:52:27,359 INFO L226 Difference]: Without dead ends: 370 [2023-11-12 00:52:27,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1142 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=572, Invalid=2836, Unknown=14, NotChecked=0, Total=3422 [2023-11-12 00:52:27,362 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 199 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 65 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:27,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 113 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1196 Invalid, 8 Unknown, 0 Unchecked, 2.8s Time] [2023-11-12 00:52:27,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-11-12 00:52:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 214. [2023-11-12 00:52:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 191 states have (on average 1.1204188481675392) internal successors, (214), 193 states have internal predecessors, (214), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-12 00:52:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 252 transitions. [2023-11-12 00:52:27,415 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 252 transitions. Word has length 46 [2023-11-12 00:52:27,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:27,416 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 252 transitions. [2023-11-12 00:52:27,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 00:52:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 252 transitions. [2023-11-12 00:52:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-12 00:52:27,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:27,423 INFO L195 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:27,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:27,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 00:52:27,629 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-12 00:52:27,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1942341678, now seen corresponding path program 1 times [2023-11-12 00:52:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:27,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591088338] [2023-11-12 00:52:27,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:27,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-11-12 00:52:27,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:27,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591088338] [2023-11-12 00:52:27,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591088338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:27,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:27,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:52:27,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597244956] [2023-11-12 00:52:27,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:27,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:52:27,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:27,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:52:27,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:52:27,736 INFO L87 Difference]: Start difference. First operand 214 states and 252 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-12 00:52:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:27,828 INFO L93 Difference]: Finished difference Result 214 states and 252 transitions. [2023-11-12 00:52:27,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:52:27,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2023-11-12 00:52:27,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:27,831 INFO L225 Difference]: With dead ends: 214 [2023-11-12 00:52:27,831 INFO L226 Difference]: Without dead ends: 213 [2023-11-12 00:52:27,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:52:27,833 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:27,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 49 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:52:27,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-11-12 00:52:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 134. [2023-11-12 00:52:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.0991735537190082) internal successors, (133), 122 states have internal predecessors, (133), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-12 00:52:27,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2023-11-12 00:52:27,858 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 102 [2023-11-12 00:52:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:27,858 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2023-11-12 00:52:27,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-12 00:52:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2023-11-12 00:52:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-12 00:52:27,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:27,862 INFO L195 NwaCegarLoop]: trace histogram [10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2023-11-12 00:52:27,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 00:52:27,862 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-12 00:52:27,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:27,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1380442164, now seen corresponding path program 2 times [2023-11-12 00:52:27,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:27,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465815775] [2023-11-12 00:52:27,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:27,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-11-12 00:52:28,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:28,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465815775] [2023-11-12 00:52:28,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465815775] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:52:28,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2682106] [2023-11-12 00:52:28,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:52:28,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:28,262 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:52:28,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:52:28,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-12 00:52:28,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:52:28,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:52:28,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-11-12 00:52:28,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:52:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-12 00:52:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2682106] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:52:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [872579018] [2023-11-12 00:52:29,053 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-11-12 00:52:29,053 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:52:29,054 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:52:29,054 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:52:29,054 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:52:33,702 INFO L197 IcfgInterpreter]: Interpreting procedure ReadFromPort with input of size 1 for LOIs [2023-11-12 00:52:33,704 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:52:36,621 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4939#(and (<= 715827883 |ULTIMATE.start_main_~i~0#1|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= ~MAX~0 100000) (= |ULTIMATE.start_main_~DEFAULTVAL~0#1| 0) (<= 2 ~SIZE~0) (<= |ULTIMATE.start_main_~value~0#1| 2147483647) (= 10 |ULTIMATE.start_main_~FIXEDVAL~0#1|) (<= ~SIZE~0 99999) (not (= 0 |ULTIMATE.start_main_~value~0#1|)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_~value~0#1|)))' at error location [2023-11-12 00:52:36,621 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:52:36,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:52:36,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 10 [2023-11-12 00:52:36,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850273820] [2023-11-12 00:52:36,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:52:36,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 00:52:36,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:36,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 00:52:36,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=690, Unknown=7, NotChecked=0, Total=930 [2023-11-12 00:52:36,624 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 11 states, 10 states have (on average 9.7) internal successors, (97), 11 states have internal predecessors, (97), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-12 00:52:36,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:36,814 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2023-11-12 00:52:36,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:52:36,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.7) internal successors, (97), 11 states have internal predecessors, (97), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 112 [2023-11-12 00:52:36,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:36,816 INFO L225 Difference]: With dead ends: 134 [2023-11-12 00:52:36,816 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 00:52:36,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 301 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=308, Invalid=875, Unknown=7, NotChecked=0, Total=1190 [2023-11-12 00:52:36,820 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 203 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:36,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 20 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:52:36,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 00:52:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 00:52:36,822 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-12 00:52:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 00:52:36,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2023-11-12 00:52:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:36,823 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 00:52:36,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.7) internal successors, (97), 11 states have internal predecessors, (97), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-12 00:52:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 00:52:36,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 00:52:36,826 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2023-11-12 00:52:36,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2023-11-12 00:52:36,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2023-11-12 00:52:36,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2023-11-12 00:52:36,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2023-11-12 00:52:36,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2023-11-12 00:52:36,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2023-11-12 00:52:36,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2023-11-12 00:52:36,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2023-11-12 00:52:36,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2023-11-12 00:52:36,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2023-11-12 00:52:36,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2023-11-12 00:52:36,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2023-11-12 00:52:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2023-11-12 00:52:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2023-11-12 00:52:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2023-11-12 00:52:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2023-11-12 00:52:36,830 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2023-11-12 00:52:36,831 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2023-11-12 00:52:36,831 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2023-11-12 00:52:36,831 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2023-11-12 00:52:36,831 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2023-11-12 00:52:36,831 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2023-11-12 00:52:36,831 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2023-11-12 00:52:36,832 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2023-11-12 00:52:36,832 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2023-11-12 00:52:36,832 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2023-11-12 00:52:36,832 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2023-11-12 00:52:36,832 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2023-11-12 00:52:36,833 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2023-11-12 00:52:36,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:37,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-12 00:52:37,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 00:52:40,328 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 12 16) the Hoare annotation is: true [2023-11-12 00:52:40,329 INFO L899 garLoopResultBuilder]: For program point ReadFromPortEXIT(lines 12 16) no Hoare annotation was computed. [2023-11-12 00:52:40,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2023-11-12 00:52:40,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2023-11-12 00:52:40,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2023-11-12 00:52:40,329 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 22 75) no Hoare annotation was computed. [2023-11-12 00:52:40,329 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-11-12 00:52:40,329 INFO L899 garLoopResultBuilder]: For program point L36-1(line 36) no Hoare annotation was computed. [2023-11-12 00:52:40,329 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 36 67) no Hoare annotation was computed. [2023-11-12 00:52:40,329 INFO L899 garLoopResultBuilder]: For program point L69-3(line 69) no Hoare annotation was computed. [2023-11-12 00:52:40,330 INFO L899 garLoopResultBuilder]: For program point L69-4(line 69) no Hoare annotation was computed. [2023-11-12 00:52:40,330 INFO L899 garLoopResultBuilder]: For program point L36-4(lines 36 67) no Hoare annotation was computed. [2023-11-12 00:52:40,330 INFO L895 garLoopResultBuilder]: At program point L69-5(lines 69 72) the Hoare annotation is: (let ((.cse21 (select |#memory_int| 1)) (.cse22 (select |#memory_int| 2))) (let ((.cse0 (exists ((|v_#valid_7| (Array Int Int))) (and (= (select |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base|) 0) (= (select |v_#valid_7| 2) 1) (= (store |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base| 1) |#valid|) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= (select |v_#valid_7| 0) 0)))) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse3 (= 114 (select .cse22 2))) (.cse4 (= (select .cse22 5) 99)) (.cse5 (= ~MAX~0 100000)) (.cse6 (= |ULTIMATE.start_main_~DEFAULTVAL~0#1| 0)) (.cse7 (<= 2 ~SIZE~0)) (.cse8 (= 51 (select .cse22 3))) (.cse9 (not (= |ULTIMATE.start_main_~a~0#1.base| 0))) (.cse10 (= 10 |ULTIMATE.start_main_~FIXEDVAL~0#1|)) (.cse11 (= (select .cse22 4) 46)) (.cse12 (exists ((|v_#length_7| (Array Int Int))) (and (= |#length| (store |v_#length_7| |ULTIMATE.start_main_~a~0#1.base| (* 4 (mod ~SIZE~0 1073741824)))) (= 2 (select |v_#length_7| 1)) (= (select |v_#length_7| 2) 7) (= (select |v_#length_7| 3) 12)))) (.cse13 (= (select .cse22 6) 0)) (.cse14 (= 112 (select .cse22 0))) (.cse15 (<= ~SIZE~0 99999)) (.cse16 (= (select .cse21 0) 48)) (.cse17 (= 110 (select .cse22 1))) (.cse18 (= (select .cse21 1) 0)) (.cse19 (= ~SIZE~0 (* (div ~SIZE~0 3) 3))) (.cse20 (<= (+ |ULTIMATE.start_main_~a~0#1.base| 1) |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~i~0#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 (<= 1 |ULTIMATE.start_main_~i~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2023-11-12 00:52:40,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2023-11-12 00:52:40,330 INFO L899 garLoopResultBuilder]: For program point L36-5(line 36) no Hoare annotation was computed. [2023-11-12 00:52:40,330 INFO L899 garLoopResultBuilder]: For program point L36-6(line 36) no Hoare annotation was computed. [2023-11-12 00:52:40,330 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-11-12 00:52:40,331 INFO L895 garLoopResultBuilder]: At program point L36-7(lines 36 67) the Hoare annotation is: (let ((.cse21 (select |#memory_int| 1)) (.cse22 (select |#memory_int| 2))) (let ((.cse0 (exists ((|v_#valid_7| (Array Int Int))) (and (= (select |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base|) 0) (= (select |v_#valid_7| 2) 1) (= (store |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base| 1) |#valid|) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= (select |v_#valid_7| 0) 0)))) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse3 (= 114 (select .cse22 2))) (.cse4 (= (select .cse22 5) 99)) (.cse5 (= ~MAX~0 100000)) (.cse6 (= |ULTIMATE.start_main_~DEFAULTVAL~0#1| 0)) (.cse7 (<= 2 ~SIZE~0)) (.cse8 (= 51 (select .cse22 3))) (.cse9 (not (= |ULTIMATE.start_main_~a~0#1.base| 0))) (.cse10 (= 10 |ULTIMATE.start_main_~FIXEDVAL~0#1|)) (.cse11 (= (select .cse22 4) 46)) (.cse12 (exists ((|v_#length_7| (Array Int Int))) (and (= |#length| (store |v_#length_7| |ULTIMATE.start_main_~a~0#1.base| (* 4 (mod ~SIZE~0 1073741824)))) (= 2 (select |v_#length_7| 1)) (= (select |v_#length_7| 2) 7) (= (select |v_#length_7| 3) 12)))) (.cse13 (= (select .cse22 6) 0)) (.cse14 (= 112 (select .cse22 0))) (.cse15 (<= ~SIZE~0 99999)) (.cse16 (= (select .cse21 0) 48)) (.cse17 (= 110 (select .cse22 1))) (.cse18 (= (select .cse21 1) 0)) (.cse19 (= ~SIZE~0 (* (div ~SIZE~0 3) 3))) (.cse20 (<= (+ |ULTIMATE.start_main_~a~0#1.base| 1) |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~i~0#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2023-11-12 00:52:40,331 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2023-11-12 00:52:40,331 INFO L899 garLoopResultBuilder]: For program point L36-8(lines 36 67) no Hoare annotation was computed. [2023-11-12 00:52:40,331 INFO L899 garLoopResultBuilder]: For program point L61-2(line 61) no Hoare annotation was computed. [2023-11-12 00:52:40,331 INFO L899 garLoopResultBuilder]: For program point L61-3(line 61) no Hoare annotation was computed. [2023-11-12 00:52:40,331 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2023-11-12 00:52:40,331 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2023-11-12 00:52:40,331 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-11-12 00:52:40,331 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2023-11-12 00:52:40,331 INFO L899 garLoopResultBuilder]: For program point L45-2(line 45) no Hoare annotation was computed. [2023-11-12 00:52:40,332 INFO L899 garLoopResultBuilder]: For program point L45-3(line 45) no Hoare annotation was computed. [2023-11-12 00:52:40,332 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-11-12 00:52:40,332 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2023-11-12 00:52:40,332 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2023-11-12 00:52:40,332 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2023-11-12 00:52:40,332 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-11-12 00:52:40,332 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 00:52:40,333 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse21 (select |#memory_int| 1)) (.cse22 (select |#memory_int| 2))) (let ((.cse0 (exists ((|v_#valid_7| (Array Int Int))) (and (= (select |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base|) 0) (= (select |v_#valid_7| 2) 1) (= (store |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base| 1) |#valid|) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= (select |v_#valid_7| 0) 0)))) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse3 (= 114 (select .cse22 2))) (.cse4 (= (select .cse22 5) 99)) (.cse5 (= ~MAX~0 100000)) (.cse6 (= |ULTIMATE.start_main_~DEFAULTVAL~0#1| 0)) (.cse7 (<= 2 ~SIZE~0)) (.cse8 (= 51 (select .cse22 3))) (.cse9 (not (= |ULTIMATE.start_main_~a~0#1.base| 0))) (.cse10 (= 10 |ULTIMATE.start_main_~FIXEDVAL~0#1|)) (.cse11 (= (select .cse22 4) 46)) (.cse12 (exists ((|v_#length_7| (Array Int Int))) (and (= |#length| (store |v_#length_7| |ULTIMATE.start_main_~a~0#1.base| (* 4 (mod ~SIZE~0 1073741824)))) (= 2 (select |v_#length_7| 1)) (= (select |v_#length_7| 2) 7) (= (select |v_#length_7| 3) 12)))) (.cse13 (= (select .cse22 6) 0)) (.cse14 (= 112 (select .cse22 0))) (.cse15 (<= ~SIZE~0 99999)) (.cse16 (= (select .cse21 0) 48)) (.cse17 (= 110 (select .cse22 1))) (.cse18 (= (select .cse21 1) 0)) (.cse19 (= ~SIZE~0 (* (div ~SIZE~0 3) 3))) (.cse20 (<= (+ |ULTIMATE.start_main_~a~0#1.base| 1) |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~i~0#1| 33333) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~i~0#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2023-11-12 00:52:40,333 INFO L899 garLoopResultBuilder]: For program point L38-1(line 38) no Hoare annotation was computed. [2023-11-12 00:52:40,333 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2023-11-12 00:52:40,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2023-11-12 00:52:40,333 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2023-11-12 00:52:40,333 INFO L899 garLoopResultBuilder]: For program point L55-2(line 55) no Hoare annotation was computed. [2023-11-12 00:52:40,333 INFO L899 garLoopResultBuilder]: For program point L55-3(line 55) no Hoare annotation was computed. [2023-11-12 00:52:40,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2023-11-12 00:52:40,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2023-11-12 00:52:40,334 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2023-11-12 00:52:40,334 INFO L895 garLoopResultBuilder]: At program point L39-2(lines 39 46) the Hoare annotation is: (let ((.cse21 (select |#memory_int| 1)) (.cse22 (select |#memory_int| 2))) (let ((.cse0 (exists ((|v_#valid_7| (Array Int Int))) (and (= (select |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base|) 0) (= (select |v_#valid_7| 2) 1) (= (store |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base| 1) |#valid|) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= (select |v_#valid_7| 0) 0)))) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse3 (= 114 (select .cse22 2))) (.cse4 (= (select .cse22 5) 99)) (.cse5 (= ~MAX~0 100000)) (.cse6 (= |ULTIMATE.start_main_~DEFAULTVAL~0#1| 0)) (.cse7 (<= 2 ~SIZE~0)) (.cse8 (= 51 (select .cse22 3))) (.cse9 (not (= |ULTIMATE.start_main_~a~0#1.base| 0))) (.cse10 (= 10 |ULTIMATE.start_main_~FIXEDVAL~0#1|)) (.cse11 (= (select .cse22 4) 46)) (.cse12 (exists ((|v_#length_7| (Array Int Int))) (and (= |#length| (store |v_#length_7| |ULTIMATE.start_main_~a~0#1.base| (* 4 (mod ~SIZE~0 1073741824)))) (= 2 (select |v_#length_7| 1)) (= (select |v_#length_7| 2) 7) (= (select |v_#length_7| 3) 12)))) (.cse13 (= (select .cse22 6) 0)) (.cse14 (= 112 (select .cse22 0))) (.cse15 (<= ~SIZE~0 99999)) (.cse16 (= (select .cse21 0) 48)) (.cse17 (= 110 (select .cse22 1))) (.cse18 (= (select .cse21 1) 0)) (.cse19 (= ~SIZE~0 (* (div ~SIZE~0 3) 3))) (.cse20 (<= (+ |ULTIMATE.start_main_~a~0#1.base| 1) |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~i~0#1| 33333) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~i~0#1| 1) .cse9 (<= |ULTIMATE.start_main_~value~0#1| 2147483647) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ 2147483648 |ULTIMATE.start_main_~value~0#1|)) .cse16 .cse17 .cse18 .cse19 .cse20)))) [2023-11-12 00:52:40,334 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2023-11-12 00:52:40,334 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2023-11-12 00:52:40,334 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-11-12 00:52:40,334 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2023-11-12 00:52:40,335 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-12 00:52:40,335 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-11-12 00:52:40,335 INFO L899 garLoopResultBuilder]: For program point L65-2(line 65) no Hoare annotation was computed. [2023-11-12 00:52:40,335 INFO L899 garLoopResultBuilder]: For program point L65-3(line 65) no Hoare annotation was computed. [2023-11-12 00:52:40,335 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2023-11-12 00:52:40,335 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2023-11-12 00:52:40,335 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2023-11-12 00:52:40,336 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 56) no Hoare annotation was computed. [2023-11-12 00:52:40,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2023-11-12 00:52:40,336 INFO L895 garLoopResultBuilder]: At program point L49-2(lines 49 56) the Hoare annotation is: (let ((.cse21 (select |#memory_int| 1)) (.cse22 (select |#memory_int| 2))) (let ((.cse0 (exists ((|v_#valid_7| (Array Int Int))) (and (= (select |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base|) 0) (= (select |v_#valid_7| 2) 1) (= (store |v_#valid_7| |ULTIMATE.start_main_~a~0#1.base| 1) |#valid|) (= (select |v_#valid_7| 3) 1) (= (select |v_#valid_7| 1) 1) (= (select |v_#valid_7| 0) 0)))) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse3 (= 114 (select .cse22 2))) (.cse4 (= (select .cse22 5) 99)) (.cse5 (= ~MAX~0 100000)) (.cse6 (= |ULTIMATE.start_main_~DEFAULTVAL~0#1| 0)) (.cse7 (<= 2 ~SIZE~0)) (.cse8 (= 51 (select .cse22 3))) (.cse9 (not (= |ULTIMATE.start_main_~a~0#1.base| 0))) (.cse10 (= 10 |ULTIMATE.start_main_~FIXEDVAL~0#1|)) (.cse11 (= (select .cse22 4) 46)) (.cse12 (exists ((|v_#length_7| (Array Int Int))) (and (= |#length| (store |v_#length_7| |ULTIMATE.start_main_~a~0#1.base| (* 4 (mod ~SIZE~0 1073741824)))) (= 2 (select |v_#length_7| 1)) (= (select |v_#length_7| 2) 7) (= (select |v_#length_7| 3) 12)))) (.cse13 (= (select .cse22 6) 0)) (.cse14 (= 112 (select .cse22 0))) (.cse15 (<= ~SIZE~0 99999)) (.cse16 (= (select .cse21 0) 48)) (.cse17 (= 110 (select .cse22 1))) (.cse18 (= (select .cse21 1) 0)) (.cse19 (= ~SIZE~0 (* (div ~SIZE~0 3) 3))) (.cse20 (<= (+ |ULTIMATE.start_main_~a~0#1.base| 1) |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~i~0#1| 33333) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~i~0#1| 1) .cse9 (<= |ULTIMATE.start_main_~value~0#1| 2147483647) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ 2147483648 |ULTIMATE.start_main_~value~0#1|)) .cse16 .cse17 .cse18 .cse19 .cse20)))) [2023-11-12 00:52:40,337 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2023-11-12 00:52:40,337 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2023-11-12 00:52:40,337 INFO L899 garLoopResultBuilder]: For program point L41-2(line 41) no Hoare annotation was computed. [2023-11-12 00:52:40,337 INFO L899 garLoopResultBuilder]: For program point L41-3(line 41) no Hoare annotation was computed. [2023-11-12 00:52:40,337 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-11-12 00:52:40,337 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 00:52:40,337 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2023-11-12 00:52:40,337 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-11-12 00:52:40,338 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 73) no Hoare annotation was computed. [2023-11-12 00:52:40,338 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2023-11-12 00:52:40,338 INFO L899 garLoopResultBuilder]: For program point L25-2(lines 25 73) no Hoare annotation was computed. [2023-11-12 00:52:40,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2023-11-12 00:52:40,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2023-11-12 00:52:40,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2023-11-12 00:52:40,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 41) no Hoare annotation was computed. [2023-11-12 00:52:40,339 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 66) no Hoare annotation was computed. [2023-11-12 00:52:40,339 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2023-11-12 00:52:40,340 INFO L899 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2023-11-12 00:52:40,340 INFO L899 garLoopResultBuilder]: For program point L51-2(line 51) no Hoare annotation was computed. [2023-11-12 00:52:40,340 INFO L899 garLoopResultBuilder]: For program point L51-3(line 51) no Hoare annotation was computed. [2023-11-12 00:52:40,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2023-11-12 00:52:40,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-11-12 00:52:40,344 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:40,346 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:52:40,362 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,366 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,367 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,367 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,368 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,368 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,368 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,368 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,369 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,369 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,369 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,369 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,370 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,370 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,370 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,371 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,371 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,371 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,371 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,372 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,372 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,372 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,374 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,374 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,375 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,375 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,375 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,376 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,376 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,376 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,376 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,377 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,377 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,377 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,377 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,378 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,378 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,378 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,379 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,379 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,379 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,379 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,379 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,380 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,382 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,382 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,382 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,383 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,383 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,384 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,384 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,384 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,384 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,385 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,385 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,385 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,385 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,386 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,386 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,386 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,387 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,387 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,387 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,387 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,388 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,388 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,389 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,389 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,390 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,390 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,390 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,391 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,391 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,391 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,391 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,391 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,392 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,405 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,405 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,405 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,405 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,406 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,406 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,406 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,406 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,407 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,407 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,407 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:52:40 BoogieIcfgContainer [2023-11-12 00:52:40,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:52:40,408 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:52:40,408 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:52:40,409 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:52:40,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:58" (3/4) ... [2023-11-12 00:52:40,412 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 00:52:40,415 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ReadFromPort [2023-11-12 00:52:40,422 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2023-11-12 00:52:40,423 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-12 00:52:40,424 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-12 00:52:40,424 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 00:52:40,424 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 00:52:40,533 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/witness.graphml [2023-11-12 00:52:40,533 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/witness.yml [2023-11-12 00:52:40,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:52:40,534 INFO L158 Benchmark]: Toolchain (without parser) took 43330.37ms. Allocated memory was 188.7MB in the beginning and 597.7MB in the end (delta: 408.9MB). Free memory was 142.9MB in the beginning and 556.7MB in the end (delta: -413.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:52:40,535 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 130.0MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:52:40,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.30ms. Allocated memory is still 188.7MB. Free memory was 142.9MB in the beginning and 131.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-12 00:52:40,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.52ms. Allocated memory is still 188.7MB. Free memory was 131.7MB in the beginning and 129.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:52:40,536 INFO L158 Benchmark]: Boogie Preprocessor took 32.17ms. Allocated memory is still 188.7MB. Free memory was 129.6MB in the beginning and 128.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:52:40,537 INFO L158 Benchmark]: RCFGBuilder took 518.34ms. Allocated memory is still 188.7MB. Free memory was 128.2MB in the beginning and 109.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-12 00:52:40,537 INFO L158 Benchmark]: TraceAbstraction took 42314.98ms. Allocated memory was 188.7MB in the beginning and 597.7MB in the end (delta: 408.9MB). Free memory was 108.7MB in the beginning and 563.1MB in the end (delta: -454.5MB). Peak memory consumption was 315.6MB. Max. memory is 16.1GB. [2023-11-12 00:52:40,538 INFO L158 Benchmark]: Witness Printer took 125.56ms. Allocated memory is still 597.7MB. Free memory was 562.1MB in the beginning and 556.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 00:52:40,540 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.31ms. Allocated memory is still 130.0MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.30ms. Allocated memory is still 188.7MB. Free memory was 142.9MB in the beginning and 131.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.52ms. Allocated memory is still 188.7MB. Free memory was 131.7MB in the beginning and 129.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.17ms. Allocated memory is still 188.7MB. Free memory was 129.6MB in the beginning and 128.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 518.34ms. Allocated memory is still 188.7MB. Free memory was 128.2MB in the beginning and 109.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 42314.98ms. Allocated memory was 188.7MB in the beginning and 597.7MB in the end (delta: 408.9MB). Free memory was 108.7MB in the beginning and 563.1MB in the end (delta: -454.5MB). Peak memory consumption was 315.6MB. Max. memory is 16.1GB. * Witness Printer took 125.56ms. Allocated memory is still 597.7MB. Free memory was 562.1MB in the beginning and 556.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] 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: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: 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 2 procedures, 81 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 42.2s, OverallIterations: 12, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 1216 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1198 mSDsluCounter, 1117 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 589 mSDsCounter, 200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2305 IncrementalHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 200 mSolverCounterUnsat, 528 mSDtfsCounter, 2305 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 781 GetRequests, 603 SyntacticMatches, 24 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2037 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=10, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 248 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 15 PreInvPairs, 27 NumberOfFragments, 1671 HoareAnnotationTreeSize, 15 FomulaSimplifications, 1776 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 6 FomulaSimplificationsInter, 5272 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 767 NumberOfCodeBlocks, 668 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 951 ConstructedInterpolants, 0 QuantifiedInterpolants, 3438 SizeOfPredicates, 8 NumberOfNonLiveVariables, 707 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 780/894 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: OVERALL_TIME: 4.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 49, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 117, TOOLS_POST_TIME: 2.8s, TOOLS_POST_CALL_APPLICATIONS: 27, TOOLS_POST_CALL_TIME: 0.6s, TOOLS_POST_RETURN_APPLICATIONS: 24, TOOLS_POST_RETURN_TIME: 0.6s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 168, TOOLS_QUANTIFIERELIM_TIME: 4.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 202, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 20, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 4, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 6, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 49, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 4.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 4.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 6, CALL_SUMMARIZER_APPLICATIONS: 24, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 1060, DAG_COMPRESSION_RETAINED_NODES: 127, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 69]: Loop Invariant [2023-11-12 00:52:40,564 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,565 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,565 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,566 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,566 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,566 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,566 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,566 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,567 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,567 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,567 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,567 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,568 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,568 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,568 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,569 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,569 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,569 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,569 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,569 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,569 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,570 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,571 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,571 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,572 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,572 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,572 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,572 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,573 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,573 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,573 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,573 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,573 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,574 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,574 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,574 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,575 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,575 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,575 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,575 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,575 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,576 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,576 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,576 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated Derived loop invariant: ((((((((i == 0) && (MAX == 100000)) && (DEFAULTVAL == 0)) && (2 <= SIZE)) && (10 == FIXEDVAL)) && (SIZE <= 99999)) && (SIZE == ((SIZE / 3) * 3))) || (((((((1 <= i) && (MAX == 100000)) && (DEFAULTVAL == 0)) && (2 <= SIZE)) && (10 == FIXEDVAL)) && (SIZE <= 99999)) && (SIZE == ((SIZE / 3) * 3)))) - InvariantResult [Line: 36]: Loop Invariant [2023-11-12 00:52:40,577 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,578 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,578 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,578 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,579 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,579 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,579 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,579 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,580 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,580 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,580 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,580 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,581 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,581 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,581 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,581 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,582 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,582 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,582 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,582 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,583 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,583 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,584 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,584 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,584 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,585 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,585 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,585 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,586 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,586 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,586 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,586 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,586 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-11-12 00:52:40,587 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#valid_7 : [int]int :: ((((v_#valid_7[~a~0!base] == 0 && v_#valid_7[2] == 1) && v_#valid_7[~a~0!base := 1] == #valid) && v_#valid_7[3] == 1) && v_#valid_7[1] == 1) && v_#valid_7[0] == 0) could not be translated [2023-11-12 00:52:40,587 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][2] could not be translated [2023-11-12 00:52:40,587 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][5] could not be translated [2023-11-12 00:52:40,587 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][3] could not be translated [2023-11-12 00:52:40,588 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][4] could not be translated [2023-11-12 00:52:40,588 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#length_7 : [int]int :: ((#length == v_#length_7[~a~0!base := 4 * (~SIZE~0 % 1073741824)] && 2 == v_#length_7[1]) && v_#length_7[2] == 7) && v_#length_7[3] == 12) could not be translated [2023-11-12 00:52:40,588 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][6] could not be translated [2023-11-12 00:52:40,588 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][0] could not be translated [2023-11-12 00:52:40,589 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-11-12 00:52:40,589 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[2][1] could not be translated [2023-11-12 00:52:40,589 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated Derived loop invariant: ((((((((MAX == 100000) && (DEFAULTVAL == 0)) && (2 <= SIZE)) && (i == 1)) && (10 == FIXEDVAL)) && (SIZE <= 99999)) && (SIZE == ((SIZE / 3) * 3))) || (((((((MAX == 100000) && (DEFAULTVAL == 0)) && (2 <= SIZE)) && (10 == FIXEDVAL)) && (2 <= i)) && (SIZE <= 99999)) && (SIZE == ((SIZE / 3) * 3)))) RESULT: Ultimate proved your program to be correct! [2023-11-12 00:52:40,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29c6277b-b82d-4506-8a88-748092670821/bin/utaipan-verify-NcY6lQBIFX/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