./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:03:17,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:03:17,549 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-14 05:03:17,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:03:17,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:03:17,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:03:17,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:03:17,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:03:17,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:03:17,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:03:17,610 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:03:17,610 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:03:17,611 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:03:17,611 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:03:17,611 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:03:17,611 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:03:17,611 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:03:17,611 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:03:17,612 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:03:17,612 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:03:17,612 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:03:17,612 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:03:17,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:03:17,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:03:17,613 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:03:17,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:03:17,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:03:17,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:03:17,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:03:17,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:03:17,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:03:17,615 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:03:17,615 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-14 05:03:17,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:03:17,615 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:03:17,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:03:17,615 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:03:17,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:03:17,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:03:17,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:03:17,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:03:17,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:03:17,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:03:17,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:03:17,617 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:03:17,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:03:17,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:03:17,617 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:03:17,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:03:17,617 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2024-11-14 05:03:18,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:03:18,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:03:18,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:03:18,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:03:18,030 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:03:18,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i Unable to find full path for "g++" [2024-11-14 05:03:20,180 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:03:20,645 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:03:20,648 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-11-14 05:03:20,676 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/data/4fd5f8d6b/be433de819ef48dd9d39a4fb4935bfca/FLAG97dc79a5d [2024-11-14 05:03:20,705 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/data/4fd5f8d6b/be433de819ef48dd9d39a4fb4935bfca [2024-11-14 05:03:20,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:03:20,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:03:20,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:03:20,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:03:20,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:03:20,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:03:20" (1/1) ... [2024-11-14 05:03:20,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72154e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:20, skipping insertion in model container [2024-11-14 05:03:20,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:03:20" (1/1) ... [2024-11-14 05:03:20,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:03:21,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:03:21,709 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:03:21,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:03:21,946 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:03:21,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:21 WrapperNode [2024-11-14 05:03:21,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:03:21,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:03:21,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:03:21,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:03:21,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:21" (1/1) ... [2024-11-14 05:03:21,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:21" (1/1) ... [2024-11-14 05:03:22,115 INFO L138 Inliner]: procedures = 177, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2306 [2024-11-14 05:03:22,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:03:22,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:03:22,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:03:22,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:03:22,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:21" (1/1) ... [2024-11-14 05:03:22,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:21" (1/1) ... [2024-11-14 05:03:22,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:21" (1/1) ... [2024-11-14 05:03:22,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:21" (1/1) ... [2024-11-14 05:03:22,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:21" (1/1) ... [2024-11-14 05:03:22,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:21" (1/1) ... [2024-11-14 05:03:22,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:21" (1/1) ... [2024-11-14 05:03:22,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:21" (1/1) ... [2024-11-14 05:03:22,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:03:22,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:03:22,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:03:22,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:03:22,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:21" (1/1) ... [2024-11-14 05:03:22,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:03:22,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:03:22,326 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:03:22,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:03:22,409 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 05:03:22,413 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 05:03:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:03:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 05:03:22,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 05:03:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:03:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 05:03:22,414 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 05:03:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:03:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:03:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:03:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:03:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:03:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:03:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:03:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:03:22,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:03:22,846 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:03:22,848 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:03:26,021 INFO L? ?]: Removed 528 outVars from TransFormulas that were not future-live. [2024-11-14 05:03:26,022 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:03:29,319 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:03:29,320 INFO L316 CfgBuilder]: Removed 100 assume(true) statements. [2024-11-14 05:03:29,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:03:29 BoogieIcfgContainer [2024-11-14 05:03:29,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:03:29,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:03:29,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:03:29,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:03:29,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:03:20" (1/3) ... [2024-11-14 05:03:29,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6d61cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:03:29, skipping insertion in model container [2024-11-14 05:03:29,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:03:21" (2/3) ... [2024-11-14 05:03:29,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6d61cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:03:29, skipping insertion in model container [2024-11-14 05:03:29,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:03:29" (3/3) ... [2024-11-14 05:03:29,334 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-3.i [2024-11-14 05:03:29,354 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:03:29,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test5-3.i that has 4 procedures, 209 locations, 1 initial locations, 56 loop locations, and 10 error locations. [2024-11-14 05:03:29,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:03:29,468 INFO L333 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, 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;@76889626, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:03:29,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-14 05:03:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 182 states have (on average 1.7637362637362637) internal successors, (321), 199 states have internal predecessors, (321), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-14 05:03:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 05:03:29,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:03:29,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 05:03:29,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-14 05:03:29,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:03:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2422559, now seen corresponding path program 1 times [2024-11-14 05:03:29,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:03:29,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443063518] [2024-11-14 05:03:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:03:29,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:03:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:03:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:03:29,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:03:29,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443063518] [2024-11-14 05:03:29,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443063518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:03:29,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:03:29,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 05:03:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139664554] [2024-11-14 05:03:29,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:03:29,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 05:03:29,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:03:29,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 05:03:29,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:03:29,792 INFO L87 Difference]: Start difference. First operand has 209 states, 182 states have (on average 1.7637362637362637) internal successors, (321), 199 states have internal predecessors, (321), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-11-14 05:03:31,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:03:33,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:03:35,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:03:37,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:03:40,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:03:42,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:03:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:03:43,012 INFO L93 Difference]: Finished difference Result 414 states and 698 transitions. [2024-11-14 05:03:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 05:03:43,020 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-11-14 05:03:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:03:43,031 INFO L225 Difference]: With dead ends: 414 [2024-11-14 05:03:43,032 INFO L226 Difference]: Without dead ends: 174 [2024-11-14 05:03:43,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:03:43,039 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:03:43,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 6 Unknown, 0 Unchecked, 13.1s Time] [2024-11-14 05:03:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-14 05:03:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-14 05:03:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 153 states have (on average 1.2091503267973855) internal successors, (185), 165 states have internal predecessors, (185), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 05:03:43,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 207 transitions. [2024-11-14 05:03:43,123 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 207 transitions. Word has length 3 [2024-11-14 05:03:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:03:43,126 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 207 transitions. [2024-11-14 05:03:43,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-11-14 05:03:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 207 transitions. [2024-11-14 05:03:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 05:03:43,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:03:43,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 05:03:43,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:03:43,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-14 05:03:43,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:03:43,130 INFO L85 PathProgramCache]: Analyzing trace with hash 75099395, now seen corresponding path program 1 times [2024-11-14 05:03:43,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:03:43,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340976608] [2024-11-14 05:03:43,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:03:43,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:03:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 05:03:43,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832945940] [2024-11-14 05:03:43,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:03:43,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:03:43,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:03:43,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:03:43,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:03:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:03:43,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:03:43,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:03:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:03:43,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:03:43,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:03:43,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340976608] [2024-11-14 05:03:43,655 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-14 05:03:43,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832945940] [2024-11-14 05:03:43,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832945940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:03:43,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:03:43,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 05:03:43,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082246681] [2024-11-14 05:03:43,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:03:43,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:03:43,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:03:43,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:03:43,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:03:43,659 INFO L87 Difference]: Start difference. First operand 174 states and 207 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:03:45,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:03:47,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:03:51,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:03:53,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:03:55,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:03:57,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:03:59,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:01,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:03,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:05,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:07,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:09,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:10,995 INFO L93 Difference]: Finished difference Result 394 states and 480 transitions. [2024-11-14 05:04:10,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:04:10,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 05:04:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:11,003 INFO L225 Difference]: With dead ends: 394 [2024-11-14 05:04:11,003 INFO L226 Difference]: Without dead ends: 332 [2024-11-14 05:04:11,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:04:11,005 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 165 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:11,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 336 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 12 Unknown, 0 Unchecked, 27.3s Time] [2024-11-14 05:04:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-14 05:04:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 229. [2024-11-14 05:04:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 203 states have (on average 1.2266009852216748) internal successors, (249), 220 states have internal predecessors, (249), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 05:04:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 281 transitions. [2024-11-14 05:04:11,033 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 281 transitions. Word has length 4 [2024-11-14 05:04:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:11,033 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 281 transitions. [2024-11-14 05:04:11,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:04:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 281 transitions. [2024-11-14 05:04:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-14 05:04:11,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:11,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:11,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:04:11,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-14 05:04:11,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-14 05:04:11,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash 97976397, now seen corresponding path program 1 times [2024-11-14 05:04:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:11,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240336230] [2024-11-14 05:04:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:04:12,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:04:12,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240336230] [2024-11-14 05:04:12,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240336230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:12,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:04:12,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:04:12,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789369550] [2024-11-14 05:04:12,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:12,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:04:12,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:04:12,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:04:12,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:04:12,268 INFO L87 Difference]: Start difference. First operand 229 states and 281 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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) [2024-11-14 05:04:14,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:17,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:19,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:21,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:23,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:25,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:27,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:29,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:31,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:33,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:35,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:37,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:39,063 INFO L93 Difference]: Finished difference Result 468 states and 574 transitions. [2024-11-14 05:04:39,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:04:39,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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 56 [2024-11-14 05:04:39,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:39,067 INFO L225 Difference]: With dead ends: 468 [2024-11-14 05:04:39,067 INFO L226 Difference]: Without dead ends: 243 [2024-11-14 05:04:39,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:04:39,071 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 4 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:39,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 346 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 12 Unknown, 0 Unchecked, 26.8s Time] [2024-11-14 05:04:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-14 05:04:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2024-11-14 05:04:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 217 states have (on average 1.2165898617511521) internal successors, (264), 234 states have internal predecessors, (264), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-14 05:04:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 296 transitions. [2024-11-14 05:04:39,100 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 296 transitions. Word has length 56 [2024-11-14 05:04:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:39,101 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 296 transitions. [2024-11-14 05:04:39,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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) [2024-11-14 05:04:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 296 transitions. [2024-11-14 05:04:39,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-14 05:04:39,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:39,103 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:39,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:04:39,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-14 05:04:39,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1699205004, now seen corresponding path program 1 times [2024-11-14 05:04:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:39,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47617740] [2024-11-14 05:04:39,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:39,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:04:39,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:04:39,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47617740] [2024-11-14 05:04:39,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47617740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:39,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:04:39,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:04:39,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269149659] [2024-11-14 05:04:39,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:39,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:04:39,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:04:39,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:04:39,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:04:39,815 INFO L87 Difference]: Start difference. First operand 243 states and 296 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:04:41,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:43,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:46,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:49,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:51,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:53,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:55,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:57,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:04:59,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:01,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:03,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:05,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:07,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:09,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:11,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:12,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:05:14,632 INFO L93 Difference]: Finished difference Result 576 states and 713 transitions. [2024-11-14 05:05:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:05:14,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-11-14 05:05:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:05:14,642 INFO L225 Difference]: With dead ends: 576 [2024-11-14 05:05:14,642 INFO L226 Difference]: Without dead ends: 351 [2024-11-14 05:05:14,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:05:14,645 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 64 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:05:14,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 357 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 14 Unknown, 0 Unchecked, 34.8s Time] [2024-11-14 05:05:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-14 05:05:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 346. [2024-11-14 05:05:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 307 states have (on average 1.224755700325733) internal successors, (376), 334 states have internal predecessors, (376), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 13 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-14 05:05:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 434 transitions. [2024-11-14 05:05:14,674 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 434 transitions. Word has length 69 [2024-11-14 05:05:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:05:14,675 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 434 transitions. [2024-11-14 05:05:14,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:05:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 434 transitions. [2024-11-14 05:05:14,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-14 05:05:14,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:05:14,678 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:05:14,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:05:14,679 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-14 05:05:14,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:05:14,680 INFO L85 PathProgramCache]: Analyzing trace with hash -553949359, now seen corresponding path program 1 times [2024-11-14 05:05:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:05:14,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378250043] [2024-11-14 05:05:14,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:05:14,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:05:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:05:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 05:05:15,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:05:15,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378250043] [2024-11-14 05:05:15,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378250043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:05:15,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:05:15,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:05:15,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278896701] [2024-11-14 05:05:15,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:05:15,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:05:15,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:05:15,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:05:15,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:05:15,636 INFO L87 Difference]: Start difference. First operand 346 states and 434 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-14 05:05:17,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:19,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:21,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:23,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:25,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:30,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:32,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:34,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:36,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:05:37,026 INFO L93 Difference]: Finished difference Result 346 states and 434 transitions. [2024-11-14 05:05:37,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:05:37,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 82 [2024-11-14 05:05:37,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:05:37,034 INFO L225 Difference]: With dead ends: 346 [2024-11-14 05:05:37,035 INFO L226 Difference]: Without dead ends: 344 [2024-11-14 05:05:37,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:05:37,036 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 105 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:05:37,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 336 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 9 Unknown, 0 Unchecked, 21.4s Time] [2024-11-14 05:05:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-14 05:05:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2024-11-14 05:05:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 307 states have (on average 1.214983713355049) internal successors, (373), 332 states have internal predecessors, (373), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 13 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-14 05:05:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 431 transitions. [2024-11-14 05:05:37,065 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 431 transitions. Word has length 82 [2024-11-14 05:05:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:05:37,066 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 431 transitions. [2024-11-14 05:05:37,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-14 05:05:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 431 transitions. [2024-11-14 05:05:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-14 05:05:37,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:05:37,068 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:05:37,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:05:37,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-14 05:05:37,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:05:37,070 INFO L85 PathProgramCache]: Analyzing trace with hash 7440547, now seen corresponding path program 1 times [2024-11-14 05:05:37,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:05:37,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400268667] [2024-11-14 05:05:37,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:05:37,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:05:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:05:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 05:05:37,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:05:37,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400268667] [2024-11-14 05:05:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400268667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:05:37,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:05:37,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:05:37,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128616856] [2024-11-14 05:05:37,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:05:37,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:05:37,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:05:37,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:05:37,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:05:37,792 INFO L87 Difference]: Start difference. First operand 344 states and 431 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-14 05:05:39,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:41,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:43,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:45,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:47,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:49,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:51,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:53,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:56,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:05:58,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:00,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:02,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:04,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:06,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:08,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:10,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:12,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:14,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:16,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:19,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:21,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:23,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:25,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:26,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:28,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:06:28,381 INFO L93 Difference]: Finished difference Result 384 states and 475 transitions. [2024-11-14 05:06:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:06:28,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 83 [2024-11-14 05:06:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:06:28,394 INFO L225 Difference]: With dead ends: 384 [2024-11-14 05:06:28,394 INFO L226 Difference]: Without dead ends: 383 [2024-11-14 05:06:28,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:06:28,397 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 98 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:06:28,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 490 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 21 Unknown, 0 Unchecked, 50.5s Time] [2024-11-14 05:06:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-14 05:06:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2024-11-14 05:06:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 341 states have (on average 1.2023460410557185) internal successors, (410), 366 states have internal predecessors, (410), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 16 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-14 05:06:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 474 transitions. [2024-11-14 05:06:28,431 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 474 transitions. Word has length 83 [2024-11-14 05:06:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:06:28,432 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 474 transitions. [2024-11-14 05:06:28,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-14 05:06:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 474 transitions. [2024-11-14 05:06:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-14 05:06:28,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:06:28,435 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:06:28,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 05:06:28,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-14 05:06:28,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:06:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1674405405, now seen corresponding path program 1 times [2024-11-14 05:06:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:06:28,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326238246] [2024-11-14 05:06:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:06:28,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:06:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:06:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:06:32,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:06:32,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326238246] [2024-11-14 05:06:32,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326238246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:06:32,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35006153] [2024-11-14 05:06:32,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:06:32,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:06:32,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:06:32,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:06:32,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:06:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:06:38,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 05:06:38,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:06:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 05:06:38,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:06:38,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35006153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:06:38,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:06:38,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-14 05:06:38,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570287104] [2024-11-14 05:06:38,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:06:38,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:06:38,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:06:38,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:06:38,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:06:38,094 INFO L87 Difference]: Start difference. First operand 381 states and 474 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 05:06:40,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:42,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:44,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:46,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:48,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:50,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:52,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:54,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:56,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:06:58,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:07:00,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:07:02,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:07:04,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:07:06,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:07:08,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:07:10,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:07:12,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:07:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:07:13,671 INFO L93 Difference]: Finished difference Result 743 states and 939 transitions. [2024-11-14 05:07:13,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:07:13,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 86 [2024-11-14 05:07:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:07:13,679 INFO L225 Difference]: With dead ends: 743 [2024-11-14 05:07:13,679 INFO L226 Difference]: Without dead ends: 383 [2024-11-14 05:07:13,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:07:13,681 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:07:13,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 506 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 16 Unknown, 0 Unchecked, 35.5s Time] [2024-11-14 05:07:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-14 05:07:13,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-11-14 05:07:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 342 states have (on average 1.2046783625730995) internal successors, (412), 368 states have internal predecessors, (412), 32 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (36), 16 states have call predecessors, (36), 32 states have call successors, (36) [2024-11-14 05:07:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 480 transitions. [2024-11-14 05:07:13,710 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 480 transitions. Word has length 86 [2024-11-14 05:07:13,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:07:13,710 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 480 transitions. [2024-11-14 05:07:13,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-14 05:07:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 480 transitions. [2024-11-14 05:07:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-14 05:07:13,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:07:13,712 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:07:13,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:07:13,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-14 05:07:13,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-11-14 05:07:13,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:07:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1163790467, now seen corresponding path program 1 times [2024-11-14 05:07:13,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:07:13,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954837072] [2024-11-14 05:07:13,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:07:13,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:07:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:07:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 05:07:16,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:07:16,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954837072] [2024-11-14 05:07:16,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954837072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:07:16,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645800642] [2024-11-14 05:07:16,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:07:16,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:07:16,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:07:16,428 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:07:16,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6195c8-3d81-4fe9-bbab-5b3ad83b12fa/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:08:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:08:20,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 05:08:20,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:08:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 05:08:20,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:08:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 05:08:21,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645800642] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:08:21,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [469684782] [2024-11-14 05:08:21,132 INFO L159 IcfgInterpreter]: Started Sifa with 75 locations of interest [2024-11-14 05:08:21,132 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:08:21,137 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:08:21,143 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:08:21,143 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:09:17,744 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 152 for LOIs [2024-11-14 05:09:17,923 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:09:55,412 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 187 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:10:46,797 WARN L286 SmtUtils]: Spent 14.15s on a formula simplification that was a NOOP. DAG size: 185 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:11:00,400 WARN L286 SmtUtils]: Spent 10.54s on a formula simplification that was a NOOP. DAG size: 190 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:11:02,416 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~count_int_int~0 0) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (= |c_ULTIMATE.start_main_~users~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~#j~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (let ((.cse23 (exists ((|v_#Ultimate.C_memset_#t~loopctr458_35| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr458_35|) (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr458_35| 4294967296)))))) (or (and (exists ((|v_#memory_int_889| (Array Int (Array Int Int))) (|v_#valid_107| (Array Int Int)) (|v_#length_53| (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc206#1.base_6| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_#memory_int_253| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_246| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_773| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_245| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_244| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_244| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_773| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_245| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_246| (Array Int (Array Int Int))) (|v_#memory_int_252| (Array Int (Array Int Int)))) (let ((.cse12 (select (select |v_#memory_$Pointer$.base_244| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse13 (select (select |v_#memory_$Pointer$.offset_244| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse19 (select (select |v_#memory_$Pointer$.base_773| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse20 (+ (select (select |v_#memory_$Pointer$.offset_773| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 16))) (let ((.cse21 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse22 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse0 (store |v_#memory_$Pointer$.offset_773| .cse19 (store (select |v_#memory_$Pointer$.offset_773| .cse19) .cse20 40))) (.cse18 (store |v_#memory_$Pointer$.base_773| .cse19 (store (select |v_#memory_$Pointer$.base_773| .cse19) .cse20 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse16 (store |v_#memory_$Pointer$.offset_244| .cse12 (store (select |v_#memory_$Pointer$.offset_244| .cse12) .cse13 0))) (.cse3 (store |v_#memory_$Pointer$.base_244| .cse12 (store (select |v_#memory_$Pointer$.base_244| .cse12) .cse13 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|)))) (let ((.cse6 (select (select |v_#memory_$Pointer$.base_245| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse7 (+ (select (select |v_#memory_$Pointer$.offset_245| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 20)) (.cse9 (select (select |v_#memory_$Pointer$.base_246| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse10 (+ (select (select |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse5 (+ 40 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse1 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4)) (.cse8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| .cse21) .cse22)) (.cse17 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| .cse21) .cse22))) (and (= |c_#valid| (store |v_#valid_107| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= |v_#memory_$Pointer$.offset_246| (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 (select (select |v_#memory_$Pointer$.offset_246| .cse1) .cse2)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| .cse4) .cse5)))) (= (store |v_#memory_$Pointer$.base_245| .cse6 (store (select |v_#memory_$Pointer$.base_245| .cse6) .cse7 (select (select |v_#memory_$Pointer$.base_244| .cse6) .cse7))) |v_#memory_$Pointer$.base_244|) (= |c_ULTIMATE.start_main_#t~mem212#1.base| .cse8) (= (store |v_#memory_$Pointer$.base_246| .cse9 (store (select |v_#memory_$Pointer$.base_246| .cse9) .cse10 (select (select |v_#memory_$Pointer$.base_245| .cse9) .cse10))) |v_#memory_$Pointer$.base_245|) (= (store |v_#memory_$Pointer$.offset_245| .cse6 (store (select |v_#memory_$Pointer$.offset_245| .cse6) .cse7 (select (select |v_#memory_$Pointer$.offset_244| .cse6) .cse7))) |v_#memory_$Pointer$.offset_244|) (= (select |v_#valid_107| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (= (let ((.cse11 (let ((.cse14 (let ((.cse15 (store |v_#memory_int_253| .cse1 (store (select |v_#memory_int_253| .cse1) .cse2 32)))) (store .cse15 .cse9 (store (select .cse15 .cse9) .cse10 5))))) (store .cse14 .cse6 (store (select .cse14 .cse6) .cse7 40))))) (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 (select (select |v_#memory_int_252| .cse12) .cse13)))) |v_#memory_int_252|) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_53| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384)) (= (store |v_#memory_$Pointer$.offset_246| .cse9 (store (select |v_#memory_$Pointer$.offset_246| .cse9) .cse10 (select (select |v_#memory_$Pointer$.offset_245| .cse9) .cse10))) |v_#memory_$Pointer$.offset_245|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| (store .cse16 .cse4 (store (select .cse16 .cse4) .cse5 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| .cse4) .cse5)))) (= |c_ULTIMATE.start_main_#t~mem212#1.offset| .cse17) (= (store .cse18 .cse1 (store (select .cse18 .cse1) .cse2 (select (select |v_#memory_$Pointer$.base_246| .cse1) .cse2))) |v_#memory_$Pointer$.base_246|) (= (store |v_#memory_int_889| .cse19 (store (select |v_#memory_int_889| .cse19) .cse20 (select (select |v_#memory_int_253| .cse19) .cse20))) |v_#memory_int_253|) (or (not (= .cse8 0)) (not (= .cse17 0)))))))) .cse23) (and (exists ((|v_#memory_int_889| (Array Int (Array Int Int))) (|v_#valid_107| (Array Int Int)) (|v_#length_53| (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc206#1.base_6| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_40| (Array Int (Array Int Int))) (|v_#memory_int_253| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_BEFORE_CALL_64| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_246| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_773| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_245| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_244| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_244| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_773| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_245| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_246| (Array Int (Array Int Int))) (|v_#memory_int_252| (Array Int (Array Int Int)))) (let ((.cse36 (select (select |v_#memory_$Pointer$.base_244| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse37 (select (select |v_#memory_$Pointer$.offset_244| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse43 (select (select |v_#memory_$Pointer$.base_773| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse44 (+ (select (select |v_#memory_$Pointer$.offset_773| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 16))) (let ((.cse45 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse46 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_64| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse24 (store |v_#memory_$Pointer$.offset_773| .cse43 (store (select |v_#memory_$Pointer$.offset_773| .cse43) .cse44 40))) (.cse42 (store |v_#memory_$Pointer$.base_773| .cse43 (store (select |v_#memory_$Pointer$.base_773| .cse43) .cse44 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse32 (store |v_#memory_$Pointer$.offset_244| .cse36 (store (select |v_#memory_$Pointer$.offset_244| .cse36) .cse37 0))) (.cse41 (store |v_#memory_$Pointer$.base_244| .cse36 (store (select |v_#memory_$Pointer$.base_244| .cse36) .cse37 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|)))) (let ((.cse27 (select (select |v_#memory_$Pointer$.base_245| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse28 (+ (select (select |v_#memory_$Pointer$.offset_245| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 20)) (.cse33 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse34 (+ 40 (select (select .cse32 |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse29 (select (select |v_#memory_$Pointer$.base_246| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse30 (+ (select (select |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse25 (select (select .cse42 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse26 (+ (select (select .cse24 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4)) (.cse31 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_64| .cse45) .cse46)) (.cse40 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| .cse45) .cse46))) (and (= |c_#valid| (store |v_#valid_107| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= |v_#memory_$Pointer$.offset_246| (store .cse24 .cse25 (store (select .cse24 .cse25) .cse26 (select (select |v_#memory_$Pointer$.offset_246| .cse25) .cse26)))) (= (store |v_#memory_$Pointer$.base_245| .cse27 (store (select |v_#memory_$Pointer$.base_245| .cse27) .cse28 (select (select |v_#memory_$Pointer$.base_244| .cse27) .cse28))) |v_#memory_$Pointer$.base_244|) (= (store |v_#memory_$Pointer$.base_246| .cse29 (store (select |v_#memory_$Pointer$.base_246| .cse29) .cse30 (select (select |v_#memory_$Pointer$.base_245| .cse29) .cse30))) |v_#memory_$Pointer$.base_245|) (= |c_ULTIMATE.start_main_#t~mem212#1.offset| .cse31) (= (store .cse32 .cse33 (store (select .cse32 .cse33) .cse34 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_64| .cse33) .cse34))) |v_#memory_$Pointer$.offset_BEFORE_CALL_64|) (= (store |v_#memory_$Pointer$.offset_245| .cse27 (store (select |v_#memory_$Pointer$.offset_245| .cse27) .cse28 (select (select |v_#memory_$Pointer$.offset_244| .cse27) .cse28))) |v_#memory_$Pointer$.offset_244|) (= (select |v_#valid_107| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (= (let ((.cse35 (let ((.cse38 (let ((.cse39 (store |v_#memory_int_253| .cse25 (store (select |v_#memory_int_253| .cse25) .cse26 32)))) (store .cse39 .cse29 (store (select .cse39 .cse29) .cse30 5))))) (store .cse38 .cse27 (store (select .cse38 .cse27) .cse28 40))))) (store .cse35 .cse36 (store (select .cse35 .cse36) .cse37 (select (select |v_#memory_int_252| .cse36) .cse37)))) |v_#memory_int_252|) (= |c_ULTIMATE.start_main_#t~mem212#1.base| .cse40) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_53| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| (store .cse41 .cse33 (store (select .cse41 .cse33) .cse34 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| .cse33) .cse34)))) (= (store |v_#memory_$Pointer$.offset_246| .cse29 (store (select |v_#memory_$Pointer$.offset_246| .cse29) .cse30 (select (select |v_#memory_$Pointer$.offset_245| .cse29) .cse30))) |v_#memory_$Pointer$.offset_245|) (= (store .cse42 .cse25 (store (select .cse42 .cse25) .cse26 (select (select |v_#memory_$Pointer$.base_246| .cse25) .cse26))) |v_#memory_$Pointer$.base_246|) (= (store |v_#memory_int_889| .cse43 (store (select |v_#memory_int_889| .cse43) .cse44 (select (select |v_#memory_int_253| .cse43) .cse44))) |v_#memory_int_253|) (or (not (= .cse31 0)) (not (= .cse40 0)))))))) .cse23))) (<= 2 |c_ULTIMATE.start_main_~#j~0#1.base|)) is different from false [2024-11-14 05:12:43,515 WARN L286 SmtUtils]: Spent 37.73s on a formula simplification that was a NOOP. DAG size: 217 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:12:45,532 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~count_int_int~0 0) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (= |c_ULTIMATE.start_main_~users~0#1.offset| 0) (let ((.cse21 (exists ((|v_#Ultimate.C_memset_#t~loopctr458_35| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr458_35|) (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr458_35| 4294967296)))))) (or (and (exists ((|v_#memory_int_889| (Array Int (Array Int Int))) (|v_#valid_107| (Array Int Int)) (|v_#length_53| (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc206#1.base_6| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_40| (Array Int (Array Int Int))) (|v_#memory_int_253| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_BEFORE_CALL_64| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_246| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_773| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_245| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_244| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_244| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_773| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_245| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_246| (Array Int (Array Int Int))) (|v_#memory_int_252| (Array Int (Array Int Int)))) (let ((.cse11 (select (select |v_#memory_$Pointer$.base_244| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse12 (select (select |v_#memory_$Pointer$.offset_244| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse17 (select (select |v_#memory_$Pointer$.base_773| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse18 (+ (select (select |v_#memory_$Pointer$.offset_773| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 16))) (let ((.cse0 (store |v_#memory_$Pointer$.offset_773| .cse17 (store (select |v_#memory_$Pointer$.offset_773| .cse17) .cse18 40))) (.cse16 (store |v_#memory_$Pointer$.base_773| .cse17 (store (select |v_#memory_$Pointer$.base_773| .cse17) .cse18 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse7 (store |v_#memory_$Pointer$.offset_244| .cse11 (store (select |v_#memory_$Pointer$.offset_244| .cse11) .cse12 0))) (.cse15 (store |v_#memory_$Pointer$.base_244| .cse11 (store (select |v_#memory_$Pointer$.base_244| .cse11) .cse12 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|)))) (let ((.cse3 (select (select |v_#memory_$Pointer$.base_245| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse4 (+ (select (select |v_#memory_$Pointer$.offset_245| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 20)) (.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse9 (+ 40 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse5 (select (select |v_#memory_$Pointer$.base_246| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse6 (+ (select (select |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse1 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4))) (and (= |c_#valid| (store |v_#valid_107| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= |v_#memory_$Pointer$.offset_246| (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 (select (select |v_#memory_$Pointer$.offset_246| .cse1) .cse2)))) (= (store |v_#memory_$Pointer$.base_245| .cse3 (store (select |v_#memory_$Pointer$.base_245| .cse3) .cse4 (select (select |v_#memory_$Pointer$.base_244| .cse3) .cse4))) |v_#memory_$Pointer$.base_244|) (= (store |v_#memory_$Pointer$.base_246| .cse5 (store (select |v_#memory_$Pointer$.base_246| .cse5) .cse6 (select (select |v_#memory_$Pointer$.base_245| .cse5) .cse6))) |v_#memory_$Pointer$.base_245|) (= (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_64| .cse8) .cse9))) |v_#memory_$Pointer$.offset_BEFORE_CALL_64|) (= (store |v_#memory_$Pointer$.offset_245| .cse3 (store (select |v_#memory_$Pointer$.offset_245| .cse3) .cse4 (select (select |v_#memory_$Pointer$.offset_244| .cse3) .cse4))) |v_#memory_$Pointer$.offset_244|) (= (select |v_#valid_107| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (= (let ((.cse10 (let ((.cse13 (let ((.cse14 (store |v_#memory_int_253| .cse1 (store (select |v_#memory_int_253| .cse1) .cse2 32)))) (store .cse14 .cse5 (store (select .cse14 .cse5) .cse6 5))))) (store .cse13 .cse3 (store (select .cse13 .cse3) .cse4 40))))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 (select (select |v_#memory_int_252| .cse11) .cse12)))) |v_#memory_int_252|) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_53| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| (store .cse15 .cse8 (store (select .cse15 .cse8) .cse9 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| .cse8) .cse9)))) (= (store |v_#memory_$Pointer$.offset_246| .cse5 (store (select |v_#memory_$Pointer$.offset_246| .cse5) .cse6 (select (select |v_#memory_$Pointer$.offset_245| .cse5) .cse6))) |v_#memory_$Pointer$.offset_245|) (= (store .cse16 .cse1 (store (select .cse16 .cse1) .cse2 (select (select |v_#memory_$Pointer$.base_246| .cse1) .cse2))) |v_#memory_$Pointer$.base_246|) (= (store |v_#memory_int_889| .cse17 (store (select |v_#memory_int_889| .cse17) .cse18 (select (select |v_#memory_int_253| .cse17) .cse18))) |v_#memory_int_253|) (let ((.cse19 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse20 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_64| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (or (not (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_64| .cse19) .cse20) 0)) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| .cse19) .cse20) 0))))))))) .cse21) (and (exists ((|v_#memory_int_889| (Array Int (Array Int Int))) (|v_#valid_107| (Array Int Int)) (|v_#length_53| (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc206#1.base_6| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_#memory_int_253| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_246| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_773| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_245| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_244| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_244| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_773| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_245| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_246| (Array Int (Array Int Int))) (|v_#memory_int_252| (Array Int (Array Int Int)))) (let ((.cse33 (select (select |v_#memory_$Pointer$.base_244| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse34 (select (select |v_#memory_$Pointer$.offset_244| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse39 (select (select |v_#memory_$Pointer$.base_773| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse40 (+ (select (select |v_#memory_$Pointer$.offset_773| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 16))) (let ((.cse22 (store |v_#memory_$Pointer$.offset_773| .cse39 (store (select |v_#memory_$Pointer$.offset_773| .cse39) .cse40 40))) (.cse38 (store |v_#memory_$Pointer$.base_773| .cse39 (store (select |v_#memory_$Pointer$.base_773| .cse39) .cse40 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse37 (store |v_#memory_$Pointer$.offset_244| .cse33 (store (select |v_#memory_$Pointer$.offset_244| .cse33) .cse34 0))) (.cse25 (store |v_#memory_$Pointer$.base_244| .cse33 (store (select |v_#memory_$Pointer$.base_244| .cse33) .cse34 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|)))) (let ((.cse28 (select (select |v_#memory_$Pointer$.base_245| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse29 (+ (select (select |v_#memory_$Pointer$.offset_245| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 20)) (.cse30 (select (select |v_#memory_$Pointer$.base_246| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse31 (+ (select (select |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse26 (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse27 (+ 40 (select (select .cse37 |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse23 (select (select .cse38 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse24 (+ (select (select .cse22 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4))) (and (= |c_#valid| (store |v_#valid_107| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= |v_#memory_$Pointer$.offset_246| (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 (select (select |v_#memory_$Pointer$.offset_246| .cse23) .cse24)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| .cse26) .cse27)))) (= (store |v_#memory_$Pointer$.base_245| .cse28 (store (select |v_#memory_$Pointer$.base_245| .cse28) .cse29 (select (select |v_#memory_$Pointer$.base_244| .cse28) .cse29))) |v_#memory_$Pointer$.base_244|) (= (store |v_#memory_$Pointer$.base_246| .cse30 (store (select |v_#memory_$Pointer$.base_246| .cse30) .cse31 (select (select |v_#memory_$Pointer$.base_245| .cse30) .cse31))) |v_#memory_$Pointer$.base_245|) (= (store |v_#memory_$Pointer$.offset_245| .cse28 (store (select |v_#memory_$Pointer$.offset_245| .cse28) .cse29 (select (select |v_#memory_$Pointer$.offset_244| .cse28) .cse29))) |v_#memory_$Pointer$.offset_244|) (= (select |v_#valid_107| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (= (let ((.cse32 (let ((.cse35 (let ((.cse36 (store |v_#memory_int_253| .cse23 (store (select |v_#memory_int_253| .cse23) .cse24 32)))) (store .cse36 .cse30 (store (select .cse36 .cse30) .cse31 5))))) (store .cse35 .cse28 (store (select .cse35 .cse28) .cse29 40))))) (store .cse32 .cse33 (store (select .cse32 .cse33) .cse34 (select (select |v_#memory_int_252| .cse33) .cse34)))) |v_#memory_int_252|) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_53| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384)) (= (store |v_#memory_$Pointer$.offset_246| .cse30 (store (select |v_#memory_$Pointer$.offset_246| .cse30) .cse31 (select (select |v_#memory_$Pointer$.offset_245| .cse30) .cse31))) |v_#memory_$Pointer$.offset_245|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| (store .cse37 .cse26 (store (select .cse37 .cse26) .cse27 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| .cse26) .cse27)))) (= (store .cse38 .cse23 (store (select .cse38 .cse23) .cse24 (select (select |v_#memory_$Pointer$.base_246| .cse23) .cse24))) |v_#memory_$Pointer$.base_246|) (= (store |v_#memory_int_889| .cse39 (store (select |v_#memory_int_889| .cse39) .cse40 (select (select |v_#memory_int_253| .cse39) .cse40))) |v_#memory_int_253|) (let ((.cse41 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse42 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (or (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| .cse41) .cse42) 0)) (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| .cse41) .cse42) 0))))))))) .cse21))) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~altusers~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#j~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~altusers~0#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) (<= 2 |c_ULTIMATE.start_main_~#j~0#1.base|)) is different from false [2024-11-14 05:12:47,563 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~count_int_int~0 0) (exists ((|v_#memory_$Pointer$.base_774| (Array Int (Array Int Int))) (|v_#memory_int_890| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_774| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_774| |c_ULTIMATE.start_main_~altusers~0#1.base|) 40)) (.cse1 (+ (select (select |v_#memory_$Pointer$.offset_774| |c_ULTIMATE.start_main_~altusers~0#1.base|) 40) 12))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_774| .cse0 (store (select |v_#memory_$Pointer$.base_774| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |v_#memory_int_890| .cse0 (let ((.cse2 (select |v_#memory_int_890| .cse0))) (store .cse2 .cse1 (+ (select .cse2 .cse1) 1)))) |c_#memory_int|) (= (store |v_#memory_$Pointer$.offset_774| .cse0 (store (select |v_#memory_$Pointer$.offset_774| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_#memory_$Pointer$.offset|)))) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (= |c_ULTIMATE.start_main_~users~0#1.offset| 0) (let ((.cse24 (exists ((|v_#Ultimate.C_memset_#t~loopctr458_35| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr458_35|) (<= 384 (mod |v_#Ultimate.C_memset_#t~loopctr458_35| 4294967296)))))) (or (and (exists ((|v_#memory_int_889| (Array Int (Array Int Int))) (|v_#valid_107| (Array Int Int)) (|v_#length_53| (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc206#1.base_6| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_40| (Array Int (Array Int Int))) (|v_#memory_int_253| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_BEFORE_CALL_64| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_246| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_773| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_245| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_244| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_244| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_773| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_245| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_246| (Array Int (Array Int Int))) (|v_#memory_int_252| (Array Int (Array Int Int)))) (let ((.cse14 (select (select |v_#memory_$Pointer$.base_244| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse15 (select (select |v_#memory_$Pointer$.offset_244| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse20 (select (select |v_#memory_$Pointer$.base_773| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse21 (+ (select (select |v_#memory_$Pointer$.offset_773| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 16))) (let ((.cse3 (store |v_#memory_$Pointer$.offset_773| .cse20 (store (select |v_#memory_$Pointer$.offset_773| .cse20) .cse21 40))) (.cse19 (store |v_#memory_$Pointer$.base_773| .cse20 (store (select |v_#memory_$Pointer$.base_773| .cse20) .cse21 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse10 (store |v_#memory_$Pointer$.offset_244| .cse14 (store (select |v_#memory_$Pointer$.offset_244| .cse14) .cse15 0))) (.cse18 (store |v_#memory_$Pointer$.base_244| .cse14 (store (select |v_#memory_$Pointer$.base_244| .cse14) .cse15 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|)))) (let ((.cse6 (select (select |v_#memory_$Pointer$.base_245| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse7 (+ (select (select |v_#memory_$Pointer$.offset_245| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 20)) (.cse11 (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse12 (+ 40 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse8 (select (select |v_#memory_$Pointer$.base_246| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse9 (+ (select (select |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse4 (select (select .cse19 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse5 (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4))) (and (= |c_#valid| (store |v_#valid_107| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= |v_#memory_$Pointer$.offset_246| (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 (select (select |v_#memory_$Pointer$.offset_246| .cse4) .cse5)))) (= (store |v_#memory_$Pointer$.base_245| .cse6 (store (select |v_#memory_$Pointer$.base_245| .cse6) .cse7 (select (select |v_#memory_$Pointer$.base_244| .cse6) .cse7))) |v_#memory_$Pointer$.base_244|) (= (store |v_#memory_$Pointer$.base_246| .cse8 (store (select |v_#memory_$Pointer$.base_246| .cse8) .cse9 (select (select |v_#memory_$Pointer$.base_245| .cse8) .cse9))) |v_#memory_$Pointer$.base_245|) (= (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_64| .cse11) .cse12))) |v_#memory_$Pointer$.offset_BEFORE_CALL_64|) (= (store |v_#memory_$Pointer$.offset_245| .cse6 (store (select |v_#memory_$Pointer$.offset_245| .cse6) .cse7 (select (select |v_#memory_$Pointer$.offset_244| .cse6) .cse7))) |v_#memory_$Pointer$.offset_244|) (= (select |v_#valid_107| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (= (let ((.cse13 (let ((.cse16 (let ((.cse17 (store |v_#memory_int_253| .cse4 (store (select |v_#memory_int_253| .cse4) .cse5 32)))) (store .cse17 .cse8 (store (select .cse17 .cse8) .cse9 5))))) (store .cse16 .cse6 (store (select .cse16 .cse6) .cse7 40))))) (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 (select (select |v_#memory_int_252| .cse14) .cse15)))) |v_#memory_int_252|) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_53| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| (store .cse18 .cse11 (store (select .cse18 .cse11) .cse12 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| .cse11) .cse12)))) (= (store |v_#memory_$Pointer$.offset_246| .cse8 (store (select |v_#memory_$Pointer$.offset_246| .cse8) .cse9 (select (select |v_#memory_$Pointer$.offset_245| .cse8) .cse9))) |v_#memory_$Pointer$.offset_245|) (= (store .cse19 .cse4 (store (select .cse19 .cse4) .cse5 (select (select |v_#memory_$Pointer$.base_246| .cse4) .cse5))) |v_#memory_$Pointer$.base_246|) (= (store |v_#memory_int_889| .cse20 (store (select |v_#memory_int_889| .cse20) .cse21 (select (select |v_#memory_int_253| .cse20) .cse21))) |v_#memory_int_253|) (let ((.cse22 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse23 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_64| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (or (not (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_64| .cse22) .cse23) 0)) (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| .cse22) .cse23) 0))))))))) .cse24) (and (exists ((|v_#memory_int_889| (Array Int (Array Int Int))) (|v_#valid_107| (Array Int Int)) (|v_#length_53| (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc206#1.base_6| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_#memory_int_253| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_246| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_773| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_245| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_244| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_244| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_773| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_245| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_246| (Array Int (Array Int Int))) (|v_#memory_int_252| (Array Int (Array Int Int)))) (let ((.cse36 (select (select |v_#memory_$Pointer$.base_244| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse37 (select (select |v_#memory_$Pointer$.offset_244| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse42 (select (select |v_#memory_$Pointer$.base_773| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse43 (+ (select (select |v_#memory_$Pointer$.offset_773| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 16))) (let ((.cse25 (store |v_#memory_$Pointer$.offset_773| .cse42 (store (select |v_#memory_$Pointer$.offset_773| .cse42) .cse43 40))) (.cse41 (store |v_#memory_$Pointer$.base_773| .cse42 (store (select |v_#memory_$Pointer$.base_773| .cse42) .cse43 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse40 (store |v_#memory_$Pointer$.offset_244| .cse36 (store (select |v_#memory_$Pointer$.offset_244| .cse36) .cse37 0))) (.cse28 (store |v_#memory_$Pointer$.base_244| .cse36 (store (select |v_#memory_$Pointer$.base_244| .cse36) .cse37 |v_ULTIMATE.start_main_#t~malloc206#1.base_6|)))) (let ((.cse31 (select (select |v_#memory_$Pointer$.base_245| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse32 (+ (select (select |v_#memory_$Pointer$.offset_245| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 20)) (.cse33 (select (select |v_#memory_$Pointer$.base_246| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse34 (+ (select (select |v_#memory_$Pointer$.offset_246| |c_ULTIMATE.start_main_~user~0#1.base|) 40) 8)) (.cse29 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse30 (+ 40 (select (select .cse40 |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (.cse26 (select (select .cse41 |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse27 (+ (select (select .cse25 |c_ULTIMATE.start_main_~user~0#1.base|) 40) 4))) (and (= |c_#valid| (store |v_#valid_107| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 0)) (= |v_#memory_$Pointer$.offset_246| (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 (select (select |v_#memory_$Pointer$.offset_246| .cse26) .cse27)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (store .cse28 .cse29 (store (select .cse28 .cse29) .cse30 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| .cse29) .cse30)))) (= (store |v_#memory_$Pointer$.base_245| .cse31 (store (select |v_#memory_$Pointer$.base_245| .cse31) .cse32 (select (select |v_#memory_$Pointer$.base_244| .cse31) .cse32))) |v_#memory_$Pointer$.base_244|) (= (store |v_#memory_$Pointer$.base_246| .cse33 (store (select |v_#memory_$Pointer$.base_246| .cse33) .cse34 (select (select |v_#memory_$Pointer$.base_245| .cse33) .cse34))) |v_#memory_$Pointer$.base_245|) (= (store |v_#memory_$Pointer$.offset_245| .cse31 (store (select |v_#memory_$Pointer$.offset_245| .cse31) .cse32 (select (select |v_#memory_$Pointer$.offset_244| .cse31) .cse32))) |v_#memory_$Pointer$.offset_244|) (= (select |v_#valid_107| |v_ULTIMATE.start_main_#t~malloc206#1.base_6|) 0) (= (let ((.cse35 (let ((.cse38 (let ((.cse39 (store |v_#memory_int_253| .cse26 (store (select |v_#memory_int_253| .cse26) .cse27 32)))) (store .cse39 .cse33 (store (select .cse39 .cse33) .cse34 5))))) (store .cse38 .cse31 (store (select .cse38 .cse31) .cse32 40))))) (store .cse35 .cse36 (store (select .cse35 .cse36) .cse37 (select (select |v_#memory_int_252| .cse36) .cse37)))) |v_#memory_int_252|) (<= (+ |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_53| |v_ULTIMATE.start_main_#t~malloc206#1.base_6| 384)) (= (store |v_#memory_$Pointer$.offset_246| .cse33 (store (select |v_#memory_$Pointer$.offset_246| .cse33) .cse34 (select (select |v_#memory_$Pointer$.offset_245| .cse33) .cse34))) |v_#memory_$Pointer$.offset_245|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| (store .cse40 .cse29 (store (select .cse40 .cse29) .cse30 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| .cse29) .cse30)))) (= (store .cse41 .cse26 (store (select .cse41 .cse26) .cse27 (select (select |v_#memory_$Pointer$.base_246| .cse26) .cse27))) |v_#memory_$Pointer$.base_246|) (= (store |v_#memory_int_889| .cse42 (store (select |v_#memory_int_889| .cse42) .cse43 (select (select |v_#memory_int_253| .cse42) .cse43))) |v_#memory_int_253|) (let ((.cse44 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| |c_ULTIMATE.start_main_~user~0#1.base|) 40)) (.cse45 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| |c_ULTIMATE.start_main_~user~0#1.base|) 40))) (or (not (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| .cse44) .cse45) 0)) (not (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| .cse44) .cse45) 0))))))))) .cse24))) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~altusers~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#j~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~altusers~0#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) (<= 2 |c_ULTIMATE.start_main_~#j~0#1.base|)) is different from false [2024-11-14 05:15:33,772 WARN L286 SmtUtils]: Spent 1.76m on a formula simplification that was a NOOP. DAG size: 284 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:15:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [469684782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:15:40,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:15:40,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [5, 5, 5] total 44 [2024-11-14 05:15:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466859177] [2024-11-14 05:15:40,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:15:40,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 05:15:40,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:15:40,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 05:15:40,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1433, Unknown=78, NotChecked=240, Total=1892 [2024-11-14 05:15:40,532 INFO L87 Difference]: Start difference. First operand 383 states and 480 transitions. Second operand has 36 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-14 05:15:41,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:15:43,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:15:46,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:15:49,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:15:51,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:15:53,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:15:55,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:15:58,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:15:59,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:01,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:03,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:07,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:09,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:11,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:13,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:16,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:18,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:20,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:23,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:25,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:27,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:29,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:31,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:33,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:35,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:37,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:39,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:41,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:43,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:45,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:47,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:49,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:52,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:54,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:56,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:16:58,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:00,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:02,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:04,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:06,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:08,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:10,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:12,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:14,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:16,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:18,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:19,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:21,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:23,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:25,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:27,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:29,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:32,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:34,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:35,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:37,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:39,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:42,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:44,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:17:46,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-14 05:18:11,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:18:13,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:18:15,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:18:17,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]