./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.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_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/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_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/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_bfcd7414-caee-4c7a-abca-5f211a866f7f/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 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:08:56,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:08:56,263 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-14 05:08:56,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:08:56,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:08:56,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:08:56,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:08:56,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:08:56,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:08:56,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:08:56,297 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:08:56,297 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:08:56,297 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:08:56,297 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:08:56,298 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:08:56,298 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:08:56,298 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:08:56,298 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:08:56,298 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:08:56,298 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:08:56,298 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:08:56,299 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:08:56,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:08:56,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:08:56,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:08:56,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:08:56,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:08:56,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:08:56,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:08:56,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:08:56,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:08:56,300 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:08:56,300 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-14 05:08:56,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:08:56,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:08:56,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:08:56,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:08:56,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:08:56,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:08:56,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:08:56,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:08:56,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:08:56,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:08:56,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:08:56,302 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:08:56,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:08:56,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:08:56,302 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:08:56,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:08:56,303 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_bfcd7414-caee-4c7a-abca-5f211a866f7f/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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2024-11-14 05:08:56,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:08:56,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:08:56,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:08:56,662 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:08:56,663 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:08:56,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i Unable to find full path for "g++" [2024-11-14 05:08:58,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:08:59,300 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:08:59,301 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2024-11-14 05:08:59,324 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/data/3cd381b45/3b6e278c39b44f8caae5fcf504c8f835/FLAG5b6911e57 [2024-11-14 05:08:59,352 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/data/3cd381b45/3b6e278c39b44f8caae5fcf504c8f835 [2024-11-14 05:08:59,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:08:59,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:08:59,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:08:59,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:08:59,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:08:59,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:08:59" (1/1) ... [2024-11-14 05:08:59,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aeeabad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:59, skipping insertion in model container [2024-11-14 05:08:59,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:08:59" (1/1) ... [2024-11-14 05:08:59,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:08:59,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:08:59,834 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:08:59,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:08:59,913 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:08:59,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:59 WrapperNode [2024-11-14 05:08:59,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:08:59,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:08:59,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:08:59,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:08:59,922 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:08:59" (1/1) ... [2024-11-14 05:08:59,942 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:08:59" (1/1) ... [2024-11-14 05:08:59,971 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 119 [2024-11-14 05:08:59,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:08:59,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:08:59,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:08:59,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:08:59,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:59" (1/1) ... [2024-11-14 05:08:59,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:59" (1/1) ... [2024-11-14 05:08:59,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:59" (1/1) ... [2024-11-14 05:08:59,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:59" (1/1) ... [2024-11-14 05:09:00,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:59" (1/1) ... [2024-11-14 05:09:00,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:59" (1/1) ... [2024-11-14 05:09:00,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:59" (1/1) ... [2024-11-14 05:09:00,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:59" (1/1) ... [2024-11-14 05:09:00,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:09:00,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:09:00,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:09:00,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:09:00,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:59" (1/1) ... [2024-11-14 05:09:00,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:09:00,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:09:00,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/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:09:00,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/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:09:00,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:09:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:09:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-14 05:09:00,083 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-14 05:09:00,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:09:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:09:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:09:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:09:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:09:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:09:00,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 05:09:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:09:00,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:09:00,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:09:00,256 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:09:00,258 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:09:00,570 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-14 05:09:00,570 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:09:00,667 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:09:00,667 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-14 05:09:00,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:09:00 BoogieIcfgContainer [2024-11-14 05:09:00,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:09:00,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:09:00,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:09:00,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:09:00,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:08:59" (1/3) ... [2024-11-14 05:09:00,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548f79e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:09:00, skipping insertion in model container [2024-11-14 05:09:00,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:59" (2/3) ... [2024-11-14 05:09:00,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548f79e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:09:00, skipping insertion in model container [2024-11-14 05:09:00,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:09:00" (3/3) ... [2024-11-14 05:09:00,688 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2024-11-14 05:09:00,713 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:09:00,715 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_unequal.i that has 2 procedures, 30 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2024-11-14 05:09:00,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:09:00,812 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;@744985b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:09:00,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-14 05:09:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.65) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:09:00,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:09:00,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:09:00,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 05:09:00,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:09:00,837 INFO L85 PathProgramCache]: Analyzing trace with hash -504858443, now seen corresponding path program 1 times [2024-11-14 05:09:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:09:00,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553532262] [2024-11-14 05:09:00,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:00,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:09:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:01,350 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:09:01,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:09:01,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553532262] [2024-11-14 05:09:01,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553532262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:09:01,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:09:01,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:09:01,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274802510] [2024-11-14 05:09:01,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:09:01,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:09:01,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:09:01,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:09:01,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:09:01,391 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.65) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:09:01,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:09:01,518 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2024-11-14 05:09:01,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:09:01,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-11-14 05:09:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:09:01,527 INFO L225 Difference]: With dead ends: 59 [2024-11-14 05:09:01,527 INFO L226 Difference]: Without dead ends: 29 [2024-11-14 05:09:01,531 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:09:01,535 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:09:01,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:09:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-14 05:09:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-14 05:09:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.368421052631579) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:09:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-14 05:09:01,584 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 8 [2024-11-14 05:09:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:09:01,585 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-14 05:09:01,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:09:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-14 05:09:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 05:09:01,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:09:01,587 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-14 05:09:01,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:09:01,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 05:09:01,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:09:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash 777564990, now seen corresponding path program 1 times [2024-11-14 05:09:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:09:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823655842] [2024-11-14 05:09:01,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:01,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:09:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:09:01,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:09:01,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823655842] [2024-11-14 05:09:01,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823655842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:09:01,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:09:01,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:09:01,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857400556] [2024-11-14 05:09:01,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:09:01,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:09:01,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:09:01,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:09:01,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:09:01,797 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:09:01,859 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-11-14 05:09:01,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:09:01,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-11-14 05:09:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:09:01,861 INFO L225 Difference]: With dead ends: 29 [2024-11-14 05:09:01,862 INFO L226 Difference]: Without dead ends: 28 [2024-11-14 05:09:01,862 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:09:01,863 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:09:01,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:09:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-14 05:09:01,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-14 05:09:01,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:09:01,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-14 05:09:01,871 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2024-11-14 05:09:01,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:09:01,871 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-14 05:09:01,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-14 05:09:01,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 05:09:01,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:09:01,876 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-11-14 05:09:01,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:09:01,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 05:09:01,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:09:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1665289040, now seen corresponding path program 1 times [2024-11-14 05:09:01,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:09:01,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181025885] [2024-11-14 05:09:01,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:01,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:09:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:09:02,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:09:02,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181025885] [2024-11-14 05:09:02,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181025885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:09:02,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880345342] [2024-11-14 05:09:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:02,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:02,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:09:02,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:09:02,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:09:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:02,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:09:02,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:09:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:09:02,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:09:02,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880345342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:09:02,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:09:02,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-14 05:09:02,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816983094] [2024-11-14 05:09:02,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:09:02,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:09:02,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:09:02,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:09:02,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:09:02,665 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:09:02,754 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-11-14 05:09:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:09:02,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-14 05:09:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:09:02,756 INFO L225 Difference]: With dead ends: 28 [2024-11-14 05:09:02,756 INFO L226 Difference]: Without dead ends: 27 [2024-11-14 05:09:02,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:09:02,757 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:09:02,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:09:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-14 05:09:02,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-11-14 05:09:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 19 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:02,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-11-14 05:09:02,764 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2024-11-14 05:09:02,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:09:02,765 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-11-14 05:09:02,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:02,765 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-11-14 05:09:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 05:09:02,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:09:02,766 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:09:02,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:09:02,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:02,971 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 05:09:02,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:09:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1245971678, now seen corresponding path program 1 times [2024-11-14 05:09:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:09:02,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987163670] [2024-11-14 05:09:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:09:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:09:03,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:09:03,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987163670] [2024-11-14 05:09:03,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987163670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:09:03,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613560240] [2024-11-14 05:09:03,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:03,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:03,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:09:03,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:09:03,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:09:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:03,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:09:03,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:09:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:09:03,456 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:09:03,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613560240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:09:03,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:09:03,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-14 05:09:03,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226293224] [2024-11-14 05:09:03,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:09:03,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:09:03,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:09:03,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:09:03,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:09:03,458 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:09:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:09:03,490 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-11-14 05:09:03,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:09:03,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 18 [2024-11-14 05:09:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:09:03,491 INFO L225 Difference]: With dead ends: 23 [2024-11-14 05:09:03,491 INFO L226 Difference]: Without dead ends: 22 [2024-11-14 05:09:03,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:09:03,492 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:09:03,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:09:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-14 05:09:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-14 05:09:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-14 05:09:03,502 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 18 [2024-11-14 05:09:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:09:03,505 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-14 05:09:03,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:09:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-14 05:09:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:09:03,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:09:03,506 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:09:03,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 05:09:03,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:03,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 05:09:03,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:09:03,707 INFO L85 PathProgramCache]: Analyzing trace with hash 29517134, now seen corresponding path program 1 times [2024-11-14 05:09:03,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:09:03,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325030583] [2024-11-14 05:09:03,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:03,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:09:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:09:03,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:09:03,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325030583] [2024-11-14 05:09:03,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325030583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:09:03,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703427471] [2024-11-14 05:09:03,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:03,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:03,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:09:03,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:09:03,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:09:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:04,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:09:04,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:09:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:09:04,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:09:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:09:04,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703427471] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:09:04,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [838647917] [2024-11-14 05:09:04,223 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 05:09:04,223 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:09:04,227 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:09:04,230 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:09:04,231 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:09:06,519 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 131 for LOIs [2024-11-14 05:09:06,792 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:09:18,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [838647917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:09:18,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:09:18,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [5, 5, 5] total 21 [2024-11-14 05:09:18,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366099508] [2024-11-14 05:09:18,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:09:18,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 05:09:18,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:09:18,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 05:09:18,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:09:18,640 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:21,079 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:09:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:09:25,083 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-11-14 05:09:25,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:09:25,084 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-14 05:09:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:09:25,085 INFO L225 Difference]: With dead ends: 28 [2024-11-14 05:09:25,085 INFO L226 Difference]: Without dead ends: 26 [2024-11-14 05:09:25,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:09:25,086 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:09:25,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 36 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 271 Invalid, 6 Unknown, 0 Unchecked, 6.4s Time] [2024-11-14 05:09:25,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-14 05:09:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-14 05:09:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-14 05:09:25,094 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 19 [2024-11-14 05:09:25,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:09:25,094 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-14 05:09:25,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:25,094 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-14 05:09:25,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:09:25,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:09:25,095 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:09:25,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 05:09:25,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:25,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 05:09:25,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:09:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash 29583731, now seen corresponding path program 1 times [2024-11-14 05:09:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:09:25,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391515592] [2024-11-14 05:09:25,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:25,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:09:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:09:25,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:09:25,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391515592] [2024-11-14 05:09:25,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391515592] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:09:25,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836995102] [2024-11-14 05:09:25,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:25,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:25,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:09:25,503 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:09:25,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:09:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:25,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 05:09:25,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:09:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:09:25,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:09:25,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836995102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:09:25,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:09:25,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-14 05:09:25,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389418315] [2024-11-14 05:09:25,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:09:25,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:09:25,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:09:25,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:09:25,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:09:25,720 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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:09:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:09:25,760 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-11-14 05:09:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:09:25,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 19 [2024-11-14 05:09:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:09:25,762 INFO L225 Difference]: With dead ends: 26 [2024-11-14 05:09:25,764 INFO L226 Difference]: Without dead ends: 23 [2024-11-14 05:09:25,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:09:25,765 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:09:25,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 05:09:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-14 05:09:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-14 05:09:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-11-14 05:09:25,777 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2024-11-14 05:09:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:09:25,777 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-11-14 05:09:25,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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:09:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-11-14 05:09:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:09:25,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:09:25,779 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:09:25,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 05:09:25,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 05:09:25,980 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 05:09:25,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:09:25,980 INFO L85 PathProgramCache]: Analyzing trace with hash -461926521, now seen corresponding path program 1 times [2024-11-14 05:09:25,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:09:25,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935245679] [2024-11-14 05:09:25,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:25,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:09:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:09:26,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:09:26,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935245679] [2024-11-14 05:09:26,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935245679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:09:26,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358353424] [2024-11-14 05:09:26,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:26,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:26,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:09:26,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:09:26,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:09:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:26,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:09:26,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:09:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:09:26,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:09:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:09:26,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358353424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:09:26,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [50338362] [2024-11-14 05:09:26,366 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 05:09:26,366 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:09:26,366 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:09:26,366 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:09:26,366 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:09:27,669 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 131 for LOIs [2024-11-14 05:09:27,929 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:09:34,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [50338362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:09:34,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:09:34,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [5, 5, 5] total 21 [2024-11-14 05:09:34,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999349807] [2024-11-14 05:09:34,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:09:34,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 05:09:34,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:09:34,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 05:09:34,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=372, Unknown=1, NotChecked=0, Total=420 [2024-11-14 05:09:34,930 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:37,865 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:09:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:09:39,484 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-11-14 05:09:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:09:39,485 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-14 05:09:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:09:39,487 INFO L225 Difference]: With dead ends: 23 [2024-11-14 05:09:39,488 INFO L226 Difference]: Without dead ends: 22 [2024-11-14 05:09:39,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=47, Invalid=372, Unknown=1, NotChecked=0, Total=420 [2024-11-14 05:09:39,493 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:09:39,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 8 Unknown, 0 Unchecked, 4.5s Time] [2024-11-14 05:09:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-14 05:09:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-14 05:09:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-14 05:09:39,521 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 23 [2024-11-14 05:09:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:09:39,522 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-14 05:09:39,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:09:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-14 05:09:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:09:39,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:09:39,524 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:09:39,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 05:09:39,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:39,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 05:09:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:09:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1434820185, now seen corresponding path program 1 times [2024-11-14 05:09:39,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:09:39,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953809855] [2024-11-14 05:09:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:09:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:09:39,931 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:09:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953809855] [2024-11-14 05:09:39,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953809855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:09:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325411314] [2024-11-14 05:09:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:39,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:39,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:09:39,935 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:09:39,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:09:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:40,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:09:40,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:09:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:09:40,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:09:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:09:40,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325411314] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:09:40,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1652998220] [2024-11-14 05:09:40,180 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 05:09:40,180 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:09:40,180 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:09:40,180 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:09:40,180 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:09:41,205 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 131 for LOIs [2024-11-14 05:09:41,317 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:09:47,708 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1147#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:09:47,708 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:09:47,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:09:47,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-14 05:09:47,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260637804] [2024-11-14 05:09:47,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:09:47,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:09:47,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:09:47,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:09:47,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:09:47,710 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:09:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:09:47,777 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-14 05:09:47,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:09:47,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-11-14 05:09:47,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:09:47,781 INFO L225 Difference]: With dead ends: 42 [2024-11-14 05:09:47,781 INFO L226 Difference]: Without dead ends: 27 [2024-11-14 05:09:47,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:09:47,782 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:09:47,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:09:47,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-14 05:09:47,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-14 05:09:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:09:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-14 05:09:47,799 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2024-11-14 05:09:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:09:47,799 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-14 05:09:47,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:09:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-14 05:09:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:09:47,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:09:47,800 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:09:47,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 05:09:48,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:48,001 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 05:09:48,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:09:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1105302992, now seen corresponding path program 2 times [2024-11-14 05:09:48,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:09:48,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203962472] [2024-11-14 05:09:48,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:48,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:09:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:09:48,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:09:48,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203962472] [2024-11-14 05:09:48,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203962472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:09:48,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610018048] [2024-11-14 05:09:48,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:09:48,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:48,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:09:48,224 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:09:48,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:09:48,412 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 05:09:48,412 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:09:48,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 05:09:48,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:09:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:09:48,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:09:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:09:48,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610018048] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:09:48,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1643990453] [2024-11-14 05:09:48,524 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 05:09:48,525 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:09:48,525 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:09:48,525 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:09:48,525 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:09:49,536 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 131 for LOIs [2024-11-14 05:09:49,666 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:09:55,859 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1454#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:09:55,859 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:09:55,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:09:55,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-14 05:09:55,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685169999] [2024-11-14 05:09:55,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:09:55,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 05:09:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:09:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 05:09:55,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:09:55,861 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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:09:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:09:55,933 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-14 05:09:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:09:55,933 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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 32 [2024-11-14 05:09:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:09:55,934 INFO L225 Difference]: With dead ends: 40 [2024-11-14 05:09:55,934 INFO L226 Difference]: Without dead ends: 39 [2024-11-14 05:09:55,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-11-14 05:09:55,936 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:09:55,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:09:55,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-14 05:09:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-14 05:09:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:09:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-11-14 05:09:55,952 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2024-11-14 05:09:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:09:55,953 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-14 05:09:55,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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:09:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-14 05:09:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 05:09:55,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:09:55,954 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:09:55,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 05:09:56,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:56,155 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 05:09:56,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:09:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash 442463845, now seen corresponding path program 3 times [2024-11-14 05:09:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:09:56,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991817191] [2024-11-14 05:09:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:09:56,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:09:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:09:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:09:56,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:09:56,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991817191] [2024-11-14 05:09:56,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991817191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:09:56,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028898846] [2024-11-14 05:09:56,556 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:09:56,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:09:56,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:09:56,559 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:09:56,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:09:57,326 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:09:57,327 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:09:57,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 05:09:57,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:09:57,379 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:09:57,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:09:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:09:57,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028898846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:09:57,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [673767152] [2024-11-14 05:09:57,556 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 05:09:57,556 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:09:57,556 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:09:57,556 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:09:57,556 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:09:58,332 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 114 for LOIs [2024-11-14 05:09:58,466 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:10:02,632 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1856#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:10:02,632 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:10:02,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:10:02,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2024-11-14 05:10:02,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410309297] [2024-11-14 05:10:02,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:10:02,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:10:02,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:10:02,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:10:02,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2024-11-14 05:10:02,635 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 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:10:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:10:02,770 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-14 05:10:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 05:10:02,770 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 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 44 [2024-11-14 05:10:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:10:02,771 INFO L225 Difference]: With dead ends: 64 [2024-11-14 05:10:02,771 INFO L226 Difference]: Without dead ends: 63 [2024-11-14 05:10:02,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2024-11-14 05:10:02,773 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:10:02,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:10:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-14 05:10:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-14 05:10:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:10:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2024-11-14 05:10:02,798 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 44 [2024-11-14 05:10:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:10:02,799 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2024-11-14 05:10:02,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 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:10:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2024-11-14 05:10:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-14 05:10:02,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:10:02,800 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:10:02,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:10:03,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 05:10:03,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 05:10:03,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:10:03,002 INFO L85 PathProgramCache]: Analyzing trace with hash 762042447, now seen corresponding path program 4 times [2024-11-14 05:10:03,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:10:03,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980645333] [2024-11-14 05:10:03,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:10:03,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:10:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:10:03,766 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:10:03,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:10:03,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980645333] [2024-11-14 05:10:03,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980645333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:10:03,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962974204] [2024-11-14 05:10:03,767 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 05:10:03,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:10:03,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:10:03,769 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:10:03,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:10:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:10:03,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 05:10:03,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:10:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:10:04,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:10:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:10:04,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962974204] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:10:04,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [999948102] [2024-11-14 05:10:04,662 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 05:10:04,663 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:10:04,663 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:10:04,663 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:10:04,663 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:10:05,384 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 114 for LOIs [2024-11-14 05:10:05,521 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:10:09,640 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2485#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:10:09,640 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:10:09,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:10:09,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2024-11-14 05:10:09,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105574959] [2024-11-14 05:10:09,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:10:09,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-14 05:10:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:10:09,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-14 05:10:09,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=3142, Unknown=0, NotChecked=0, Total=3782 [2024-11-14 05:10:09,644 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 48 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 48 states have internal predecessors, (104), 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:10:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:10:09,850 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2024-11-14 05:10:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-14 05:10:09,850 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 48 states have internal predecessors, (104), 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 68 [2024-11-14 05:10:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:10:09,852 INFO L225 Difference]: With dead ends: 112 [2024-11-14 05:10:09,852 INFO L226 Difference]: Without dead ends: 111 [2024-11-14 05:10:09,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1768 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=640, Invalid=3142, Unknown=0, NotChecked=0, Total=3782 [2024-11-14 05:10:09,856 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:10:09,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:10:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-14 05:10:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-14 05:10:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:10:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2024-11-14 05:10:09,900 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 68 [2024-11-14 05:10:09,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:10:09,901 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2024-11-14 05:10:09,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 48 states have internal predecessors, (104), 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:10:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2024-11-14 05:10:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-14 05:10:09,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:10:09,905 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:10:09,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 05:10:10,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:10:10,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 05:10:10,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:10:10,107 INFO L85 PathProgramCache]: Analyzing trace with hash -474589, now seen corresponding path program 5 times [2024-11-14 05:10:10,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:10:10,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811321852] [2024-11-14 05:10:10,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:10:10,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:10:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:10:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:10:12,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:10:12,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811321852] [2024-11-14 05:10:12,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811321852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:10:12,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128906487] [2024-11-14 05:10:12,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:10:12,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:10:12,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:10:12,110 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:10:12,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 05:10:13,355 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-14 05:10:13,355 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:10:13,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-14 05:10:13,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:10:13,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 05:10:13,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:10:13,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 05:10:13,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:10:13,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 05:10:13,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-14 05:10:14,014 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 05:10:14,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 05:10:14,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 05:10:14,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 05:10:14,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-14 05:10:14,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-14 05:10:14,544 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 05:10:14,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 56 [2024-11-14 05:10:14,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:10:14,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:10:14,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2024-11-14 05:10:14,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 05:10:14,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:10:14,788 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-14 05:10:14,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 119 treesize of output 92 [2024-11-14 05:10:14,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:10:14,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:10:14,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:10:14,842 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-14 05:10:14,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 81 [2024-11-14 05:10:14,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-14 05:10:14,908 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:10:14,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2024-11-14 05:10:14,953 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 05:10:14,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-14 05:10:15,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:10:15,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:10:15,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:10:15,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 72 [2024-11-14 05:10:15,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:10:15,211 INFO L349 Elim1Store]: treesize reduction 188, result has 7.4 percent of original size [2024-11-14 05:10:15,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 184 treesize of output 93 [2024-11-14 05:10:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 190 proven. 17 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2024-11-14 05:10:55,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:11:15,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (and (forall ((|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int)) (= (let ((.cse8 (+ |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4))) (let ((.cse0 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store .cse11 .cse8 .cse12)))) (store .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)))) (.cse1 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store .cse7 .cse8 .cse9)))) (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))))) (let ((.cse4 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse1 .cse4) .cse5)) (.cse3 (+ (select (select .cse0 .cse4) .cse5) 4))) (select (select .cse0 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))))) 0)) (forall ((|ULTIMATE.start_sll_prepend_#t~ret7#1.offset| Int)) (= (let ((.cse20 (+ |ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 4))) (let ((.cse16 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store .cse11 .cse20 .cse12)))) (store .cse21 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)))) (.cse13 (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| (store .cse7 .cse20 .cse9)))) (store .cse19 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse19 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))))) (let ((.cse17 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (+ (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse14 (select (select .cse13 .cse17) .cse18)) (.cse15 (+ (select (select .cse16 .cse17) .cse18) 4))) (select (select .cse13 (select (select .cse13 .cse14) .cse15)) (+ (select (select .cse16 .cse14) .cse15) 4)))))) 0)))) is different from false [2024-11-14 05:11:16,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128906487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:11:16,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1446598659] [2024-11-14 05:11:16,471 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 05:11:16,472 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:11:16,472 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:11:16,472 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:11:16,472 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:11:17,542 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 131 for LOIs [2024-11-14 05:11:17,716 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:12:33,314 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3488#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-14 05:12:33,314 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:12:33,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:12:33,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 22] total 68 [2024-11-14 05:12:33,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469443743] [2024-11-14 05:12:33,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:12:33,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-14 05:12:33,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:12:33,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-14 05:12:33,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=6927, Unknown=20, NotChecked=172, Total=7832 [2024-11-14 05:12:33,320 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand has 68 states, 64 states have (on average 2.09375) internal successors, (134), 64 states have internal predecessors, (134), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-14 05:12:35,582 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:12:37,656 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:12:39,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:12:41,938 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:12:43,979 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:12:46,038 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:12:48,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:12:50,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:12:51,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:12:53,980 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:12:56,034 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:12:58,225 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:13:00,294 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:13:02,366 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:13:04,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:13:06,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:13:08,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:13:10,746 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:13:12,799 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:13:14,843 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:13:17,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:13:19,172 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:13:21,259 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:13:23,309 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:13:25,430 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:13:27,563 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:13:34,229 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:13:36,277 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:13:38,331 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:13:40,517 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:13:42,571 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:13:44,684 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:13:46,729 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:13:48,780 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:13:50,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:13:52,954 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:13:59,502 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:14:04,209 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:14:08,645 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:14:10,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=false, quantifiers [0] [2024-11-14 05:14:12,985 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:14:15,174 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:14:19,700 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:14:21,768 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:14:24,672 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:14:26,696 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:14:28,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:14:30,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:14:32,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:14:34,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:14:36,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:14:38,987 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:14:40,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:14:42,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:14:44,782 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:14:46,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:14:48,907 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:14:50,979 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:14:53,072 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:14:55,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:14:57,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:14:57,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:14:57,924 INFO L93 Difference]: Finished difference Result 218 states and 226 transitions. [2024-11-14 05:14:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-14 05:14:57,925 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 64 states have (on average 2.09375) internal successors, (134), 64 states have internal predecessors, (134), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 116 [2024-11-14 05:14:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:14:57,926 INFO L225 Difference]: With dead ends: 218 [2024-11-14 05:14:57,926 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 05:14:57,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2778 ImplicationChecksByTransitivity, 154.8s TimeCoverageRelationStatistics Valid=899, Invalid=8205, Unknown=20, NotChecked=188, Total=9312 [2024-11-14 05:14:57,932 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 6 mSolverCounterUnsat, 58 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 125.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 58 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 127.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:14:57,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 259 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 572 Invalid, 58 Unknown, 0 Unchecked, 127.5s Time] [2024-11-14 05:14:57,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 05:14:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-11-14 05:14:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 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:14:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2024-11-14 05:14:57,991 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 116 [2024-11-14 05:14:57,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:14:57,992 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2024-11-14 05:14:57,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 64 states have (on average 2.09375) internal successors, (134), 64 states have internal predecessors, (134), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-14 05:14:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2024-11-14 05:14:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-14 05:14:57,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:14:57,998 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 23, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:14:58,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 05:14:58,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:14:58,199 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-14 05:14:58,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:14:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1708895725, now seen corresponding path program 6 times [2024-11-14 05:14:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:14:58,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287810692] [2024-11-14 05:14:58,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:14:58,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:14:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:14:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2024-11-14 05:14:58,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:14:58,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287810692] [2024-11-14 05:14:58,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287810692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:14:58,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74137992] [2024-11-14 05:14:58,636 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:14:58,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:14:58,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:14:58,639 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:14:58,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 05:14:59,854 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:14:59,854 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:14:59,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:14:59,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:15:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2024-11-14 05:15:00,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:15:00,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74137992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:15:00,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:15:00,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-11-14 05:15:00,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470096363] [2024-11-14 05:15:00,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:15:00,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:15:00,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:15:00,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:15:00,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:15:00,004 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:15:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:15:00,161 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2024-11-14 05:15:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:15:00,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 128 [2024-11-14 05:15:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:15:00,162 INFO L225 Difference]: With dead ends: 123 [2024-11-14 05:15:00,162 INFO L226 Difference]: Without dead ends: 0 [2024-11-14 05:15:00,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:15:00,163 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:15:00,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:15:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-14 05:15:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-14 05:15:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:15:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-14 05:15:00,165 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2024-11-14 05:15:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:15:00,165 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-14 05:15:00,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:15:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-14 05:15:00,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-14 05:15:00,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-14 05:15:00,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-14 05:15:00,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-14 05:15:00,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-14 05:15:00,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-14 05:15:00,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-14 05:15:00,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 05:15:00,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 05:15:00,377 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:15:00,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-14 05:16:29,470 WARN L286 SmtUtils]: Spent 1.48m on a formula simplification. DAG size of input: 325 DAG size of output: 281 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-14 05:18:43,531 WARN L286 SmtUtils]: Spent 2.23m on a formula simplification. DAG size of input: 356 DAG size of output: 355 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-14 05:20:42,332 WARN L286 SmtUtils]: Spent 1.96m on a formula simplification. DAG size of input: 418 DAG size of output: 392 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-14 05:20:43,778 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 05:20:43,824 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,826 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-14 05:20:43,826 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-14 05:20:43,826 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,826 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-14 05:20:43,826 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-14 05:20:43,827 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:43,827 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-14 05:20:43,827 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-14 05:20:43,827 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-14 05:20:43,828 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-14 05:20:43,828 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-14 05:20:43,828 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-14 05:20:43,828 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-14 05:20:43,828 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-14 05:20:43,828 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-14 05:20:43,829 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-14 05:20:43,829 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-14 05:20:43,829 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:43,833 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,833 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-14 05:20:43,833 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-14 05:20:43,833 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,834 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-14 05:20:43,834 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-14 05:20:43,834 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-14 05:20:43,834 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-14 05:20:43,834 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-14 05:20:43,834 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-14 05:20:43,834 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-14 05:20:43,835 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-14 05:20:43,835 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-14 05:20:43,835 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-14 05:20:43,835 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-14 05:20:43,835 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-14 05:20:43,835 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-14 05:20:43,835 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:43,835 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,835 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-14 05:20:43,835 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-14 05:20:43,836 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-14 05:20:43,836 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-14 05:20:43,836 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:43,836 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-14 05:20:43,837 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-14 05:20:43,837 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-14 05:20:43,837 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-14 05:20:43,838 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-14 05:20:43,838 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-14 05:20:43,838 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2024-11-14 05:20:43,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-14 05:20:43,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-14 05:20:43,839 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:43,843 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:43,847 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,848 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-14 05:20:43,848 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-14 05:20:43,848 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2024-11-14 05:20:43,849 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-14 05:20:43,849 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-14 05:20:43,849 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-14 05:20:43,849 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-14 05:20:43,849 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-14 05:20:43,849 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-14 05:20:43,849 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-14 05:20:43,849 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,850 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-14 05:20:43,850 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,850 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-14 05:20:43,850 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-14 05:20:43,850 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:43,851 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-14 05:20:43,851 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,851 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-14 05:20:43,851 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-14 05:20:43,851 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2024-11-14 05:20:43,851 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-14 05:20:43,851 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-14 05:20:43,851 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-14 05:20:43,851 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-14 05:20:43,851 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,851 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-14 05:20:43,852 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-14 05:20:43,853 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,853 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-14 05:20:43,853 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:43,854 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-14 05:20:43,854 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-14 05:20:43,854 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-14 05:20:43,854 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-14 05:20:43,854 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:43,855 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2024-11-14 05:20:43,855 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2024-11-14 05:20:43,855 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] [2024-11-14 05:20:43,855 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,855 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-14 05:20:43,855 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-14 05:20:43,855 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-14 05:20:43,855 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,856 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!base [2024-11-14 05:20:43,856 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:43,856 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-14 05:20:43,856 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-14 05:20:43,856 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-14 05:20:43,856 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-14 05:20:43,856 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-14 05:20:43,856 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:43,962 WARN L162 FloydHoareUtils]: Requires clause for node_create contained old-variable. Original clause: (let ((.cse40 (select |old(#memory_int)| 1))) (let ((.cse2 (<= 1 |#StackHeapBarrier|)) (.cse27 (= |node_create_#in~data#1| 1)) (.cse8 (+ |#StackHeapBarrier| 1)) (.cse26 (= (select .cse40 0) 48)) (.cse25 (= (select .cse40 1) 0))) (let ((.cse0 (exists ((|v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse37 (= |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11| 1))) (and (let ((.cse34 (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_10| 1)) (.cse35 (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| 0)) (.cse36 (= |v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_7| 0)) (.cse38 (<= 2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|)) (.cse39 (= |v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_12| 2))) (or (and .cse2 .cse27 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (and .cse2 .cse27 (= |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| 0) .cse34 .cse35 .cse36 .cse38 .cse39))) (or (and (exists ((|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| (store (select |v_#memory_$Pointer$.offset_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4 0)) |old(#memory_$Pointer$.offset)|)) .cse37 (exists ((|v_#memory_int_72| (Array Int (Array Int Int)))) (= |old(#memory_int)| (store |v_#memory_int_72| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| (store (select |v_#memory_int_72| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4))))) (exists ((|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| (store (select |v_#memory_$Pointer$.base_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4))) |old(#memory_$Pointer$.base)|))) (and (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) .cse26 (exists ((|v_#length_22| (Array Int Int))) (and (= (select |v_#length_22| 1) 2) (= |old(#length)| (store |v_#length_22| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| 4)) (= (select |v_#length_22| 2) 24))) .cse25 (exists ((|v_#valid_34| (Array Int Int))) (and (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_34| 2) 1) (= |old(#valid)| (store |v_#valid_34| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| 1)) (= (select |v_#valid_34| 1) 1) (= (select |v_#valid_34| 0) 0))) (= 2 |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11|))))))) (.cse4 (exists ((|v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_14| Int)) (let ((.cse29 (= |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20| 1)) (.cse28 (= 2 |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20|))) (and (or (and .cse28 (exists ((|v_#valid_45| (Array Int Int))) (and (= |old(#valid)| (store |v_#valid_45| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 1)) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|) 0) (= (select |v_#valid_45| 1) 1) (= (select |v_#valid_45| 2) 1) (= (select |v_#valid_45| 0) 0))) .cse26 (exists ((|v_#length_33| (Array Int Int))) (and (= 2 (select |v_#length_33| 1)) (= (select |v_#length_33| 2) 24) (= |old(#length)| (store |v_#length_33| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 4)))) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|) .cse25) (and (exists ((|v_#memory_int_100| (Array Int (Array Int Int)))) (= |old(#memory_int)| (store |v_#memory_int_100| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_int_100| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4))))) (exists ((|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int)))) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_$Pointer$.offset_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4 0)))) (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_$Pointer$.base_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4))) |old(#memory_$Pointer$.base)|)) .cse29)) (let ((.cse30 (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_20| 1)) (.cse31 (= |v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_14| 0)) (.cse32 (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_20| 0)) (.cse33 (= |v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_24| 2))) (or (and .cse30 .cse2 .cse31 .cse27 .cse32 (<= 2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|) .cse29 .cse33) (and .cse30 .cse2 .cse31 .cse27 .cse28 .cse32 .cse33 (= |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| 0)))))))) (.cse1 (= 5 |node_create_#in~data#1|))) (and (or .cse0 .cse1) (or (and .cse2 (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int))) (|v_#memory_int_100| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_64| .cse3 (store (select |v_#memory_$Pointer$.offset_64| .cse3) 4 0))) (= (store |v_#memory_int_100| .cse3 (store (select |v_#memory_int_100| .cse3) 4 (select (select |old(#memory_int)| .cse3) 4))) |old(#memory_int)|) (<= 2 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_4|) (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (store |v_#memory_$Pointer$.base_64| .cse3 (store (select |v_#memory_$Pointer$.base_64| .cse3) 4 (select (select |old(#memory_$Pointer$.base)| .cse3) 4))) |old(#memory_$Pointer$.base)|)))) .cse1) .cse4) (let ((.cse7 (not .cse1)) (.cse16 (not .cse27)) (.cse17 (< |#StackHeapBarrier| 1)) (.cse9 (not .cse26)) (.cse10 (not .cse25))) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (let ((.cse5 (= |old(#length)| |#length|)) (.cse6 (= |#memory_int| |old(#memory_int)|))) (or (and .cse5 .cse0 .cse6) (and .cse5 .cse6 .cse1))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse1 .cse4) (= |old(#valid)| |#valid|)) (and .cse7 (forall ((|v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse11 (not (= |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11| 1)))) (or (and (or (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| .cse8) (not (= 2 |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11|)) .cse9 .cse10 (forall ((|v_#length_22| (Array Int Int))) (or (not (= |old(#length)| (store |v_#length_22| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| 4))) (not (= (select |v_#length_22| 2) 24)) (not (= (select |v_#length_22| 1) 2)))) (forall ((|v_#valid_34| (Array Int Int))) (or (not (= (select |v_#valid_34| 2) 1)) (not (= |old(#valid)| (store |v_#valid_34| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| 1))) (not (= (select |v_#valid_34| 0) 0)) (not (= (select |v_#valid_34| 1) 1)) (not (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) 0))))) (or (forall ((|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int)))) (not (= (store |v_#memory_$Pointer$.offset_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| (store (select |v_#memory_$Pointer$.offset_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4 0)) |old(#memory_$Pointer$.offset)|))) (forall ((|v_#memory_int_72| (Array Int (Array Int Int)))) (not (= |old(#memory_int)| (store |v_#memory_int_72| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| (store (select |v_#memory_int_72| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4)))))) (forall ((|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (not (= (store |v_#memory_$Pointer$.base_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| (store (select |v_#memory_$Pointer$.base_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4))) |old(#memory_$Pointer$.base)|))) .cse11)) (let ((.cse12 (not (= |v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_7| 0))) (.cse13 (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| 0))) (.cse14 (not (= |v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_12| 2))) (.cse15 (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| 2)) (.cse18 (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_10| 1)))) (and (or .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| 0)) .cse18) (or .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse11))))))) (and .cse7 (forall ((|v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_14| Int)) (let ((.cse23 (not (= 2 |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20|))) (.cse24 (not (= |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20| 1)))) (or (let ((.cse19 (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_20| 1))) (.cse20 (not (= |v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_14| 0))) (.cse21 (not (= |v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_24| 2))) (.cse22 (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_20| 0)))) (and (or .cse19 .cse20 .cse16 .cse21 .cse17 .cse22 (not (= |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| 0)) .cse23) (or .cse19 .cse20 .cse24 (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 2) .cse16 .cse21 .cse17 .cse22))) (and (or (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| .cse8) (forall ((|v_#valid_45| (Array Int Int))) (or (not (= (select |v_#valid_45| 2) 1)) (not (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|) 0)) (not (= |old(#valid)| (store |v_#valid_45| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 1))) (not (= (select |v_#valid_45| 0) 0)) (not (= (select |v_#valid_45| 1) 1)))) .cse9 .cse10 (forall ((|v_#length_33| (Array Int Int))) (or (not (= (select |v_#length_33| 2) 24)) (not (= 2 (select |v_#length_33| 1))) (not (= |old(#length)| (store |v_#length_33| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 4))))) .cse23) (or .cse24 (forall ((|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int)))) (not (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_$Pointer$.offset_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4 0))))) (forall ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int)))) (not (= (store |v_#memory_$Pointer$.base_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_$Pointer$.base_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4))) |old(#memory_$Pointer$.base)|))) (forall ((|v_#memory_int_100| (Array Int (Array Int Int)))) (not (= |old(#memory_int)| (store |v_#memory_int_100| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_int_100| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4)))))))))))))))))) Eliminated clause: (exists ((|old(#valid)| (Array Int Int)) (|old(#length)| (Array Int Int)) (|old(#memory_int)| (Array Int (Array Int Int))) (|old(#memory_$Pointer$.offset)| (Array Int (Array Int Int))) (|old(#memory_$Pointer$.base)| (Array Int (Array Int Int)))) (let ((.cse39 (select |old(#memory_int)| 1))) (let ((.cse25 (<= 1 |#StackHeapBarrier|)) (.cse24 (= |node_create_#in~data#1| 1)) (.cse1 (+ |#StackHeapBarrier| 1)) (.cse23 (= (select .cse39 0) 48)) (.cse22 (= (select .cse39 1) 0))) (let ((.cse19 (exists ((|v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse36 (= |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11| 1))) (and (let ((.cse33 (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_10| 1)) (.cse34 (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| 0)) (.cse35 (= |v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_7| 0)) (.cse37 (<= 2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|)) (.cse38 (= |v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_12| 2))) (or (and .cse25 .cse24 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (and .cse25 .cse24 (= |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| 0) .cse33 .cse34 .cse35 .cse37 .cse38))) (or (and (exists ((|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| (store (select |v_#memory_$Pointer$.offset_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4 0)) |old(#memory_$Pointer$.offset)|)) .cse36 (exists ((|v_#memory_int_72| (Array Int (Array Int Int)))) (= |old(#memory_int)| (store |v_#memory_int_72| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| (store (select |v_#memory_int_72| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4))))) (exists ((|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| (store (select |v_#memory_$Pointer$.base_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4))) |old(#memory_$Pointer$.base)|))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) .cse23 (exists ((|v_#length_22| (Array Int Int))) (and (= (select |v_#length_22| 1) 2) (= |old(#length)| (store |v_#length_22| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| 4)) (= (select |v_#length_22| 2) 24))) .cse22 (exists ((|v_#valid_34| (Array Int Int))) (and (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) 0) (= (select |v_#valid_34| 2) 1) (= |old(#valid)| (store |v_#valid_34| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| 1)) (= (select |v_#valid_34| 1) 1) (= (select |v_#valid_34| 0) 0))) (= 2 |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11|))))))) (.cse21 (= 5 |node_create_#in~data#1|))) (and (let ((.cse0 (not .cse21)) (.cse9 (not .cse24)) (.cse10 (< |#StackHeapBarrier| 1)) (.cse2 (not .cse23)) (.cse3 (not .cse22))) (or (and .cse0 (forall ((|v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse4 (not (= |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11| 1)))) (or (and (or (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| .cse1) (not (= 2 |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_11|)) .cse2 .cse3 (forall ((|v_#length_22| (Array Int Int))) (or (not (= |old(#length)| (store |v_#length_22| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| 4))) (not (= (select |v_#length_22| 2) 24)) (not (= (select |v_#length_22| 1) 2)))) (forall ((|v_#valid_34| (Array Int Int))) (or (not (= (select |v_#valid_34| 2) 1)) (not (= |old(#valid)| (store |v_#valid_34| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| 1))) (not (= (select |v_#valid_34| 0) 0)) (not (= (select |v_#valid_34| 1) 1)) (not (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) 0))))) (or (forall ((|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int)))) (not (= (store |v_#memory_$Pointer$.offset_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| (store (select |v_#memory_$Pointer$.offset_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4 0)) |old(#memory_$Pointer$.offset)|))) (forall ((|v_#memory_int_72| (Array Int (Array Int Int)))) (not (= |old(#memory_int)| (store |v_#memory_int_72| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| (store (select |v_#memory_int_72| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4)))))) (forall ((|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (not (= (store |v_#memory_$Pointer$.base_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| (store (select |v_#memory_$Pointer$.base_48| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7|) 4))) |old(#memory_$Pointer$.base)|))) .cse4)) (let ((.cse5 (not (= |v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_7| 0))) (.cse6 (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| 0))) (.cse7 (not (= |v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_12| 2))) (.cse8 (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| 2)) (.cse11 (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_10| 1)))) (and (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_7| 0)) .cse11) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse4))))))) (and .cse0 (forall ((|v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_14| Int)) (let ((.cse16 (not (= 2 |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20|))) (.cse17 (not (= |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20| 1)))) (or (let ((.cse12 (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_20| 1))) (.cse13 (not (= |v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_14| 0))) (.cse14 (not (= |v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_24| 2))) (.cse15 (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_20| 0)))) (and (or .cse12 .cse13 .cse9 .cse14 .cse10 .cse15 (not (= |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| 0)) .cse16) (or .cse12 .cse13 .cse17 (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 2) .cse9 .cse14 .cse10 .cse15))) (and (or (< |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| .cse1) (forall ((|v_#valid_45| (Array Int Int))) (or (not (= (select |v_#valid_45| 2) 1)) (not (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|) 0)) (not (= |old(#valid)| (store |v_#valid_45| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 1))) (not (= (select |v_#valid_45| 0) 0)) (not (= (select |v_#valid_45| 1) 1)))) .cse2 .cse3 (forall ((|v_#length_33| (Array Int Int))) (or (not (= (select |v_#length_33| 2) 24)) (not (= 2 (select |v_#length_33| 1))) (not (= |old(#length)| (store |v_#length_33| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 4))))) .cse16) (or .cse17 (forall ((|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int)))) (not (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_$Pointer$.offset_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4 0))))) (forall ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int)))) (not (= (store |v_#memory_$Pointer$.base_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_$Pointer$.base_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4))) |old(#memory_$Pointer$.base)|))) (forall ((|v_#memory_int_100| (Array Int (Array Int Int)))) (not (= |old(#memory_int)| (store |v_#memory_int_100| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_int_100| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4)))))))))))) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (let ((.cse18 (= |old(#length)| |#length|)) (.cse20 (= |#memory_int| |old(#memory_int)|))) (or (and .cse18 .cse19 .cse20) (and .cse18 .cse20 .cse21))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)))) (or .cse19 .cse21) (or (and .cse25 (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int))) (|v_#memory_int_100| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse26 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_4|) 0))) (and (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_64| .cse26 (store (select |v_#memory_$Pointer$.offset_64| .cse26) 4 0))) (= (store |v_#memory_int_100| .cse26 (store (select |v_#memory_int_100| .cse26) 4 (select (select |old(#memory_int)| .cse26) 4))) |old(#memory_int)|) (<= 2 |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_4|) (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (store |v_#memory_$Pointer$.base_64| .cse26 (store (select |v_#memory_$Pointer$.base_64| .cse26) 4 (select (select |old(#memory_$Pointer$.base)| .cse26) 4))) |old(#memory_$Pointer$.base)|)))) .cse21) (exists ((|v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_14| Int)) (let ((.cse28 (= |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20| 1)) (.cse27 (= 2 |v_ULTIMATE.start_sll_create_~len#1_BEFORE_CALL_20|))) (and (or (and .cse27 (exists ((|v_#valid_45| (Array Int Int))) (and (= |old(#valid)| (store |v_#valid_45| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 1)) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|) 0) (= (select |v_#valid_45| 1) 1) (= (select |v_#valid_45| 2) 1) (= (select |v_#valid_45| 0) 0))) .cse23 (exists ((|v_#length_33| (Array Int Int))) (and (= 2 (select |v_#length_33| 1)) (= (select |v_#length_33| 2) 24) (= |old(#length)| (store |v_#length_33| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20| 4)))) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|) .cse22) (and (exists ((|v_#memory_int_100| (Array Int (Array Int Int)))) (= |old(#memory_int)| (store |v_#memory_int_100| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_int_100| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4 (select (select |old(#memory_int)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4))))) (exists ((|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int)))) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_$Pointer$.offset_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4 0)))) (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| (store (select |v_#memory_$Pointer$.base_64| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4 (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14|) 4))) |old(#memory_$Pointer$.base)|)) .cse28)) (let ((.cse29 (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_20| 1)) (.cse30 (= |v_ULTIMATE.start_sll_create_~head~0#1.offset_BEFORE_CALL_14| 0)) (.cse31 (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_20| 0)) (.cse32 (= |v_ULTIMATE.start_main_~len~0#1_BEFORE_CALL_24| 2))) (or (and .cse29 .cse25 .cse30 .cse24 .cse31 (<= 2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_20|) .cse28 .cse32) (and .cse29 .cse25 .cse30 .cse24 .cse27 .cse31 .cse32 (= |v_ULTIMATE.start_sll_create_~head~0#1.base_BEFORE_CALL_14| 0))))))))))))) [2024-11-14 05:20:44,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:44,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:44,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:44,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:44,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:44,133 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-14 05:20:44,134 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-14 05:20:44,134 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-14 05:20:44,134 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:44,134 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-14 05:20:44,134 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-14 05:20:44,136 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL [2024-11-14 05:20:44,137 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID [2024-11-14 05:20:44,137 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID [2024-11-14 05:20:44,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:20:44 BoogieIcfgContainer [2024-11-14 05:20:44,142 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 05:20:44,143 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 05:20:44,143 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 05:20:44,143 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 05:20:44,144 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:09:00" (3/4) ... [2024-11-14 05:20:44,147 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-14 05:20:44,154 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-11-14 05:20:44,163 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-14 05:20:44,165 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-14 05:20:44,166 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-14 05:20:44,166 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-14 05:20:44,293 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 05:20:44,294 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/witness.yml [2024-11-14 05:20:44,294 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 05:20:44,296 INFO L158 Benchmark]: Toolchain (without parser) took 704938.40ms. Allocated memory was 117.4MB in the beginning and 645.9MB in the end (delta: 528.5MB). Free memory was 90.9MB in the beginning and 457.6MB in the end (delta: -366.8MB). Peak memory consumption was 163.2MB. Max. memory is 16.1GB. [2024-11-14 05:20:44,297 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:20:44,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.73ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 73.0MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:20:44,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.85ms. Allocated memory is still 117.4MB. Free memory was 73.0MB in the beginning and 71.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 05:20:44,298 INFO L158 Benchmark]: Boogie Preprocessor took 36.45ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 70.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:20:44,299 INFO L158 Benchmark]: RCFGBuilder took 655.98ms. Allocated memory is still 117.4MB. Free memory was 70.0MB in the beginning and 51.8MB in the end (delta: 18.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 05:20:44,300 INFO L158 Benchmark]: TraceAbstraction took 703468.41ms. Allocated memory was 117.4MB in the beginning and 645.9MB in the end (delta: 528.5MB). Free memory was 51.2MB in the beginning and 461.9MB in the end (delta: -410.7MB). Peak memory consumption was 360.2MB. Max. memory is 16.1GB. [2024-11-14 05:20:44,300 INFO L158 Benchmark]: Witness Printer took 151.61ms. Allocated memory is still 645.9MB. Free memory was 461.9MB in the beginning and 457.6MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:20:44,303 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 553.73ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 73.0MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.85ms. Allocated memory is still 117.4MB. Free memory was 73.0MB in the beginning and 71.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.45ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 70.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 655.98ms. Allocated memory is still 117.4MB. Free memory was 70.0MB in the beginning and 51.8MB in the end (delta: 18.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 703468.41ms. Allocated memory was 117.4MB in the beginning and 645.9MB in the end (delta: 528.5MB). Free memory was 51.2MB in the beginning and 461.9MB in the end (delta: -410.7MB). Peak memory consumption was 360.2MB. Max. memory is 16.1GB. * Witness Printer took 151.61ms. Allocated memory is still 645.9MB. Free memory was 461.9MB in the beginning and 457.6MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IntegerLiteral[1]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_ALL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PID - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~P_PGID * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 624]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 624]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 359.6s, OverallIterations: 13, TraceHistogramMax: 24, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 156.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 72 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 139.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 824 SdHoareTripleChecker+Invalid, 136.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 663 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1499 IncrementalHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 161 mSDtfsCounter, 1499 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1259 GetRequests, 947 SyntacticMatches, 13 SemanticMatches, 299 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5704 ImplicationChecksByTransitivity, 196.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=12, InterpolantAutomatonStates: 208, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 69.9s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 980 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1220 ConstructedInterpolants, 6 QuantifiedInterpolants, 4650 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3891 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 3525/5368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 4.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 39, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 58, TOOLS_POST_TIME: 1.9s, TOOLS_POST_CALL_APPLICATIONS: 20, TOOLS_POST_CALL_TIME: 0.5s, TOOLS_POST_RETURN_APPLICATIONS: 16, TOOLS_POST_RETURN_TIME: 0.7s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 94, TOOLS_QUANTIFIERELIM_TIME: 3.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 134, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 21, DOMAIN_JOIN_TIME: 0.4s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 3, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 6, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 39, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME: 1.9s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.9s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 6, CALL_SUMMARIZER_APPLICATIONS: 16, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 569, DAG_COMPRESSION_RETAINED_NODES: 113, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((data == 1) && (2 == count)) || ((count == 1) && (data == 1))) && (len == 2)) || (((count <= 3) && (((2 <= count) && (data == 1)) || ((count == 1) && (data == 1)))) && (len == 2))) || (((count == 1) && (data == 1)) && (len == 2))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: (((((((len <= 0) && (data == 1)) && (len == 2)) && (data == 1)) && (0 <= (len + 2147483648))) || ((((2 == len) && (data == 1)) && (len == 2)) && (data == 1))) || ((((len == 1) && (data == 1)) && (len == 2)) && (data == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-14 05:20:44,533 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-14 05:20:44,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bfcd7414-caee-4c7a-abca-5f211a866f7f/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE