./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/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_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/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 64bit --witnessprinter.graph.data.programhash 93cff60adb183fef3af5f3af7541e684acb33c49f5e09dc255d0e19d271c8517 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:47:32,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:47:32,592 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-64bit-Taipan_Default.epf [2023-11-12 00:47:32,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:47:32,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:47:32,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:47:32,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:47:32,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:47:32,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:47:32,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:47:32,659 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:47:32,660 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:47:32,660 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:47:32,662 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:47:32,662 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:47:32,663 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:47:32,663 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:47:32,664 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:47:32,664 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:47:32,665 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:47:32,665 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:47:32,666 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:47:32,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:47:32,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:47:32,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:47:32,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:47:32,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:47:32,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:47:32,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:47:32,670 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 00:47:32,671 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:47:32,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:47:32,671 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:47:32,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:47:32,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:47:32,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:47:32,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:47:32,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:47:32,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:47:32,673 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:47:32,674 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:47:32,674 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:47:32,674 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:47:32,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:47:32,675 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_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/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_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93cff60adb183fef3af5f3af7541e684acb33c49f5e09dc255d0e19d271c8517 [2023-11-12 00:47:33,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:47:33,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:47:33,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:47:33,057 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:47:33,057 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:47:33,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i [2023-11-12 00:47:36,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:47:36,746 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:47:36,747 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i [2023-11-12 00:47:36,765 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/data/0b0d26e44/1b493584537f4eff9ef4a5aef8e6082f/FLAG7b1efb440 [2023-11-12 00:47:37,070 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/data/0b0d26e44/1b493584537f4eff9ef4a5aef8e6082f [2023-11-12 00:47:37,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:47:37,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:47:37,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:47:37,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:47:37,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:47:37,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:47:37" (1/1) ... [2023-11-12 00:47:37,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6873b64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:37, skipping insertion in model container [2023-11-12 00:47:37,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:47:37" (1/1) ... [2023-11-12 00:47:37,144 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:47:37,470 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:47:37,482 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:47:37,555 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:47:37,592 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:47:37,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:37 WrapperNode [2023-11-12 00:47:37,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:47:37,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:47:37,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:47:37,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:47:37,602 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:47:37" (1/1) ... [2023-11-12 00:47:37,623 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:47:37" (1/1) ... [2023-11-12 00:47:37,647 INFO L138 Inliner]: procedures = 111, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2023-11-12 00:47:37,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:47:37,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:47:37,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:47:37,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:47:37,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:37" (1/1) ... [2023-11-12 00:47:37,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:37" (1/1) ... [2023-11-12 00:47:37,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:37" (1/1) ... [2023-11-12 00:47:37,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:37" (1/1) ... [2023-11-12 00:47:37,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:37" (1/1) ... [2023-11-12 00:47:37,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:37" (1/1) ... [2023-11-12 00:47:37,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:37" (1/1) ... [2023-11-12 00:47:37,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:37" (1/1) ... [2023-11-12 00:47:37,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:47:37,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:47:37,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:47:37,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:47:37,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:37" (1/1) ... [2023-11-12 00:47:37,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:47:37,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:47:37,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/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:47:37,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/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:47:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:47:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:47:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:47:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:47:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:47:37,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:47:37,954 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:47:37,957 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:47:38,263 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:47:38,295 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:47:38,295 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 00:47:38,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:47:38 BoogieIcfgContainer [2023-11-12 00:47:38,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:47:38,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:47:38,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:47:38,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:47:38,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:47:37" (1/3) ... [2023-11-12 00:47:38,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5a6881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:47:38, skipping insertion in model container [2023-11-12 00:47:38,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:37" (2/3) ... [2023-11-12 00:47:38,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5a6881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:47:38, skipping insertion in model container [2023-11-12 00:47:38,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:47:38" (3/3) ... [2023-11-12 00:47:38,309 INFO L112 eAbstractionObserver]: Analyzing ICFG b.17-alloca.i [2023-11-12 00:47:38,329 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:47:38,329 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-12 00:47:38,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:47:38,382 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;@62aadcce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:47:38,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-12 00:47:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:47:38,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:38,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:47:38,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-12 00:47:38,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2112312639, now seen corresponding path program 1 times [2023-11-12 00:47:38,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:38,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668028265] [2023-11-12 00:47:38,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:38,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:39,175 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:47:39,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:39,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668028265] [2023-11-12 00:47:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668028265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:47:39,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:47:39,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:47:39,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226739079] [2023-11-12 00:47:39,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:47:39,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:47:39,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:39,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:47:39,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:47:39,223 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:39,363 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2023-11-12 00:47:39,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:47:39,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:47:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:39,378 INFO L225 Difference]: With dead ends: 44 [2023-11-12 00:47:39,378 INFO L226 Difference]: Without dead ends: 26 [2023-11-12 00:47:39,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:47:39,390 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:39,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:47:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-12 00:47:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2023-11-12 00:47:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.4375) internal successors, (23), 19 states have internal predecessors, (23), 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:47:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-11-12 00:47:39,444 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 6 [2023-11-12 00:47:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:39,444 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-11-12 00:47:39,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-11-12 00:47:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:47:39,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:39,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:39,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:47:39,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-12 00:47:39,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1057184043, now seen corresponding path program 1 times [2023-11-12 00:47:39,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:39,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190339515] [2023-11-12 00:47:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:39,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:39,864 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:47:39,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:39,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190339515] [2023-11-12 00:47:39,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190339515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:47:39,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:47:39,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:47:39,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554745139] [2023-11-12 00:47:39,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:47:39,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:47:39,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:39,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:47:39,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:47:39,873 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:40,013 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2023-11-12 00:47:40,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:47:40,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 00:47:40,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:40,015 INFO L225 Difference]: With dead ends: 37 [2023-11-12 00:47:40,015 INFO L226 Difference]: Without dead ends: 36 [2023-11-12 00:47:40,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:47:40,018 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:40,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 28 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:47:40,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-12 00:47:40,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2023-11-12 00:47:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.4) internal successors, (35), 28 states have internal predecessors, (35), 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:47:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-12 00:47:40,027 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2023-11-12 00:47:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:40,027 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-12 00:47:40,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-11-12 00:47:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:47:40,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:40,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:40,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:47:40,029 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-12 00:47:40,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:40,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1057182313, now seen corresponding path program 1 times [2023-11-12 00:47:40,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:40,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199112986] [2023-11-12 00:47:40,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:40,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:40,389 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:47:40,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:40,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199112986] [2023-11-12 00:47:40,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199112986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:47:40,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:47:40,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:47:40,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569192007] [2023-11-12 00:47:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:47:40,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:47:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:40,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:47:40,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:47:40,395 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:40,458 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2023-11-12 00:47:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:47:40,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 00:47:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:40,460 INFO L225 Difference]: With dead ends: 29 [2023-11-12 00:47:40,460 INFO L226 Difference]: Without dead ends: 28 [2023-11-12 00:47:40,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:47:40,468 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:40,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 12 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:47:40,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-12 00:47:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-12 00:47:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.32) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-11-12 00:47:40,488 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 7 [2023-11-12 00:47:40,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:40,490 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-11-12 00:47:40,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-11-12 00:47:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:47:40,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:40,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:40,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:47:40,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-12 00:47:40,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1587033099, now seen corresponding path program 1 times [2023-11-12 00:47:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:40,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102252510] [2023-11-12 00:47:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:41,063 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:47:41,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:41,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102252510] [2023-11-12 00:47:41,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102252510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:47:41,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:47:41,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:47:41,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577612418] [2023-11-12 00:47:41,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:47:41,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:47:41,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:41,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:47:41,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:47:41,068 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:41,165 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-11-12 00:47:41,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:47:41,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-12 00:47:41,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:41,167 INFO L225 Difference]: With dead ends: 28 [2023-11-12 00:47:41,167 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 00:47:41,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:47:41,177 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 27 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:41,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 9 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:47:41,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 00:47:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-12 00:47:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 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:47:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-12 00:47:41,189 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 8 [2023-11-12 00:47:41,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:41,190 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-12 00:47:41,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-12 00:47:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:47:41,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:41,191 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:41,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:47:41,192 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-12 00:47:41,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:41,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1900292796, now seen corresponding path program 1 times [2023-11-12 00:47:41,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:41,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825599550] [2023-11-12 00:47:41,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:41,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:41,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:41,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825599550] [2023-11-12 00:47:41,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825599550] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:47:41,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961624350] [2023-11-12 00:47:41,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:41,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:47:41,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:47:41,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:47:41,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:47:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:41,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-12 00:47:41,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:47:41,781 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-12 00:47:41,782 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-12 00:47:42,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2023-11-12 00:47:42,283 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2023-11-12 00:47:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:42,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:47:42,746 INFO L322 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-12 00:47:42,746 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 55 [2023-11-12 00:47:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:42,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961624350] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:47:42,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1255014918] [2023-11-12 00:47:42,860 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-12 00:47:42,860 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:47:42,864 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:47:42,870 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:47:42,870 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:47:48,435 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:47:52,769 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '439#(and (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_#t~nondet13#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (= |ULTIMATE.start_test_fun_#t~malloc5#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet13#1|)) (<= |ULTIMATE.start_main_#t~nondet14#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet15#1|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= 2 |ULTIMATE.start_test_fun_#t~malloc5#1.base|) (exists ((|v_ULTIMATE.start_test_fun_#t~mem9#1_21| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_21| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) 2147483647) (<= |v_ULTIMATE.start_test_fun_#t~mem8#1_21| |v_ULTIMATE.start_test_fun_#t~mem9#1_21|) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) 2147483648)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem9#1_21|) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem8#1_21|) (exists ((|v_#memory_int_27| (Array Int (Array Int Int)))) (= (store |v_#memory_int_27| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |v_#memory_int_27| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0))) |#memory_int|)))) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~z#1|)) (<= |ULTIMATE.start_test_fun_#in~z#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 (+ |ULTIMATE.start_test_fun_~z#1| 2147483648)) (<= 2 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 2 |ULTIMATE.start_test_fun_~z_ref~0#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 2 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 2 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (<= |ULTIMATE.start_test_fun_~z#1| 2147483647) (<= (+ |ULTIMATE.start_test_fun_#t~mem11#1| 2147483648) 0) (<= |ULTIMATE.start_main_#t~nondet15#1| 2147483647))' at error location [2023-11-12 00:47:52,770 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:47:52,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:47:52,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-11-12 00:47:52,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943294458] [2023-11-12 00:47:52,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:47:52,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-12 00:47:52,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:52,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-12 00:47:52,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2023-11-12 00:47:52,772 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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:47:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:53,342 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-11-12 00:47:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 00:47:53,343 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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 11 [2023-11-12 00:47:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:53,344 INFO L225 Difference]: With dead ends: 38 [2023-11-12 00:47:53,344 INFO L226 Difference]: Without dead ends: 37 [2023-11-12 00:47:53,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2023-11-12 00:47:53,346 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:53,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 61 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:47:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-12 00:47:53,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2023-11-12 00:47:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 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:47:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-11-12 00:47:53,352 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 11 [2023-11-12 00:47:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:53,353 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-12 00:47:53,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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:47:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-11-12 00:47:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:47:53,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:53,354 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:53,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:47:53,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:47:53,560 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-12 00:47:53,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash -783626495, now seen corresponding path program 1 times [2023-11-12 00:47:53,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:53,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025750741] [2023-11-12 00:47:53,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:53,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:53,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:53,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025750741] [2023-11-12 00:47:53,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025750741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:47:53,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967057023] [2023-11-12 00:47:53,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:53,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:47:53,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:47:53,929 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:47:53,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:47:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:54,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-12 00:47:54,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:47:54,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2023-11-12 00:47:54,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-12 00:47:54,100 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:47:54,102 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2023-11-12 00:47:54,110 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:47:54,112 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2023-11-12 00:47:54,117 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-12 00:47:54,139 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-12 00:47:54,152 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2023-11-12 00:47:54,171 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-12 00:47:54,179 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-12 00:47:54,210 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-12 00:47:54,225 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2023-11-12 00:47:54,238 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-12 00:47:54,246 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-12 00:47:54,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:47:54,281 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2023-11-12 00:47:54,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 84 [2023-11-12 00:47:54,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:47:54,312 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:47:54,316 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2023-11-12 00:47:54,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:47:54,334 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:47:54,352 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 29 [2023-11-12 00:47:54,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-12 00:47:54,386 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 174 [2023-11-12 00:47:54,402 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-12 00:47:54,408 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-12 00:47:54,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:47:54,421 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-12 00:47:54,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 84 [2023-11-12 00:47:54,464 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-12 00:47:54,511 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 174 [2023-11-12 00:47:54,531 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-12 00:47:54,542 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2023-11-12 00:47:54,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2023-11-12 00:47:54,567 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-12 00:47:54,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:47:54,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-12 00:47:54,607 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 84 [2023-11-12 00:47:54,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:47:54,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2023-11-12 00:47:54,652 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2023-11-12 00:47:54,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2023-11-12 00:47:54,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:47:54,723 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2023-11-12 00:47:54,731 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:47:54,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:47:54,759 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2023-11-12 00:47:54,772 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 00:47:54,780 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 174 [2023-11-12 00:47:54,795 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-12 00:47:54,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:47:54,812 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-12 00:47:54,827 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 84 [2023-11-12 00:47:54,846 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-12 00:47:56,006 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:47:56,007 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 433 treesize of output 376 [2023-11-12 00:47:56,030 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-11-12 00:47:56,050 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-12 00:47:56,059 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-12 00:47:56,175 INFO L322 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-12 00:47:56,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 23 [2023-11-12 00:47:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:56,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:47:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967057023] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:47:56,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [486239398] [2023-11-12 00:47:56,493 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-12 00:47:56,494 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:47:56,494 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:47:56,494 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:47:56,494 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:48:02,090 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:48:06,699 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '636#(and (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |ULTIMATE.start_test_fun_#t~mem10#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_#t~nondet13#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (= |ULTIMATE.start_test_fun_#t~malloc5#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet13#1|)) (<= |ULTIMATE.start_main_#t~nondet14#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet15#1|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= 2 |ULTIMATE.start_test_fun_#t~malloc5#1.base|) (exists ((|v_ULTIMATE.start_test_fun_#t~mem8#1_28| Int) (|v_ULTIMATE.start_test_fun_#t~mem9#1_28| Int)) (and (<= (+ |v_ULTIMATE.start_test_fun_#t~mem9#1_28| 1) |v_ULTIMATE.start_test_fun_#t~mem8#1_28|) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem9#1_28|) (exists ((|v_ULTIMATE.start_test_fun_#t~mem7#1_24| Int) (|v_ULTIMATE.start_test_fun_#t~mem6#1_24| Int)) (and (<= 0 (+ 2147483648 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0))) (= |v_ULTIMATE.start_test_fun_#t~mem6#1_24| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 2147483647) (<= (+ |v_ULTIMATE.start_test_fun_#t~mem7#1_24| 1) |v_ULTIMATE.start_test_fun_#t~mem6#1_24|) (exists ((|v_#memory_int_33| (Array Int (Array Int Int)))) (= (store |v_#memory_int_33| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |v_#memory_int_33| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0))) |#memory_int|)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem7#1_24|))) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem8#1_28|))) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~z#1|)) (<= |ULTIMATE.start_test_fun_#in~z#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 (+ |ULTIMATE.start_test_fun_~z#1| 2147483648)) (<= 2 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 2 |ULTIMATE.start_test_fun_~z_ref~0#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 2 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 2 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (<= |ULTIMATE.start_test_fun_~z#1| 2147483647) (<= (+ |ULTIMATE.start_test_fun_#t~mem10#1| 2147483648) 0) (<= |ULTIMATE.start_main_#t~nondet15#1| 2147483647))' at error location [2023-11-12 00:48:06,699 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:48:06,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:48:06,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2023-11-12 00:48:06,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378597375] [2023-11-12 00:48:06,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:48:06,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-12 00:48:06,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:06,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-12 00:48:06,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=632, Unknown=8, NotChecked=0, Total=756 [2023-11-12 00:48:06,702 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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:48:06,749 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse9 (not .cse0))) (and (let ((.cse3 (select .cse4 0)) (.cse8 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (let ((.cse11 (not .cse8)) (.cse5 (<= 0 (+ .cse3 2147483648)))) (let ((.cse1 (and .cse11 .cse5)) (.cse7 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (and .cse0 (or .cse1 (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (|ULTIMATE.start_test_fun_#t~malloc5#1.base| Int) (|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_test_fun_#t~malloc5#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_12))) (and (= (store (select (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) 0 .cse3) .cse4) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select .cse2 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) v_DerPreprocessor_10)))) .cse5))) (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (|ULTIMATE.start_test_fun_#t~malloc5#1.base| Int) (v_DerPreprocessor_19 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_18) |ULTIMATE.start_test_fun_#t~malloc5#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_20))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= (select .cse6 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) v_DerPreprocessor_18) (= (store (select (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) 0 .cse3) .cse4)))) .cse7 .cse8 .cse5) (and (not .cse7) .cse9 (or (and (exists ((|ULTIMATE.start_test_fun_#t~malloc5#1.base| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse10 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_15) |ULTIMATE.start_test_fun_#t~malloc5#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse4 (store .cse10 0 .cse3)) (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_15 .cse10)))) .cse5) .cse1)) (and (or (and .cse11 (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (= .cse4 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) 0 .cse3))) .cse5) (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (= .cse12 v_DerPreprocessor_2) (= (store .cse12 0 .cse3) .cse4)))) .cse8 .cse5) (and .cse7 .cse5)) .cse9))))) (<= 0 (+ (select .cse4 |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483648)) (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) .cse9 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from true [2023-11-12 00:48:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:07,489 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2023-11-12 00:48:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:48:07,489 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-12 00:48:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:07,490 INFO L225 Difference]: With dead ends: 36 [2023-11-12 00:48:07,490 INFO L226 Difference]: Without dead ends: 35 [2023-11-12 00:48:07,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=214, Invalid=969, Unknown=11, NotChecked=66, Total=1260 [2023-11-12 00:48:07,492 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 29 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:48:07,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 14 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 81 Invalid, 8 Unknown, 12 Unchecked, 0.3s Time] [2023-11-12 00:48:07,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-12 00:48:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2023-11-12 00:48:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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:48:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-12 00:48:07,498 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 13 [2023-11-12 00:48:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:07,499 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-12 00:48:07,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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:48:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-12 00:48:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:48:07,500 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:07,500 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:48:07,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:48:07,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 00:48:07,706 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-12 00:48:07,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash 269329614, now seen corresponding path program 1 times [2023-11-12 00:48:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:07,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312881530] [2023-11-12 00:48:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:07,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:48:08,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:08,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312881530] [2023-11-12 00:48:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312881530] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:48:08,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017794597] [2023-11-12 00:48:08,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:08,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:48:08,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:48:08,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:48:08,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4405eeb9-96f1-4c4f-b38f-49fd742d8d23/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:48:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:08,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-12 00:48:08,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:48:08,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-12 00:48:08,267 INFO L322 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-12 00:48:08,268 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2023-11-12 00:48:08,561 INFO L322 Elim1Store]: treesize reduction 7, result has 78.8 percent of original size [2023-11-12 00:48:08,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 42 [2023-11-12 00:48:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:48:08,595 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:48:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:48:08,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017794597] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:48:08,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2095606748] [2023-11-12 00:48:08,900 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-11-12 00:48:08,901 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:48:08,901 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:48:08,901 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:48:08,901 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:48:20,776 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:48:30,528 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '858#(and (or (exists ((|v_ULTIMATE.start_test_fun_#t~mem9#1_35| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_35| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) 2147483647) (exists ((|v_#memory_int_40| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_40| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0))))) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem9#1_35|) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem8#1_35|) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) 2147483648)) (<= |v_ULTIMATE.start_test_fun_#t~mem8#1_35| |v_ULTIMATE.start_test_fun_#t~mem9#1_35|))) (exists ((|v_ULTIMATE.start_test_fun_#t~mem9#1_42| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_42| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) 2147483647) (<= |v_ULTIMATE.start_test_fun_#t~mem8#1_42| |v_ULTIMATE.start_test_fun_#t~mem9#1_42|) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem9#1_42|) (exists ((|v_#memory_int_47| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_47| |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select |v_#memory_int_47| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0))))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) 2147483648)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem8#1_42|)))) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_#t~nondet13#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (= |ULTIMATE.start_test_fun_#t~malloc5#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~mem11#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet13#1|)) (<= |ULTIMATE.start_main_#t~nondet14#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet15#1|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= 2 |ULTIMATE.start_test_fun_#t~malloc5#1.base|) (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~z#1|)) (<= |ULTIMATE.start_test_fun_#in~z#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 (+ |ULTIMATE.start_test_fun_~z#1| 2147483648)) (<= 2 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 2 |ULTIMATE.start_test_fun_~z_ref~0#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 2 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 2 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (<= |ULTIMATE.start_test_fun_~z#1| 2147483647) (<= (+ |ULTIMATE.start_test_fun_#t~mem11#1| 2147483648) 0) (<= |ULTIMATE.start_main_#t~nondet15#1| 2147483647))' at error location [2023-11-12 00:48:30,529 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:48:30,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:48:30,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2023-11-12 00:48:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059342636] [2023-11-12 00:48:30,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:48:30,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-12 00:48:30,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:30,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-12 00:48:30,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=939, Unknown=8, NotChecked=0, Total=1122 [2023-11-12 00:48:30,532 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 24 states have internal predecessors, (51), 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)