./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh --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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:09:06,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:09:06,668 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 18:09:06,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:09:06,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:09:06,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:09:06,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:09:06,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:09:06,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:09:06,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:09:06,702 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:09:06,703 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:09:06,703 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:09:06,704 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 18:09:06,704 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:09:06,705 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:09:06,705 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 18:09:06,706 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 18:09:06,706 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:09:06,707 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 18:09:06,707 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 18:09:06,712 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 18:09:06,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:09:06,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 18:09:06,713 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:09:06,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:09:06,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:09:06,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:09:06,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 18:09:06,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:09:06,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 18:09:06,716 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 18:09:06,716 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 18:09:06,716 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:09:06,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 18:09:06,717 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:09:06,717 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:09:06,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:09:06,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:09:06,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:09:06,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:09:06,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:09:06,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 18:09:06,718 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 18:09:06,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 18:09:06,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:09:06,719 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 18:09:06,719 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:09:06,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:09:06,720 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2023-12-02 18:09:06,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:09:06,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:09:06,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:09:06,972 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:09:06,972 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:09:06,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2023-12-02 18:09:09,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:09:10,098 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:09:10,098 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/sv-benchmarks/c/list-simple/sll2c_update_all.i [2023-12-02 18:09:10,112 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/data/da9c6cf7c/58a987d407ef420ea4abc59874bd5045/FLAG9e6aaf2e3 [2023-12-02 18:09:10,125 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/data/da9c6cf7c/58a987d407ef420ea4abc59874bd5045 [2023-12-02 18:09:10,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:09:10,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:09:10,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:09:10,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:09:10,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:09:10,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:09:10" (1/1) ... [2023-12-02 18:09:10,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@334630a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10, skipping insertion in model container [2023-12-02 18:09:10,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:09:10" (1/1) ... [2023-12-02 18:09:10,181 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:09:10,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:09:10,462 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:09:10,507 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:09:10,539 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:09:10,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10 WrapperNode [2023-12-02 18:09:10,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:09:10,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:09:10,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:09:10,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:09:10,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10" (1/1) ... [2023-12-02 18:09:10,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10" (1/1) ... [2023-12-02 18:09:10,587 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2023-12-02 18:09:10,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:09:10,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:09:10,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:09:10,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:09:10,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10" (1/1) ... [2023-12-02 18:09:10,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10" (1/1) ... [2023-12-02 18:09:10,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10" (1/1) ... [2023-12-02 18:09:10,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10" (1/1) ... [2023-12-02 18:09:10,612 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10" (1/1) ... [2023-12-02 18:09:10,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10" (1/1) ... [2023-12-02 18:09:10,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10" (1/1) ... [2023-12-02 18:09:10,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10" (1/1) ... [2023-12-02 18:09:10,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:09:10,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:09:10,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:09:10,625 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:09:10,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10" (1/1) ... [2023-12-02 18:09:10,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:09:10,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:09:10,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:09:10,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:09:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 18:09:10,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 18:09:10,694 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 18:09:10,694 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 18:09:10,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 18:09:10,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:09:10,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 18:09:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 18:09:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 18:09:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 18:09:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:09:10,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:09:10,818 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:09:10,820 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:09:11,044 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:09:11,100 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:09:11,100 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-02 18:09:11,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:09:11 BoogieIcfgContainer [2023-12-02 18:09:11,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:09:11,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:09:11,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:09:11,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:09:11,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:09:10" (1/3) ... [2023-12-02 18:09:11,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65419e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:09:11, skipping insertion in model container [2023-12-02 18:09:11,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:09:10" (2/3) ... [2023-12-02 18:09:11,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65419e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:09:11, skipping insertion in model container [2023-12-02 18:09:11,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:09:11" (3/3) ... [2023-12-02 18:09:11,112 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2023-12-02 18:09:11,133 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:09:11,133 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-12-02 18:09:11,193 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:09:11,200 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1cc3ac7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:09:11,200 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-12-02 18:09:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 44 states have internal predecessors, (53), 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) [2023-12-02 18:09:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 18:09:11,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:09:11,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:09:11,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:09:11,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:09:11,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1556827802, now seen corresponding path program 1 times [2023-12-02 18:09:11,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:09:11,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168871122] [2023-12-02 18:09:11,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:09:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:09:11,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:09:11,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168871122] [2023-12-02 18:09:11,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168871122] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:09:11,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:09:11,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:09:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347659546] [2023-12-02 18:09:11,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:09:11,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:09:11,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:09:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:09:11,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:09:11,539 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 44 states have internal predecessors, (53), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 18:09:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:09:11,598 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2023-12-02 18:09:11,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:09:11,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 9 [2023-12-02 18:09:11,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:09:11,607 INFO L225 Difference]: With dead ends: 89 [2023-12-02 18:09:11,607 INFO L226 Difference]: Without dead ends: 49 [2023-12-02 18:09:11,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:09:11,613 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:09:11,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 85 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:09:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-02 18:09:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2023-12-02 18:09:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 39 states have internal predecessors, (44), 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) [2023-12-02 18:09:11,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-12-02 18:09:11,651 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2023-12-02 18:09:11,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:09:11,651 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-12-02 18:09:11,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 18:09:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-12-02 18:09:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 18:09:11,652 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:09:11,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:09:11,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 18:09:11,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:09:11,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:09:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1261018111, now seen corresponding path program 1 times [2023-12-02 18:09:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:09:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630404172] [2023-12-02 18:09:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:11,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:09:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 18:09:11,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:09:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630404172] [2023-12-02 18:09:11,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630404172] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:09:11,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:09:11,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:09:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150479780] [2023-12-02 18:09:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:09:11,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:09:11,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:09:11,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:09:11,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:09:11,796 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-12-02 18:09:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:09:11,857 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2023-12-02 18:09:11,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:09:11,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 13 [2023-12-02 18:09:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:09:11,860 INFO L225 Difference]: With dead ends: 49 [2023-12-02 18:09:11,860 INFO L226 Difference]: Without dead ends: 47 [2023-12-02 18:09:11,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:09:11,862 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:09:11,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:09:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-02 18:09:11,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-02 18:09:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 42 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:09:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2023-12-02 18:09:11,871 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 13 [2023-12-02 18:09:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:09:11,872 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2023-12-02 18:09:11,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-12-02 18:09:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2023-12-02 18:09:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 18:09:11,873 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:09:11,873 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:09:11,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 18:09:11,874 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:09:11,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:09:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash 621206431, now seen corresponding path program 1 times [2023-12-02 18:09:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:09:11,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846274960] [2023-12-02 18:09:11,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:11,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:09:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 18:09:12,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:09:12,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846274960] [2023-12-02 18:09:12,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846274960] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:09:12,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:09:12,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:09:12,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170014552] [2023-12-02 18:09:12,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:09:12,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:09:12,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:09:12,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:09:12,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:09:12,017 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2023-12-02 18:09:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:09:12,095 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2023-12-02 18:09:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:09:12,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2023-12-02 18:09:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:09:12,097 INFO L225 Difference]: With dead ends: 89 [2023-12-02 18:09:12,097 INFO L226 Difference]: Without dead ends: 72 [2023-12-02 18:09:12,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:09:12,100 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:09:12,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 59 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:09:12,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-02 18:09:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2023-12-02 18:09:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 48 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:09:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-12-02 18:09:12,112 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 17 [2023-12-02 18:09:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:09:12,112 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-12-02 18:09:12,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2023-12-02 18:09:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2023-12-02 18:09:12,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 18:09:12,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:09:12,114 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:09:12,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 18:09:12,115 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:09:12,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:09:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash -653221587, now seen corresponding path program 1 times [2023-12-02 18:09:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:09:12,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465535020] [2023-12-02 18:09:12,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:09:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 18:09:12,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:09:12,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465535020] [2023-12-02 18:09:12,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465535020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:09:12,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:09:12,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:09:12,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504979406] [2023-12-02 18:09:12,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:09:12,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:09:12,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:09:12,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:09:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:09:12,269 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-12-02 18:09:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:09:12,345 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2023-12-02 18:09:12,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:09:12,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 20 [2023-12-02 18:09:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:09:12,348 INFO L225 Difference]: With dead ends: 72 [2023-12-02 18:09:12,348 INFO L226 Difference]: Without dead ends: 70 [2023-12-02 18:09:12,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:09:12,350 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:09:12,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 90 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:09:12,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-02 18:09:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2023-12-02 18:09:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.525) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:09:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2023-12-02 18:09:12,360 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 20 [2023-12-02 18:09:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:09:12,361 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2023-12-02 18:09:12,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-12-02 18:09:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2023-12-02 18:09:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 18:09:12,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:09:12,362 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:09:12,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 18:09:12,363 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:09:12,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:09:12,363 INFO L85 PathProgramCache]: Analyzing trace with hash -653225722, now seen corresponding path program 1 times [2023-12-02 18:09:12,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:09:12,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728776743] [2023-12-02 18:09:12,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:12,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:09:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 18:09:12,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:09:12,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728776743] [2023-12-02 18:09:12,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728776743] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:09:12,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:09:12,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:09:12,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161323523] [2023-12-02 18:09:12,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:09:12,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:09:12,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:09:12,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:09:12,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:09:12,468 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-12-02 18:09:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:09:12,540 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2023-12-02 18:09:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:09:12,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 20 [2023-12-02 18:09:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:09:12,542 INFO L225 Difference]: With dead ends: 103 [2023-12-02 18:09:12,542 INFO L226 Difference]: Without dead ends: 66 [2023-12-02 18:09:12,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:09:12,544 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 94 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 [2023-12-02 18:09:12,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 94 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:09:12,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-02 18:09:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2023-12-02 18:09:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:09:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2023-12-02 18:09:12,553 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 20 [2023-12-02 18:09:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:09:12,553 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2023-12-02 18:09:12,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-12-02 18:09:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2023-12-02 18:09:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 18:09:12,555 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:09:12,555 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:09:12,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 18:09:12,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:09:12,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:09:12,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1092427396, now seen corresponding path program 1 times [2023-12-02 18:09:12,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:09:12,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831038886] [2023-12-02 18:09:12,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:12,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:09:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 18:09:12,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:09:12,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831038886] [2023-12-02 18:09:12,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831038886] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:09:12,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810723109] [2023-12-02 18:09:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:12,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:09:12,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:09:12,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:09:12,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 18:09:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:12,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 18:09:12,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:09:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 18:09:12,893 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:09:12,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810723109] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:09:12,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:09:12,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 18:09:12,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332610451] [2023-12-02 18:09:12,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:09:12,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:09:12,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:09:12,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:09:12,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:09:12,895 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 18:09:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:09:12,950 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2023-12-02 18:09:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:09:12,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2023-12-02 18:09:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:09:12,951 INFO L225 Difference]: With dead ends: 98 [2023-12-02 18:09:12,951 INFO L226 Difference]: Without dead ends: 50 [2023-12-02 18:09:12,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-02 18:09:12,953 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:09:12,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:09:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-02 18:09:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-02 18:09:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 46 states have internal predecessors, (50), 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) [2023-12-02 18:09:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-12-02 18:09:12,960 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 21 [2023-12-02 18:09:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:09:12,960 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-12-02 18:09:12,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 18:09:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-12-02 18:09:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 18:09:12,961 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:09:12,961 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:09:12,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 18:09:13,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:09:13,164 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:09:13,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:09:13,164 INFO L85 PathProgramCache]: Analyzing trace with hash 372610289, now seen corresponding path program 1 times [2023-12-02 18:09:13,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:09:13,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836382797] [2023-12-02 18:09:13,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:13,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:09:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 18:09:13,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:09:13,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836382797] [2023-12-02 18:09:13,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836382797] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:09:13,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853074745] [2023-12-02 18:09:13,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:13,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:09:13,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:09:13,320 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:09:13,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 18:09:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:13,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 18:09:13,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:09:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 18:09:13,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:09:13,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853074745] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:09:13,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:09:13,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2023-12-02 18:09:13,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543104283] [2023-12-02 18:09:13,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:09:13,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:09:13,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:09:13,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:09:13,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-02 18:09:13,558 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2023-12-02 18:09:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:09:13,665 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2023-12-02 18:09:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:09:13,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 23 [2023-12-02 18:09:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:09:13,667 INFO L225 Difference]: With dead ends: 60 [2023-12-02 18:09:13,667 INFO L226 Difference]: Without dead ends: 58 [2023-12-02 18:09:13,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-02 18:09:13,668 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:09:13,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 72 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:09:13,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-02 18:09:13,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2023-12-02 18:09:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 44 states have internal predecessors, (48), 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) [2023-12-02 18:09:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-12-02 18:09:13,676 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 23 [2023-12-02 18:09:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:09:13,677 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-12-02 18:09:13,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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) [2023-12-02 18:09:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-12-02 18:09:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 18:09:13,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:09:13,678 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:09:13,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 18:09:13,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:09:13,880 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:09:13,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:09:13,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1333982862, now seen corresponding path program 1 times [2023-12-02 18:09:13,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:09:13,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516029354] [2023-12-02 18:09:13,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:13,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:09:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 18:09:14,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:09:14,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516029354] [2023-12-02 18:09:14,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516029354] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:09:14,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779463603] [2023-12-02 18:09:14,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:14,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:09:14,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:09:14,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:09:14,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 18:09:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:14,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 18:09:14,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:09:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 18:09:14,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:09:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 18:09:14,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779463603] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:09:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1980744514] [2023-12-02 18:09:14,368 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 18:09:14,368 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:09:14,372 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:09:14,377 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:09:14,378 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:09:15,903 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-12-02 18:09:15,933 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:09:23,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1980744514] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:09:23,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:09:23,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 5, 5] total 25 [2023-12-02 18:09:23,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763064618] [2023-12-02 18:09:23,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:09:23,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 18:09:23,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:09:23,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 18:09:23,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=515, Unknown=2, NotChecked=0, Total=650 [2023-12-02 18:09:23,110 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 14 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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) [2023-12-02 18:09:26,812 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] [2023-12-02 18:09:28,945 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] [2023-12-02 18:09:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:09:29,480 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2023-12-02 18:09:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 18:09:29,480 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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 24 [2023-12-02 18:09:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:09:29,481 INFO L225 Difference]: With dead ends: 74 [2023-12-02 18:09:29,481 INFO L226 Difference]: Without dead ends: 54 [2023-12-02 18:09:29,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=168, Invalid=699, Unknown=3, NotChecked=0, Total=870 [2023-12-02 18:09:29,482 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:09:29,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 195 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 337 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2023-12-02 18:09:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-02 18:09:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2023-12-02 18:09:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.358974358974359) internal successors, (53), 48 states have internal predecessors, (53), 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) [2023-12-02 18:09:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-12-02 18:09:29,490 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 24 [2023-12-02 18:09:29,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:09:29,490 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-12-02 18:09:29,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 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) [2023-12-02 18:09:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-12-02 18:09:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:09:29,491 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:09:29,491 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:09:29,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 18:09:29,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:09:29,691 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:09:29,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:09:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2057273740, now seen corresponding path program 1 times [2023-12-02 18:09:29,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:09:29,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511544752] [2023-12-02 18:09:29,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:29,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:09:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 18:09:29,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:09:29,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511544752] [2023-12-02 18:09:29,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511544752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:09:29,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:09:29,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:09:29,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033404827] [2023-12-02 18:09:29,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:09:29,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:09:29,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:09:29,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:09:29,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:09:29,738 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2023-12-02 18:09:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:09:29,763 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2023-12-02 18:09:29,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:09:29,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 26 [2023-12-02 18:09:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:09:29,764 INFO L225 Difference]: With dead ends: 52 [2023-12-02 18:09:29,764 INFO L226 Difference]: Without dead ends: 51 [2023-12-02 18:09:29,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:09:29,765 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:09:29,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 62 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:09:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-02 18:09:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-02 18:09:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 47 states have internal predecessors, (52), 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) [2023-12-02 18:09:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2023-12-02 18:09:29,773 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 26 [2023-12-02 18:09:29,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:09:29,774 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2023-12-02 18:09:29,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2023-12-02 18:09:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2023-12-02 18:09:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 18:09:29,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:09:29,775 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:09:29,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 18:09:29,775 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:09:29,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:09:29,776 INFO L85 PathProgramCache]: Analyzing trace with hash 649023580, now seen corresponding path program 1 times [2023-12-02 18:09:29,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:09:29,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603411577] [2023-12-02 18:09:29,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:29,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:09:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 18:09:29,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:09:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603411577] [2023-12-02 18:09:29,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603411577] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:09:29,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478578543] [2023-12-02 18:09:29,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:29,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:09:29,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:09:29,879 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:09:29,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 18:09:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:30,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:09:30,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:09:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 18:09:30,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:09:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 18:09:30,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478578543] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:09:30,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1512001505] [2023-12-02 18:09:30,111 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 18:09:30,111 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:09:30,111 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:09:30,111 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:09:30,112 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:09:30,956 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-12-02 18:09:30,993 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:09:39,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1512001505] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:09:39,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:09:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6, 6, 6] total 26 [2023-12-02 18:09:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21977834] [2023-12-02 18:09:39,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:09:39,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 18:09:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:09:39,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 18:09:39,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=605, Unknown=3, NotChecked=0, Total=702 [2023-12-02 18:09:39,840 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 15 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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) [2023-12-02 18:09:43,556 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] [2023-12-02 18:09:45,772 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] [2023-12-02 18:09:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:09:46,388 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-12-02 18:09:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 18:09:46,389 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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 27 [2023-12-02 18:09:46,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:09:46,390 INFO L225 Difference]: With dead ends: 54 [2023-12-02 18:09:46,390 INFO L226 Difference]: Without dead ends: 53 [2023-12-02 18:09:46,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=117, Invalid=810, Unknown=3, NotChecked=0, Total=930 [2023-12-02 18:09:46,391 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:09:46,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 144 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 6 Unknown, 0 Unchecked, 5.7s Time] [2023-12-02 18:09:46,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-02 18:09:46,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-02 18:09:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 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) [2023-12-02 18:09:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2023-12-02 18:09:46,398 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 27 [2023-12-02 18:09:46,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:09:46,398 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2023-12-02 18:09:46,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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) [2023-12-02 18:09:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2023-12-02 18:09:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 18:09:46,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:09:46,399 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:09:46,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 18:09:46,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 18:09:46,600 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:09:46,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:09:46,600 INFO L85 PathProgramCache]: Analyzing trace with hash -881091081, now seen corresponding path program 1 times [2023-12-02 18:09:46,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:09:46,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823522444] [2023-12-02 18:09:46,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:46,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:09:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:09:46,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:09:46,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823522444] [2023-12-02 18:09:46,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823522444] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:09:46,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678994342] [2023-12-02 18:09:46,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:09:46,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:09:46,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:09:46,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:09:46,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 18:09:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:09:46,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 18:09:46,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:09:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:09:46,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:09:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:09:46,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678994342] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:09:46,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1220791513] [2023-12-02 18:09:46,887 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 18:09:46,887 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:09:46,887 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:09:46,887 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:09:46,887 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:09:49,871 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-12-02 18:09:49,906 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:10:02,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1220791513] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:02,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:10:02,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [5, 5, 5] total 25 [2023-12-02 18:10:02,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040418930] [2023-12-02 18:10:02,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:02,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 18:10:02,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:02,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 18:10:02,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=557, Unknown=1, NotChecked=0, Total=650 [2023-12-02 18:10:02,768 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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) [2023-12-02 18:10:06,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 18:10:10,088 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] [2023-12-02 18:10:12,480 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] [2023-12-02 18:10:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:12,836 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2023-12-02 18:10:12,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 18:10:12,837 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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 30 [2023-12-02 18:10:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:12,837 INFO L225 Difference]: With dead ends: 53 [2023-12-02 18:10:12,837 INFO L226 Difference]: Without dead ends: 50 [2023-12-02 18:10:12,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=115, Invalid=754, Unknown=1, NotChecked=0, Total=870 [2023-12-02 18:10:12,839 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 7 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:12,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 116 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 327 Invalid, 4 Unknown, 0 Unchecked, 9.2s Time] [2023-12-02 18:10:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-02 18:10:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2023-12-02 18:10:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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) [2023-12-02 18:10:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2023-12-02 18:10:12,849 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 30 [2023-12-02 18:10:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:12,850 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2023-12-02 18:10:12,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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) [2023-12-02 18:10:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2023-12-02 18:10:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 18:10:12,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:12,851 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:12,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 18:10:13,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:10:13,052 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:10:13,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:13,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1552818218, now seen corresponding path program 1 times [2023-12-02 18:10:13,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:13,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142785702] [2023-12-02 18:10:13,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:13,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:10:13,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:13,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142785702] [2023-12-02 18:10:13,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142785702] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:13,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:13,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:10:13,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924415122] [2023-12-02 18:10:13,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:13,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:10:13,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:13,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:10:13,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:10:13,157 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2023-12-02 18:10:13,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:13,220 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2023-12-02 18:10:13,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:10:13,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 36 [2023-12-02 18:10:13,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:13,222 INFO L225 Difference]: With dead ends: 71 [2023-12-02 18:10:13,222 INFO L226 Difference]: Without dead ends: 56 [2023-12-02 18:10:13,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:10:13,223 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:13,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 72 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:10:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-02 18:10:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2023-12-02 18:10:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.25) internal successors, (50), 45 states have internal predecessors, (50), 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) [2023-12-02 18:10:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2023-12-02 18:10:13,238 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 36 [2023-12-02 18:10:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:13,238 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2023-12-02 18:10:13,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2023-12-02 18:10:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2023-12-02 18:10:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 18:10:13,239 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:13,239 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:13,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 18:10:13,239 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:10:13,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:13,240 INFO L85 PathProgramCache]: Analyzing trace with hash -892628762, now seen corresponding path program 1 times [2023-12-02 18:10:13,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:13,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994108748] [2023-12-02 18:10:13,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:13,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:10:13,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:13,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994108748] [2023-12-02 18:10:13,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994108748] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:13,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:13,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:10:13,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419529379] [2023-12-02 18:10:13,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:13,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:10:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:10:13,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:10:13,331 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-12-02 18:10:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:13,407 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2023-12-02 18:10:13,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:10:13,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 37 [2023-12-02 18:10:13,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:13,408 INFO L225 Difference]: With dead ends: 56 [2023-12-02 18:10:13,408 INFO L226 Difference]: Without dead ends: 54 [2023-12-02 18:10:13,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:10:13,410 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:13,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 68 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:10:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-02 18:10:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2023-12-02 18:10:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 48 states have internal predecessors, (53), 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) [2023-12-02 18:10:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-12-02 18:10:13,425 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 37 [2023-12-02 18:10:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:13,426 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-12-02 18:10:13,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-12-02 18:10:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-12-02 18:10:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 18:10:13,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:13,427 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:13,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 18:10:13,428 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:10:13,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:13,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2134184038, now seen corresponding path program 1 times [2023-12-02 18:10:13,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:13,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124817578] [2023-12-02 18:10:13,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:10:13,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:13,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124817578] [2023-12-02 18:10:13,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124817578] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:10:13,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792371547] [2023-12-02 18:10:13,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:13,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:10:13,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:10:13,567 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:10:13,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 18:10:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:13,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 18:10:13,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:10:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:10:13,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:10:13,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792371547] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:13,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:10:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2023-12-02 18:10:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443597158] [2023-12-02 18:10:13,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:13,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:10:13,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:13,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:10:13,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-02 18:10:13,824 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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) [2023-12-02 18:10:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:13,908 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-12-02 18:10:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:10:13,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 40 [2023-12-02 18:10:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:13,909 INFO L225 Difference]: With dead ends: 54 [2023-12-02 18:10:13,909 INFO L226 Difference]: Without dead ends: 52 [2023-12-02 18:10:13,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-02 18:10:13,910 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:13,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 54 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:10:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-02 18:10:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2023-12-02 18:10:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.186046511627907) internal successors, (51), 46 states have internal predecessors, (51), 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) [2023-12-02 18:10:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2023-12-02 18:10:13,921 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2023-12-02 18:10:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:13,921 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2023-12-02 18:10:13,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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) [2023-12-02 18:10:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2023-12-02 18:10:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 18:10:13,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:13,922 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:13,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 18:10:14,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:10:14,123 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:10:14,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1735195846, now seen corresponding path program 1 times [2023-12-02 18:10:14,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:14,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026629937] [2023-12-02 18:10:14,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:14,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:10:14,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:14,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026629937] [2023-12-02 18:10:14,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026629937] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:10:14,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755444407] [2023-12-02 18:10:14,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:14,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:10:14,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:10:14,255 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:10:14,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 18:10:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:14,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 18:10:14,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:10:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:10:14,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:10:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:10:14,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755444407] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:10:14,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [478064520] [2023-12-02 18:10:14,575 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-12-02 18:10:14,575 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:10:14,576 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:10:14,576 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:10:14,576 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:10:15,729 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-12-02 18:10:15,753 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:10:18,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [478064520] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:18,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:10:18,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [5, 5, 5] total 32 [2023-12-02 18:10:18,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697075892] [2023-12-02 18:10:18,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:18,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 18:10:18,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:18,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 18:10:18,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=841, Unknown=2, NotChecked=0, Total=1056 [2023-12-02 18:10:18,499 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 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) [2023-12-02 18:10:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:20,779 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2023-12-02 18:10:20,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 18:10:20,780 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 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 41 [2023-12-02 18:10:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:20,780 INFO L225 Difference]: With dead ends: 68 [2023-12-02 18:10:20,780 INFO L226 Difference]: Without dead ends: 66 [2023-12-02 18:10:20,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=274, Invalid=1204, Unknown=4, NotChecked=0, Total=1482 [2023-12-02 18:10:20,781 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:20,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 87 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 406 Invalid, 2 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 18:10:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-02 18:10:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2023-12-02 18:10:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 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) [2023-12-02 18:10:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2023-12-02 18:10:20,792 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 41 [2023-12-02 18:10:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:20,792 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2023-12-02 18:10:20,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 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) [2023-12-02 18:10:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2023-12-02 18:10:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 18:10:20,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:20,793 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:20,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 18:10:20,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:10:20,994 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:10:20,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:20,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1075900904, now seen corresponding path program 1 times [2023-12-02 18:10:20,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:20,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263977218] [2023-12-02 18:10:20,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:20,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-02 18:10:21,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:21,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263977218] [2023-12-02 18:10:21,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263977218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:21,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:21,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:10:21,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762931522] [2023-12-02 18:10:21,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:21,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:10:21,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:21,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:10:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:10:21,057 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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) [2023-12-02 18:10:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:21,093 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2023-12-02 18:10:21,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:10:21,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 43 [2023-12-02 18:10:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:21,095 INFO L225 Difference]: With dead ends: 54 [2023-12-02 18:10:21,095 INFO L226 Difference]: Without dead ends: 53 [2023-12-02 18:10:21,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:10:21,096 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:21,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:10:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-02 18:10:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-02 18:10:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 49 states have internal predecessors, (55), 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) [2023-12-02 18:10:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-12-02 18:10:21,112 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 43 [2023-12-02 18:10:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:21,112 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-12-02 18:10:21,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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) [2023-12-02 18:10:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2023-12-02 18:10:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 18:10:21,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:21,113 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:21,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 18:10:21,114 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:10:21,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1006810223, now seen corresponding path program 1 times [2023-12-02 18:10:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:21,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431047068] [2023-12-02 18:10:21,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:21,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:10:21,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:21,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431047068] [2023-12-02 18:10:21,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431047068] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:10:21,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811938801] [2023-12-02 18:10:21,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:21,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:10:21,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:10:21,238 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:10:21,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 18:10:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:21,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:10:21,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:10:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:10:21,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:10:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:10:21,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811938801] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:10:21,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1764890088] [2023-12-02 18:10:21,475 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 18:10:21,475 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:10:21,476 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:10:21,476 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:10:21,476 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:10:22,333 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-12-02 18:10:22,357 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:10:24,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1764890088] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:24,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:10:24,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 6, 6] total 33 [2023-12-02 18:10:24,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855020069] [2023-12-02 18:10:24,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:24,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 18:10:24,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:24,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 18:10:24,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2023-12-02 18:10:24,916 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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) [2023-12-02 18:10:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:26,450 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2023-12-02 18:10:26,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 18:10:26,450 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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 44 [2023-12-02 18:10:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:26,451 INFO L225 Difference]: With dead ends: 64 [2023-12-02 18:10:26,451 INFO L226 Difference]: Without dead ends: 63 [2023-12-02 18:10:26,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 94 SyntacticMatches, 10 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=184, Invalid=1298, Unknown=0, NotChecked=0, Total=1482 [2023-12-02 18:10:26,452 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:26,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 38 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 18:10:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-02 18:10:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2023-12-02 18:10:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.163265306122449) internal successors, (57), 51 states have internal predecessors, (57), 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) [2023-12-02 18:10:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2023-12-02 18:10:26,463 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 44 [2023-12-02 18:10:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:26,463 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2023-12-02 18:10:26,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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) [2023-12-02 18:10:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2023-12-02 18:10:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 18:10:26,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:26,464 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:26,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 18:10:26,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 18:10:26,665 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:10:26,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:26,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2126609178, now seen corresponding path program 1 times [2023-12-02 18:10:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:26,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119680849] [2023-12-02 18:10:26,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:26,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:10:26,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:26,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119680849] [2023-12-02 18:10:26,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119680849] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:10:26,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482926842] [2023-12-02 18:10:26,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:26,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:10:26,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:10:26,812 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:10:26,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 18:10:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:26,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:10:26,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:10:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:10:27,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:10:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:10:27,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482926842] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:10:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1182720958] [2023-12-02 18:10:27,094 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 18:10:27,094 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:10:27,094 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:10:27,095 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:10:27,095 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:10:28,143 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-12-02 18:10:28,177 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:10:30,331 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4353#(and (<= 2147483649 |ULTIMATE.start_sll_circular_get_data_at_#t~post10#1|) (= |ULTIMATE.start_sll_circular_get_data_at_#t~post10#1| |ULTIMATE.start_sll_circular_get_data_at_~index#1|) (exists ((|v_ULTIMATE.start_sll_circular_get_data_at_~head#1.offset_42| Int) (|v_ULTIMATE.start_sll_circular_get_data_at_~head#1.base_42| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_get_data_at_~head#1.base_42|) |v_ULTIMATE.start_sll_circular_get_data_at_~head#1.offset_42|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_get_data_at_~head#1.base_42|) |v_ULTIMATE.start_sll_circular_get_data_at_~head#1.offset_42|)))))' at error location [2023-12-02 18:10:30,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:10:30,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:10:30,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2023-12-02 18:10:30,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809324241] [2023-12-02 18:10:30,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:10:30,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 18:10:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:30,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 18:10:30,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2023-12-02 18:10:30,332 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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) [2023-12-02 18:10:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:30,537 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2023-12-02 18:10:30,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 18:10:30,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 47 [2023-12-02 18:10:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:30,539 INFO L225 Difference]: With dead ends: 86 [2023-12-02 18:10:30,539 INFO L226 Difference]: Without dead ends: 74 [2023-12-02 18:10:30,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 106 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=133, Invalid=1199, Unknown=0, NotChecked=0, Total=1332 [2023-12-02 18:10:30,540 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:30,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 113 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:10:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-02 18:10:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2023-12-02 18:10:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 59 states have (on average 1.152542372881356) internal successors, (68), 61 states have internal predecessors, (68), 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) [2023-12-02 18:10:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2023-12-02 18:10:30,558 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 47 [2023-12-02 18:10:30,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:30,558 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2023-12-02 18:10:30,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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) [2023-12-02 18:10:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2023-12-02 18:10:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 18:10:30,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:30,559 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:30,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 18:10:30,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 18:10:30,760 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:10:30,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:30,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1497410751, now seen corresponding path program 1 times [2023-12-02 18:10:30,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:30,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609893461] [2023-12-02 18:10:30,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:30,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 18:10:30,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:30,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609893461] [2023-12-02 18:10:30,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609893461] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:10:30,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757659305] [2023-12-02 18:10:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:30,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:10:30,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:10:30,869 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:10:30,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 18:10:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:31,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 18:10:31,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:10:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 18:10:31,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:10:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 18:10:31,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757659305] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:10:31,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1091437976] [2023-12-02 18:10:31,172 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 18:10:31,173 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:10:31,173 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:10:31,173 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:10:31,173 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:10:32,705 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 43 for LOIs [2023-12-02 18:10:32,736 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:10:35,235 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4872#(and (<= |ULTIMATE.start_main_~expected~0#1| 2147483647) (<= |ULTIMATE.start_main_~i~0#1| 4294967294) (<= 0 (+ |ULTIMATE.start_main_~expected~0#1| 2147483648)) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) (<= 0 (+ 2147483647 |ULTIMATE.start_main_~len~0#1|)) (exists ((|v_ULTIMATE.start_sll_circular_get_data_at_~head#1.base_62| Int) (|v_ULTIMATE.start_sll_circular_get_data_at_~head#1.offset_62| Int)) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_get_data_at_~head#1.base_62|) (+ 4 |v_ULTIMATE.start_sll_circular_get_data_at_~head#1.offset_62|)))) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~len~0#1| 4294967295) (<= 2147483647 |ULTIMATE.start_main_#t~post16#1|))' at error location [2023-12-02 18:10:35,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:10:35,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:10:35,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-12-02 18:10:35,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774580531] [2023-12-02 18:10:35,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:10:35,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 18:10:35,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:35,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 18:10:35,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1044, Unknown=3, NotChecked=0, Total=1190 [2023-12-02 18:10:35,237 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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) [2023-12-02 18:10:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:35,394 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2023-12-02 18:10:35,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 18:10:35,394 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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 48 [2023-12-02 18:10:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:35,395 INFO L225 Difference]: With dead ends: 114 [2023-12-02 18:10:35,395 INFO L226 Difference]: Without dead ends: 113 [2023-12-02 18:10:35,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 107 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=180, Invalid=1298, Unknown=4, NotChecked=0, Total=1482 [2023-12-02 18:10:35,397 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:35,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 131 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:10:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-02 18:10:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2023-12-02 18:10:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 98 states have (on average 1.1734693877551021) internal successors, (115), 100 states have internal predecessors, (115), 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) [2023-12-02 18:10:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2023-12-02 18:10:35,411 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 48 [2023-12-02 18:10:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:35,411 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2023-12-02 18:10:35,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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) [2023-12-02 18:10:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2023-12-02 18:10:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-02 18:10:35,412 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:35,413 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:35,418 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 18:10:35,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:10:35,613 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2023-12-02 18:10:35,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:35,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1833243447, now seen corresponding path program 1 times [2023-12-02 18:10:35,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:35,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415145389] [2023-12-02 18:10:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:35,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 18:10:35,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:35,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415145389] [2023-12-02 18:10:35,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415145389] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:10:35,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017091095] [2023-12-02 18:10:35,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:35,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:10:35,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:10:35,786 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:10:35,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 18:10:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:35,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:10:35,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:10:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 18:10:36,104 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:10:36,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017091095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:36,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:10:36,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2023-12-02 18:10:36,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068811370] [2023-12-02 18:10:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:36,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 18:10:36,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:36,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 18:10:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-02 18:10:36,106 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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) [2023-12-02 18:10:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:36,213 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2023-12-02 18:10:36,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:10:36,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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 51 [2023-12-02 18:10:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:36,213 INFO L225 Difference]: With dead ends: 106 [2023-12-02 18:10:36,214 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 18:10:36,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-02 18:10:36,215 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:36,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 70 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:10:36,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 18:10:36,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 18:10:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:10:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 18:10:36,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2023-12-02 18:10:36,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:36,217 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 18:10:36,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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) [2023-12-02 18:10:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 18:10:36,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 18:10:36,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2023-12-02 18:10:36,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2023-12-02 18:10:36,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2023-12-02 18:10:36,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2023-12-02 18:10:36,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2023-12-02 18:10:36,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2023-12-02 18:10:36,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2023-12-02 18:10:36,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2023-12-02 18:10:36,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2023-12-02 18:10:36,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2023-12-02 18:10:36,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2023-12-02 18:10:36,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2023-12-02 18:10:36,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2023-12-02 18:10:36,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2023-12-02 18:10:36,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-02 18:10:36,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:10:36,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 18:10:44,206 WARN L293 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 213 DAG size of output: 118 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-02 18:10:44,268 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2023-12-02 18:10:44,268 INFO L899 garLoopResultBuilder]: For program point L630(line 630) no Hoare annotation was computed. [2023-12-02 18:10:44,268 INFO L899 garLoopResultBuilder]: For program point L630-1(line 630) no Hoare annotation was computed. [2023-12-02 18:10:44,268 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 620 639) no Hoare annotation was computed. [2023-12-02 18:10:44,268 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2023-12-02 18:10:44,268 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse3 (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0)) (.cse6 (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse0 (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3)) (.cse4 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse5 (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse7 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse8 (exists ((|v_ULTIMATE.start_main_~new_data~0#1_22| Int) (|v_ULTIMATE.start_main_~i~0#1_56| Int)) (and (= |v_ULTIMATE.start_main_~i~0#1_56| 0) (exists ((|v_#memory_int_132| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_90| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= (store |v_#memory_int_132| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_132| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_#memory_int_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0))) |v_#memory_int_133|) (= |#memory_int| (store |v_#memory_int_133| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_133| |ULTIMATE.start_main_~s~0#1.base|) 4 2))) (= |#memory_$Pointer$.offset| (let ((.cse17 (store |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)))) (store .cse17 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse17 |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4))))) (= (let ((.cse18 (store |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (store .cse18 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse18 |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)))) |#memory_$Pointer$.base|))) (= |v_ULTIMATE.start_main_~new_data~0#1_22| 2) .cse16))) (.cse9 (= 3 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse10 (= 3 |ULTIMATE.start_main_~new_data~0#1|)) (.cse11 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse15 (= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse12 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse13 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse14 (= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_sll_circular_update_at_~index#1| 1) .cse13 .cse14) (and (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 2) .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 0) .cse3 (= 2 |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse4 .cse5 .cse6 .cse11 (= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 0) .cse15 (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_73| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0))) (= (store |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))))) .cse12 .cse16 (= 2 |ULTIMATE.start_main_~new_data~0#1|) .cse13) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) 0)) .cse4 .cse5 .cse7 .cse8 .cse9 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) 0) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) .cse10 .cse11 .cse15 .cse12 .cse13 .cse14)))) [2023-12-02 18:10:44,269 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2023-12-02 18:10:44,269 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2023-12-02 18:10:44,269 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2023-12-02 18:10:44,269 INFO L899 garLoopResultBuilder]: For program point L590(line 590) no Hoare annotation was computed. [2023-12-02 18:10:44,269 INFO L899 garLoopResultBuilder]: For program point L590-1(line 590) no Hoare annotation was computed. [2023-12-02 18:10:44,269 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2023-12-02 18:10:44,269 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2023-12-02 18:10:44,269 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (<= 1 |#StackHeapBarrier|)) (.cse3 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|)) (.cse4 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse5 (= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse7 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|)) (.cse9 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse0 .cse1) (and .cse2 .cse3 .cse4 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) .cse0 (= 3 |ULTIMATE.start_main_~expected~0#1|) .cse5 .cse6 (= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) .cse7 .cse1 (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse8 .cse9) (and .cse2 (= |ULTIMATE.start_main_~i~0#1| 0) .cse3 .cse4 (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse5 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse6 .cse7 .cse1 (= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 0) .cse8 .cse9))) [2023-12-02 18:10:44,269 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 630) no Hoare annotation was computed. [2023-12-02 18:10:44,270 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 18:10:44,270 INFO L899 garLoopResultBuilder]: For program point L616(line 616) no Hoare annotation was computed. [2023-12-02 18:10:44,270 INFO L899 garLoopResultBuilder]: For program point L616-1(line 616) no Hoare annotation was computed. [2023-12-02 18:10:44,270 INFO L899 garLoopResultBuilder]: For program point L625-3(line 625) no Hoare annotation was computed. [2023-12-02 18:10:44,270 INFO L899 garLoopResultBuilder]: For program point L625-4(line 625) no Hoare annotation was computed. [2023-12-02 18:10:44,271 INFO L895 garLoopResultBuilder]: At program point L625-5(lines 625 628) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse4 (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_73| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0))) (= (store |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_73| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))))) .cse3 .cse4 .cse5) (and .cse0 (exists ((|v_ULTIMATE.start_main_~i~0#1_56| Int)) (or (and (= |v_ULTIMATE.start_main_~i~0#1_56| 0) (exists ((|v_#memory_int_132| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_90| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= (store |v_#memory_int_132| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_132| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_#memory_int_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0))) |v_#memory_int_133|) (= |#memory_int| (store |v_#memory_int_133| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_133| |ULTIMATE.start_main_~s~0#1.base|) 4 2))) (= |#memory_$Pointer$.offset| (let ((.cse6 (store |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)))) (store .cse6 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse6 |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4))))) (= (let ((.cse7 (store |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (store .cse7 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse7 |ULTIMATE.start_main_~s~0#1.base|) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)))) |#memory_$Pointer$.base|))) (= |ULTIMATE.start_main_~i~0#1| 1) .cse4 (= 2 |ULTIMATE.start_main_~new_data~0#1|)) (and (exists ((|v_#memory_$Pointer$.base_92| (Array Int (Array Int Int))) (|v_#memory_int_132| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_92| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (let ((.cse9 (select |v_#memory_$Pointer$.offset_92| |ULTIMATE.start_main_~s~0#1.base|)) (.cse14 (select |v_#memory_$Pointer$.base_92| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse10 (select .cse14 0)) (.cse11 (+ (select .cse9 0) 4))) (and (= (store |v_#memory_int_132| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_132| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_#memory_int_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0))) |v_#memory_int_133|) (= (let ((.cse8 (store |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)))) (store .cse8 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse8 |ULTIMATE.start_main_~s~0#1.base|) 4 (select .cse9 4)))) |v_#memory_$Pointer$.offset_92|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_92| .cse10 (store (select |v_#memory_$Pointer$.offset_92| .cse10) .cse11 (select (select |#memory_$Pointer$.offset| .cse10) .cse11)))) (= |#memory_int| (let ((.cse12 (store |v_#memory_int_133| |ULTIMATE.start_main_~s~0#1.base| (store (select |v_#memory_int_133| |ULTIMATE.start_main_~s~0#1.base|) 4 2)))) (store .cse12 .cse10 (store (select .cse12 .cse10) .cse11 3)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_92| .cse10 (store (select |v_#memory_$Pointer$.base_92| .cse10) .cse11 (select (select |#memory_$Pointer$.base| .cse10) .cse11)))) (= |v_#memory_$Pointer$.base_92| (let ((.cse13 (store |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_90| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)))) (store .cse13 |ULTIMATE.start_main_~s~0#1.base| (store (select .cse13 |ULTIMATE.start_main_~s~0#1.base|) 4 (select .cse14 4))))))))) (= 2 |ULTIMATE.start_main_~i~0#1|) (= 3 |ULTIMATE.start_main_~new_data~0#1|) (= |v_ULTIMATE.start_main_~i~0#1_56| 1) .cse4))) .cse1 .cse2 .cse3 .cse5))) [2023-12-02 18:10:44,271 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2023-12-02 18:10:44,271 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= 2 (select |#length| 1)) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= (select .cse0 1) 0) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))) [2023-12-02 18:10:44,271 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-12-02 18:10:44,271 INFO L899 garLoopResultBuilder]: For program point L609(line 609) no Hoare annotation was computed. [2023-12-02 18:10:44,271 INFO L899 garLoopResultBuilder]: For program point L609-1(line 609) no Hoare annotation was computed. [2023-12-02 18:10:44,271 INFO L899 garLoopResultBuilder]: For program point L626(line 626) no Hoare annotation was computed. [2023-12-02 18:10:44,271 INFO L899 garLoopResultBuilder]: For program point L626-1(line 626) no Hoare annotation was computed. [2023-12-02 18:10:44,272 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 609) no Hoare annotation was computed. [2023-12-02 18:10:44,272 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2023-12-02 18:10:44,272 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2023-12-02 18:10:44,272 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse2 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse6 (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse7 (= |ULTIMATE.start_sll_circular_create_~data#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_sll_circular_create_~len#1| 1) .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (select |#memory_int| 1))) (and .cse0 (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse1 .cse2 .cse3 (= 2 (select |#length| 1)) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) .cse4 (= (select |#valid| 0) 0) .cse5 (= (select |#valid| 2) 1) (= (select .cse8 0) 48) .cse6 (= (select .cse8 1) 0) .cse7)))) [2023-12-02 18:10:44,272 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 18:10:44,272 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 616) no Hoare annotation was computed. [2023-12-02 18:10:44,272 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2023-12-02 18:10:44,272 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 629) no Hoare annotation was computed. [2023-12-02 18:10:44,273 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= 2 (select |#length| 1)) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= (select .cse0 1) 0) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))) [2023-12-02 18:10:44,273 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-12-02 18:10:44,273 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2023-12-02 18:10:44,273 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2023-12-02 18:10:44,273 INFO L899 garLoopResultBuilder]: For program point L629-3(line 629) no Hoare annotation was computed. [2023-12-02 18:10:44,273 INFO L899 garLoopResultBuilder]: For program point L629-4(line 629) no Hoare annotation was computed. [2023-12-02 18:10:44,273 INFO L895 garLoopResultBuilder]: At program point L629-5(lines 629 634) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 .cse2 .cse3 .cse4) (and (<= |ULTIMATE.start_main_~i~0#1| 2147483645) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse3) (and .cse0 (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2) .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse2 .cse3 (= 2 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse4))) [2023-12-02 18:10:44,273 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2023-12-02 18:10:44,274 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-02 18:10:44,274 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-02 18:10:44,274 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (or (not (= |node_create_#in~data#1| 1)) (< |#StackHeapBarrier| 1) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2023-12-02 18:10:44,274 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-02 18:10:44,277 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:44,278 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 18:10:44,291 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,292 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,292 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated [2023-12-02 18:10:44,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_73 : [int,int]int, v_#memory_$Pointer$.base_73 : [int,int]int, v_#memory_int_111 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 : int :: (#memory_$Pointer$.offset == v_#memory_$Pointer$.offset_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 := v_#memory_$Pointer$.offset_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0 := 0]] && v_#memory_$Pointer$.base_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 := v_#memory_$Pointer$.base_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0 := #res!base]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_111[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 := v_#memory_int_111[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0 := #memory_int[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0]]]) could not be translated [2023-12-02 18:10:44,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_56 : int :: ((((v_ULTIMATE.start_main_~i~0#1_56 == 0 && (exists v_#memory_int_132 : [int,int]int, v_#memory_int_133 : [int,int]int, v_#memory_$Pointer$.base_90 : [int,int]int, v_#memory_$Pointer$.offset_90 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: ((v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := v_#memory_int_133[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]] == v_#memory_int_133 && #memory_int == v_#memory_int_133[~s~0!base := v_#memory_int_133[~s~0!base][4 := 2]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base)) && ~i~0 == 1) && #res!base == ~s~0!base) && 2 == ~new_data~0) || (((((exists v_#memory_$Pointer$.base_92 : [int,int]int, v_#memory_int_132 : [int,int]int, v_#memory_int_133 : [int,int]int, v_#memory_$Pointer$.base_90 : [int,int]int, v_#memory_$Pointer$.offset_90 : [int,int]int, v_#memory_$Pointer$.offset_92 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: ((((v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := v_#memory_int_133[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]] == v_#memory_int_133 && v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][4 := v_#memory_$Pointer$.offset_92[~s~0!base][4]]] == v_#memory_$Pointer$.offset_92) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_92[v_#memory_$Pointer$.base_92[~s~0!base][0] := v_#memory_$Pointer$.offset_92[v_#memory_$Pointer$.base_92[~s~0!base][0]][v_#memory_$Pointer$.offset_92[~s~0!base][0] + 4 := #memory_$Pointer$.offset[v_#memory_$Pointer$.base_92[~s~0!base][0]][v_#memory_$Pointer$.offset_92[~s~0!base][0] + 4]]]) && #memory_int == v_#memory_int_133[~s~0!base := v_#memory_int_133[~s~0!base][4 := 2]][v_#memory_$Pointer$.base_92[~s~0!base][0] := v_#memory_int_133[~s~0!base := v_#memory_int_133[~s~0!base][4 := 2]][v_#memory_$Pointer$.base_92[~s~0!base][0]][v_#memory_$Pointer$.offset_92[~s~0!base][0] + 4 := 3]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_92[v_#memory_$Pointer$.base_92[~s~0!base][0] := v_#memory_$Pointer$.base_92[v_#memory_$Pointer$.base_92[~s~0!base][0]][v_#memory_$Pointer$.offset_92[~s~0!base][0] + 4 := #memory_$Pointer$.base[v_#memory_$Pointer$.base_92[~s~0!base][0]][v_#memory_$Pointer$.offset_92[~s~0!base][0] + 4]]]) && v_#memory_$Pointer$.base_92 == v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][4 := v_#memory_$Pointer$.base_92[~s~0!base][4]]]) && 2 == ~i~0) && 3 == ~new_data~0) && v_ULTIMATE.start_main_~i~0#1_56 == 1) && #res!base == ~s~0!base)) could not be translated [2023-12-02 18:10:44,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,302 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-12-02 18:10:44,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-12-02 18:10:44,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated [2023-12-02 18:10:44,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-12-02 18:10:44,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated [2023-12-02 18:10:44,303 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-12-02 18:10:44,304 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-12-02 18:10:44,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 18:10:44,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,309 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 18:10:44,310 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~new_data~0#1_22 : int, v_ULTIMATE.start_main_~i~0#1_56 : int :: ((v_ULTIMATE.start_main_~i~0#1_56 == 0 && (exists v_#memory_int_132 : [int,int]int, v_#memory_int_133 : [int,int]int, v_#memory_$Pointer$.base_90 : [int,int]int, v_#memory_$Pointer$.offset_90 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: ((v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := v_#memory_int_133[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]] == v_#memory_int_133 && #memory_int == v_#memory_int_133[~s~0!base := v_#memory_int_133[~s~0!base][4 := 2]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base)) && v_ULTIMATE.start_main_~new_data~0#1_22 == 2) && #res!base == ~s~0!base) could not be translated [2023-12-02 18:10:44,310 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 18:10:44,310 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 18:10:44,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 18:10:44,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,311 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 18:10:44,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,312 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_73 : [int,int]int, v_#memory_$Pointer$.base_73 : [int,int]int, v_#memory_int_111 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 : int :: (#memory_$Pointer$.offset == v_#memory_$Pointer$.offset_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 := v_#memory_$Pointer$.offset_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0 := 0]] && v_#memory_$Pointer$.base_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 := v_#memory_$Pointer$.base_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0 := #res!base]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_111[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 := v_#memory_int_111[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0 := #memory_int[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0]]]) could not be translated [2023-12-02 18:10:44,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 18:10:44,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 18:10:44,313 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 18:10:44,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#in~head!base][0] could not be translated [2023-12-02 18:10:44,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 18:10:44,314 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 18:10:44,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~new_data~0#1_22 : int, v_ULTIMATE.start_main_~i~0#1_56 : int :: ((v_ULTIMATE.start_main_~i~0#1_56 == 0 && (exists v_#memory_int_132 : [int,int]int, v_#memory_int_133 : [int,int]int, v_#memory_$Pointer$.base_90 : [int,int]int, v_#memory_$Pointer$.offset_90 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: ((v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := v_#memory_int_133[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]] == v_#memory_int_133 && #memory_int == v_#memory_int_133[~s~0!base := v_#memory_int_133[~s~0!base][4 := 2]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base)) && v_ULTIMATE.start_main_~new_data~0#1_22 == 2) && #res!base == ~s~0!base) could not be translated [2023-12-02 18:10:44,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#in~head!base][0] could not be translated [2023-12-02 18:10:44,315 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~new_data~0 [2023-12-02 18:10:44,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 18:10:44,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 18:10:44,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 18:10:44,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 18:10:44,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 18:10:44,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 18:10:44,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-12-02 18:10:44,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 18:10:44,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated [2023-12-02 18:10:44,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~i~0 [2023-12-02 18:10:44,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~s~0 [2023-12-02 18:10:44,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~expected~0 [2023-12-02 18:10:44,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~data~0 [2023-12-02 18:10:44,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-12-02 18:10:44,323 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,323 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-02 18:10:44,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:10:44 BoogieIcfgContainer [2023-12-02 18:10:44,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 18:10:44,324 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 18:10:44,324 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 18:10:44,325 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 18:10:44,325 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:09:11" (3/4) ... [2023-12-02 18:10:44,327 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 18:10:44,331 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-12-02 18:10:44,338 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2023-12-02 18:10:44,339 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-12-02 18:10:44,339 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-12-02 18:10:44,340 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 18:10:44,366 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 1) && (len == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1)) || ((((((2 == len) && (\old(data) == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1))) [2023-12-02 18:10:44,367 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((i == 0) && (data == 1)) && (len == 2)) || (((i <= 2147483645) && (2 <= i)) && (len == 2))) || (((((\result == 2) && (i == 1)) && (2 == expected)) && (data == 1)) && (len == 2))) [2023-12-02 18:10:44,367 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 3) && (3 == data)) && (data == 1)) && (index == 1)) && (\old(index) == 1)) || (((((\old(data) == 2) && (2 == data)) && (data == 1)) && (\old(index) == 0)) && (index == 0))) || (((((\old(data) == 3) && (3 == data)) && (data == 1)) && (index == 0)) && (\old(index) == 1))) [2023-12-02 18:10:44,367 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((index <= 0) || ((index == 1) && (\old(index) == 1))) || ((index == 0) && (\old(index) == 0))) [2023-12-02 18:10:44,388 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 1) && (len == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1)) || ((((((2 == len) && (\old(data) == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1))) [2023-12-02 18:10:44,391 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((i == 0) && (data == 1)) && (len == 2)) || (((i <= 2147483645) && (2 <= i)) && (len == 2))) || (((((\result == 2) && (i == 1)) && (2 == expected)) && (data == 1)) && (len == 2))) [2023-12-02 18:10:44,391 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(data) == 3) && (3 == data)) && (data == 1)) && (index == 1)) && (\old(index) == 1)) || (((((\old(data) == 2) && (2 == data)) && (data == 1)) && (\old(index) == 0)) && (index == 0))) || (((((\old(data) == 3) && (3 == data)) && (data == 1)) && (index == 0)) && (\old(index) == 1))) [2023-12-02 18:10:44,391 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((index <= 0) || ((index == 1) && (\old(index) == 1))) || ((index == 0) && (\old(index) == 0))) [2023-12-02 18:10:44,431 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 18:10:44,431 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 18:10:44,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 18:10:44,432 INFO L158 Benchmark]: Toolchain (without parser) took 94302.91ms. Allocated memory was 192.9MB in the beginning and 339.7MB in the end (delta: 146.8MB). Free memory was 155.2MB in the beginning and 175.6MB in the end (delta: -20.5MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. [2023-12-02 18:10:44,432 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 115.3MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:10:44,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.87ms. Allocated memory is still 192.9MB. Free memory was 154.7MB in the beginning and 137.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 18:10:44,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.20ms. Allocated memory is still 192.9MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 18:10:44,434 INFO L158 Benchmark]: Boogie Preprocessor took 36.07ms. Allocated memory is still 192.9MB. Free memory was 135.0MB in the beginning and 133.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 18:10:44,434 INFO L158 Benchmark]: RCFGBuilder took 476.98ms. Allocated memory is still 192.9MB. Free memory was 133.3MB in the beginning and 112.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 18:10:44,435 INFO L158 Benchmark]: TraceAbstraction took 93218.43ms. Allocated memory was 192.9MB in the beginning and 339.7MB in the end (delta: 146.8MB). Free memory was 111.6MB in the beginning and 181.9MB in the end (delta: -70.3MB). Peak memory consumption was 160.5MB. Max. memory is 16.1GB. [2023-12-02 18:10:44,435 INFO L158 Benchmark]: Witness Printer took 107.01ms. Allocated memory is still 339.7MB. Free memory was 181.9MB in the beginning and 175.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 18:10:44,438 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.22ms. Allocated memory is still 115.3MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.87ms. Allocated memory is still 192.9MB. Free memory was 154.7MB in the beginning and 137.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.20ms. Allocated memory is still 192.9MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.07ms. Allocated memory is still 192.9MB. Free memory was 135.0MB in the beginning and 133.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 476.98ms. Allocated memory is still 192.9MB. Free memory was 133.3MB in the beginning and 112.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 93218.43ms. Allocated memory was 192.9MB in the beginning and 339.7MB in the end (delta: 146.8MB). Free memory was 111.6MB in the beginning and 181.9MB in the end (delta: -70.3MB). Peak memory consumption was 160.5MB. Max. memory is 16.1GB. * Witness Printer took 107.01ms. Allocated memory is still 339.7MB. Free memory was 181.9MB in the beginning and 175.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_73 : [int,int]int, v_#memory_$Pointer$.base_73 : [int,int]int, v_#memory_int_111 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 : int :: (#memory_$Pointer$.offset == v_#memory_$Pointer$.offset_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 := v_#memory_$Pointer$.offset_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0 := 0]] && v_#memory_$Pointer$.base_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 := v_#memory_$Pointer$.base_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0 := #res!base]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_111[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 := v_#memory_int_111[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0 := #memory_int[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_56 : int :: ((((v_ULTIMATE.start_main_~i~0#1_56 == 0 && (exists v_#memory_int_132 : [int,int]int, v_#memory_int_133 : [int,int]int, v_#memory_$Pointer$.base_90 : [int,int]int, v_#memory_$Pointer$.offset_90 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: ((v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := v_#memory_int_133[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]] == v_#memory_int_133 && #memory_int == v_#memory_int_133[~s~0!base := v_#memory_int_133[~s~0!base][4 := 2]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base)) && ~i~0 == 1) && #res!base == ~s~0!base) && 2 == ~new_data~0) || (((((exists v_#memory_$Pointer$.base_92 : [int,int]int, v_#memory_int_132 : [int,int]int, v_#memory_int_133 : [int,int]int, v_#memory_$Pointer$.base_90 : [int,int]int, v_#memory_$Pointer$.offset_90 : [int,int]int, v_#memory_$Pointer$.offset_92 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: ((((v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := v_#memory_int_133[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]] == v_#memory_int_133 && v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][4 := v_#memory_$Pointer$.offset_92[~s~0!base][4]]] == v_#memory_$Pointer$.offset_92) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_92[v_#memory_$Pointer$.base_92[~s~0!base][0] := v_#memory_$Pointer$.offset_92[v_#memory_$Pointer$.base_92[~s~0!base][0]][v_#memory_$Pointer$.offset_92[~s~0!base][0] + 4 := #memory_$Pointer$.offset[v_#memory_$Pointer$.base_92[~s~0!base][0]][v_#memory_$Pointer$.offset_92[~s~0!base][0] + 4]]]) && #memory_int == v_#memory_int_133[~s~0!base := v_#memory_int_133[~s~0!base][4 := 2]][v_#memory_$Pointer$.base_92[~s~0!base][0] := v_#memory_int_133[~s~0!base := v_#memory_int_133[~s~0!base][4 := 2]][v_#memory_$Pointer$.base_92[~s~0!base][0]][v_#memory_$Pointer$.offset_92[~s~0!base][0] + 4 := 3]]) && #memory_$Pointer$.base == v_#memory_$Pointer$.base_92[v_#memory_$Pointer$.base_92[~s~0!base][0] := v_#memory_$Pointer$.base_92[v_#memory_$Pointer$.base_92[~s~0!base][0]][v_#memory_$Pointer$.offset_92[~s~0!base][0] + 4 := #memory_$Pointer$.base[v_#memory_$Pointer$.base_92[~s~0!base][0]][v_#memory_$Pointer$.offset_92[~s~0!base][0] + 4]]]) && v_#memory_$Pointer$.base_92 == v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][4 := v_#memory_$Pointer$.base_92[~s~0!base][4]]]) && 2 == ~i~0) && 3 == ~new_data~0) && v_ULTIMATE.start_main_~i~0#1_56 == 1) && #res!base == ~s~0!base)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~new_data~0#1_22 : int, v_ULTIMATE.start_main_~i~0#1_56 : int :: ((v_ULTIMATE.start_main_~i~0#1_56 == 0 && (exists v_#memory_int_132 : [int,int]int, v_#memory_int_133 : [int,int]int, v_#memory_$Pointer$.base_90 : [int,int]int, v_#memory_$Pointer$.offset_90 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: ((v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := v_#memory_int_133[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]] == v_#memory_int_133 && #memory_int == v_#memory_int_133[~s~0!base := v_#memory_int_133[~s~0!base][4 := 2]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base)) && v_ULTIMATE.start_main_~new_data~0#1_22 == 2) && #res!base == ~s~0!base) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_#memory_$Pointer$.offset_73 : [int,int]int, v_#memory_$Pointer$.base_73 : [int,int]int, v_#memory_int_111 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 : int :: (#memory_$Pointer$.offset == v_#memory_$Pointer$.offset_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 := v_#memory_$Pointer$.offset_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0 := 0]] && v_#memory_$Pointer$.base_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 := v_#memory_$Pointer$.base_73[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0 := #res!base]] == #memory_$Pointer$.base) && #memory_int == v_#memory_int_111[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17 := v_#memory_int_111[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0 := #memory_int[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17][0]]]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[#in~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~new_data~0#1_22 : int, v_ULTIMATE.start_main_~i~0#1_56 : int :: ((v_ULTIMATE.start_main_~i~0#1_56 == 0 && (exists v_#memory_int_132 : [int,int]int, v_#memory_int_133 : [int,int]int, v_#memory_$Pointer$.base_90 : [int,int]int, v_#memory_$Pointer$.offset_90 : [int,int]int, v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 : int :: ((v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_int_132[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := v_#memory_int_133[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0]]] == v_#memory_int_133 && #memory_int == v_#memory_int_133[~s~0!base := v_#memory_int_133[~s~0!base][4 := 2]]) && #memory_$Pointer$.offset == v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.offset_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := 0]][~s~0!base][4 := #memory_$Pointer$.offset[~s~0!base][4]]]) && v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18 := v_#memory_$Pointer$.base_90[v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18][0 := #res!base]][~s~0!base][4 := #memory_$Pointer$.base[~s~0!base][4]]] == #memory_$Pointer$.base)) && v_ULTIMATE.start_main_~new_data~0#1_22 == 2) && #res!base == ~s~0!base) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[#in~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~new_data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~data~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #in~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression * 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: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 616]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 629]: 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, 48 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 93.1s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 22.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 347 mSDsluCounter, 1836 SdHoareTripleChecker+Invalid, 21.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1348 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2655 IncrementalHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 488 mSDtfsCounter, 2655 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1034 GetRequests, 697 SyntacticMatches, 46 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 44.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=19, InterpolantAutomatonStates: 169, 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, 20 MinimizatonAttempts, 110 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 28 NumberOfFragments, 1194 HoareAnnotationTreeSize, 11 FomulaSimplifications, 3511 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 886 FormulaSimplificationTreeSizeReductionInter, 7.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1236 ConstructedInterpolants, 0 QuantifiedInterpolants, 2922 SizeOfPredicates, 27 NumberOfNonLiveVariables, 3378 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 38 InterpolantComputations, 13 PerfectInterpolantSequences, 402/518 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: 7.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 10, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 124, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 311, TOOLS_POST_TIME: 4.1s, TOOLS_POST_CALL_APPLICATIONS: 50, TOOLS_POST_CALL_TIME: 0.5s, TOOLS_POST_RETURN_APPLICATIONS: 40, TOOLS_POST_RETURN_TIME: 1.3s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 389, TOOLS_QUANTIFIERELIM_TIME: 5.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 597, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 55, DOMAIN_JOIN_TIME: 0.5s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 15, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 39, DOMAIN_ISSUBSETEQ_TIME: 0.5s, DOMAIN_ISBOTTOM_APPLICATIONS: 124, DOMAIN_ISBOTTOM_TIME: 0.4s, LOOP_SUMMARIZER_APPLICATIONS: 24, LOOP_SUMMARIZER_CACHE_MISSES: 24, LOOP_SUMMARIZER_OVERALL_TIME: 4.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 4.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 39, CALL_SUMMARIZER_APPLICATIONS: 40, CALL_SUMMARIZER_CACHE_MISSES: 5, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, 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: 1746, DAG_COMPRESSION_RETAINED_NODES: 417, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: (((((i == 0) && (data == 1)) && (len == 2)) || (((i <= 2147483645) && (2 <= i)) && (len == 2))) || (((((\result == 2) && (i == 1)) && (2 == expected)) && (data == 1)) && (len == 2))) - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: ((((i == 0) && (data == 1)) && (len == 2)) || ((data == 1) && (len == 2))) - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((((((\old(data) == 1) && (len == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1)) || ((((((2 == len) && (\old(data) == 1)) && (data == 1)) && (len == 2)) && (2 == \old(len))) && (data == 1))) - InvariantResult [Line: 614]: Loop Invariant Derived loop invariant: (((((((\old(data) == 3) && (3 == data)) && (data == 1)) && (index == 1)) && (\old(index) == 1)) || (((((\old(data) == 2) && (2 == data)) && (data == 1)) && (\old(index) == 0)) && (index == 0))) || (((((\old(data) == 3) && (3 == data)) && (data == 1)) && (index == 0)) && (\old(index) == 1))) - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: (((index <= 0) || ((index == 1) && (\old(index) == 1))) || ((index == 0) && (\old(index) == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-02 18:10:44,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c74a69e-1938-4e72-86fe-7c1eb56e630f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE