./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.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_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:06:15,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:06:15,187 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-29 07:06:15,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:06:15,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:06:15,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:06:15,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:06:15,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:06:15,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:06:15,219 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:06:15,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:06:15,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:06:15,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:06:15,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:06:15,222 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:06:15,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:06:15,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:06:15,224 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:06:15,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 07:06:15,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:06:15,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:06:15,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:06:15,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:06:15,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:06:15,233 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 07:06:15,234 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 07:06:15,234 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:06:15,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:06:15,235 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:06:15,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:06:15,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:06:15,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:06:15,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:06:15,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:06:15,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:06:15,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:06:15,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:06:15,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 07:06:15,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 07:06:15,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:06:15,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:06:15,238 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:06:15,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:06:15,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:06:15,239 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/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_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2023-11-29 07:06:15,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:06:15,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:06:15,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:06:15,478 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:06:15,478 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:06:15,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2023-11-29 07:06:18,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:06:18,543 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:06:18,544 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2023-11-29 07:06:18,558 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/data/ae882e7ec/c733e83acf234f8e9cbecf057b2aee81/FLAGfb681e08f [2023-11-29 07:06:18,573 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/data/ae882e7ec/c733e83acf234f8e9cbecf057b2aee81 [2023-11-29 07:06:18,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:06:18,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:06:18,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:06:18,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:06:18,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:06:18,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:06:18" (1/1) ... [2023-11-29 07:06:18,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:18, skipping insertion in model container [2023-11-29 07:06:18,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:06:18" (1/1) ... [2023-11-29 07:06:18,630 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:06:18,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:06:18,934 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:06:18,975 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:06:19,007 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:06:19,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19 WrapperNode [2023-11-29 07:06:19,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:06:19,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:06:19,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:06:19,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:06:19,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:19,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:19,056 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 148 [2023-11-29 07:06:19,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:06:19,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:06:19,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:06:19,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:06:19,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:19,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:19,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:19,094 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 12, 6]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2023-11-29 07:06:19,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:19,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:19,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:19,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:19,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:19,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:19,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:06:19,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:06:19,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:06:19,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:06:19,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:19,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:06:19,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:19,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:06:19,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:06:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 07:06:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 07:06:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 07:06:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 07:06:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 07:06:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 07:06:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 07:06:19,179 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 07:06:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 07:06:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:06:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 07:06:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 07:06:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 07:06:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 07:06:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 07:06:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 07:06:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 07:06:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 07:06:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 07:06:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 07:06:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 07:06:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 07:06:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 07:06:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 07:06:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:06:19,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:06:19,312 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:06:19,314 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:06:19,552 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:06:19,585 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:06:19,585 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 07:06:19,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:06:19 BoogieIcfgContainer [2023-11-29 07:06:19,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:06:19,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:06:19,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:06:19,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:06:19,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:06:18" (1/3) ... [2023-11-29 07:06:19,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150efeba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:06:19, skipping insertion in model container [2023-11-29 07:06:19,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19" (2/3) ... [2023-11-29 07:06:19,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150efeba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:06:19, skipping insertion in model container [2023-11-29 07:06:19,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:06:19" (3/3) ... [2023-11-29 07:06:19,594 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2023-11-29 07:06:19,608 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:06:19,609 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-29 07:06:19,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:06:19,655 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=PETRI_NET, 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;@1c7c24f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:06:19,655 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-29 07:06:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 42 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-11-29 07:06:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 07:06:19,664 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:19,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:19,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:19,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash 590038198, now seen corresponding path program 1 times [2023-11-29 07:06:19,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:19,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798002239] [2023-11-29 07:06:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:19,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:19,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:06:20,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:20,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798002239] [2023-11-29 07:06:20,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798002239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:20,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:06:20,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:06:20,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553061936] [2023-11-29 07:06:20,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:20,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:06:20,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:20,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:06:20,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:06:20,060 INFO L87 Difference]: Start difference. First operand has 46 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 42 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) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 07:06:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:20,172 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2023-11-29 07:06:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:06:20,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2023-11-29 07:06:20,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:20,182 INFO L225 Difference]: With dead ends: 90 [2023-11-29 07:06:20,182 INFO L226 Difference]: Without dead ends: 42 [2023-11-29 07:06:20,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:06:20,189 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:20,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 167 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:20,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-29 07:06:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-29 07:06:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.4) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2023-11-29 07:06:20,230 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 8 [2023-11-29 07:06:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:20,232 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2023-11-29 07:06:20,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 07:06:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2023-11-29 07:06:20,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 07:06:20,234 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:20,234 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-29 07:06:20,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 07:06:20,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:20,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:20,235 INFO L85 PathProgramCache]: Analyzing trace with hash 936220611, now seen corresponding path program 1 times [2023-11-29 07:06:20,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:20,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639075343] [2023-11-29 07:06:20,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:20,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:20,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 07:06:20,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:20,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639075343] [2023-11-29 07:06:20,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639075343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:20,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:06:20,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:06:20,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153557752] [2023-11-29 07:06:20,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:20,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:06:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:20,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:06:20,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:06:20,406 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 07:06:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:20,472 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2023-11-29 07:06:20,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:06:20,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-11-29 07:06:20,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:20,474 INFO L225 Difference]: With dead ends: 42 [2023-11-29 07:06:20,474 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 07:06:20,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:06:20,476 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:20,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 117 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:06:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 07:06:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-29 07:06:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-11-29 07:06:20,486 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 16 [2023-11-29 07:06:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:20,487 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-29 07:06:20,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 07:06:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-11-29 07:06:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 07:06:20,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:20,489 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2023-11-29 07:06:20,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 07:06:20,489 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:20,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1041932083, now seen corresponding path program 1 times [2023-11-29 07:06:20,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:20,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754813806] [2023-11-29 07:06:20,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:20,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:20,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:06:20,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:20,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754813806] [2023-11-29 07:06:20,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754813806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:20,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842977910] [2023-11-29 07:06:20,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:20,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:20,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:20,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:20,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 07:06:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:20,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 07:06:20,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:06:20,901 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:06:20,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842977910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:20,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:06:20,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2023-11-29 07:06:20,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114075541] [2023-11-29 07:06:20,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:20,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:06:20,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:20,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:06:20,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:06:20,904 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 07:06:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:20,965 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-11-29 07:06:20,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:06:20,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-11-29 07:06:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:20,967 INFO L225 Difference]: With dead ends: 41 [2023-11-29 07:06:20,967 INFO L226 Difference]: Without dead ends: 40 [2023-11-29 07:06:20,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:06:20,969 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:20,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 166 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:06:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-29 07:06:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2023-11-29 07:06:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 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-11-29 07:06:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-11-29 07:06:20,976 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 17 [2023-11-29 07:06:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:20,977 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-11-29 07:06:20,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 07:06:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-11-29 07:06:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 07:06:20,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:20,978 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:20,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 07:06:21,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:21,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:21,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:21,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1987176260, now seen corresponding path program 1 times [2023-11-29 07:06:21,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:21,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833450972] [2023-11-29 07:06:21,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:21,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:21,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:21,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 07:06:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:06:21,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:21,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833450972] [2023-11-29 07:06:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833450972] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:21,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981555097] [2023-11-29 07:06:21,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:21,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:21,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:21,333 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:21,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 07:06:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:21,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 07:06:21,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 07:06:21,518 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:06:21,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981555097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:21,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:06:21,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 07:06:21,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981814093] [2023-11-29 07:06:21,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:21,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:06:21,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:21,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:06:21,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:06:21,521 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-11-29 07:06:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:21,539 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2023-11-29 07:06:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:06:21,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-11-29 07:06:21,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:21,540 INFO L225 Difference]: With dead ends: 36 [2023-11-29 07:06:21,540 INFO L226 Difference]: Without dead ends: 35 [2023-11-29 07:06:21,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:06:21,542 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:21,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:06:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-29 07:06:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-29 07:06:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 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-11-29 07:06:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-11-29 07:06:21,549 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 20 [2023-11-29 07:06:21,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:21,550 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-11-29 07:06:21,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-11-29 07:06:21,550 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-11-29 07:06:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 07:06:21,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:21,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:21,557 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 07:06:21,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:21,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:21,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:21,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1472922035, now seen corresponding path program 1 times [2023-11-29 07:06:21,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:21,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096125315] [2023-11-29 07:06:21,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:21,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:21,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:21,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 07:06:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:06:21,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:21,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096125315] [2023-11-29 07:06:21,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096125315] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:21,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798911451] [2023-11-29 07:06:21,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:21,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:21,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:21,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:21,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 07:06:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:22,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 07:06:22,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 07:06:22,038 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:06:22,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798911451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:22,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:06:22,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 07:06:22,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392640395] [2023-11-29 07:06:22,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:22,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:06:22,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:22,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:06:22,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:06:22,040 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-11-29 07:06:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:22,054 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-11-29 07:06:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:06:22,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 21 [2023-11-29 07:06:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:22,056 INFO L225 Difference]: With dead ends: 35 [2023-11-29 07:06:22,056 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 07:06:22,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:06:22,057 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:22,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 36 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:06:22,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 07:06:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-29 07:06:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 28 states have internal predecessors, (32), 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-11-29 07:06:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-11-29 07:06:22,064 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 21 [2023-11-29 07:06:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:22,064 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-29 07:06:22,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-11-29 07:06:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-11-29 07:06:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 07:06:22,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:22,065 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:22,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 07:06:22,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:22,266 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:22,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1893509898, now seen corresponding path program 1 times [2023-11-29 07:06:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:22,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405949941] [2023-11-29 07:06:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:22,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:22,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-29 07:06:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:06:22,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:22,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405949941] [2023-11-29 07:06:22,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405949941] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:22,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165081429] [2023-11-29 07:06:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:22,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:22,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:22,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:22,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 07:06:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:22,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 07:06:22,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:06:22,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:06:22,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165081429] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:22,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:22,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-11-29 07:06:22,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446239312] [2023-11-29 07:06:22,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:22,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 07:06:22,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:22,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 07:06:22,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:06:22,633 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 07:06:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:22,709 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2023-11-29 07:06:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:06:22,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2023-11-29 07:06:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:22,710 INFO L225 Difference]: With dead ends: 62 [2023-11-29 07:06:22,710 INFO L226 Difference]: Without dead ends: 37 [2023-11-29 07:06:22,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:06:22,712 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:22,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-29 07:06:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-29 07:06:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-11-29 07:06:22,718 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2023-11-29 07:06:22,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:22,718 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-11-29 07:06:22,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 07:06:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-11-29 07:06:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 07:06:22,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:22,720 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:22,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 07:06:22,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 07:06:22,925 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:22,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:22,925 INFO L85 PathProgramCache]: Analyzing trace with hash 563668553, now seen corresponding path program 2 times [2023-11-29 07:06:22,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:22,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687801697] [2023-11-29 07:06:22,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 07:06:23,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:23,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687801697] [2023-11-29 07:06:23,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687801697] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:23,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904043536] [2023-11-29 07:06:23,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:06:23,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:23,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:23,261 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:23,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 07:06:23,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 07:06:23,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:06:23,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 07:06:23,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:23,448 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:06:23,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904043536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:23,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:06:23,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2023-11-29 07:06:23,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585992523] [2023-11-29 07:06:23,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:23,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:06:23,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:23,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:06:23,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:06:23,450 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-11-29 07:06:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:23,485 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-11-29 07:06:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 07:06:23,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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 31 [2023-11-29 07:06:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:23,486 INFO L225 Difference]: With dead ends: 37 [2023-11-29 07:06:23,486 INFO L226 Difference]: Without dead ends: 36 [2023-11-29 07:06:23,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:06:23,487 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:23,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 66 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:06:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-29 07:06:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-29 07:06:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-11-29 07:06:23,494 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 31 [2023-11-29 07:06:23,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:23,495 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-11-29 07:06:23,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-11-29 07:06:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-11-29 07:06:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 07:06:23,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:23,496 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:23,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 07:06:23,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-29 07:06:23,701 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:23,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:23,701 INFO L85 PathProgramCache]: Analyzing trace with hash 293804516, now seen corresponding path program 1 times [2023-11-29 07:06:23,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:23,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771948218] [2023-11-29 07:06:23,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:23,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 07:06:23,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:23,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771948218] [2023-11-29 07:06:23,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771948218] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:23,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736975218] [2023-11-29 07:06:23,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:23,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:23,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:23,990 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:24,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 07:06:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:24,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 07:06:24,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:24,209 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:06:24,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736975218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:24,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:06:24,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2023-11-29 07:06:24,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250578425] [2023-11-29 07:06:24,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:24,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:06:24,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:24,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:06:24,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:06:24,211 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-11-29 07:06:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:24,247 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2023-11-29 07:06:24,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:06:24,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2023-11-29 07:06:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:24,249 INFO L225 Difference]: With dead ends: 48 [2023-11-29 07:06:24,249 INFO L226 Difference]: Without dead ends: 47 [2023-11-29 07:06:24,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:06:24,250 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:24,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 76 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:06:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-29 07:06:24,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2023-11-29 07:06:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-11-29 07:06:24,257 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 32 [2023-11-29 07:06:24,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:24,258 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-29 07:06:24,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-11-29 07:06:24,258 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-11-29 07:06:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 07:06:24,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:24,259 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:24,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-29 07:06:24,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:24,460 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:24,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:24,460 INFO L85 PathProgramCache]: Analyzing trace with hash 293856058, now seen corresponding path program 1 times [2023-11-29 07:06:24,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:24,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733129171] [2023-11-29 07:06:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:24,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:24,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 07:06:24,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:24,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733129171] [2023-11-29 07:06:24,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733129171] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:24,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224525054] [2023-11-29 07:06:24,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:24,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:24,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:24,719 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:24,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 07:06:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:24,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 07:06:24,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:24,933 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:06:24,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224525054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:24,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:06:24,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2023-11-29 07:06:24,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099425681] [2023-11-29 07:06:24,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:24,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:06:24,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:24,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:06:24,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:06:24,936 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-11-29 07:06:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:24,971 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2023-11-29 07:06:24,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 07:06:24,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2023-11-29 07:06:24,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:24,972 INFO L225 Difference]: With dead ends: 47 [2023-11-29 07:06:24,973 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 07:06:24,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:06:24,974 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 76 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-11-29 07:06:24,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 76 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:06:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 07:06:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2023-11-29 07:06:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2023-11-29 07:06:24,980 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 32 [2023-11-29 07:06:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:24,980 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2023-11-29 07:06:24,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-11-29 07:06:24,981 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2023-11-29 07:06:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 07:06:24,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:24,982 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:24,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 07:06:25,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:25,185 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:25,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:25,185 INFO L85 PathProgramCache]: Analyzing trace with hash 518005516, now seen corresponding path program 1 times [2023-11-29 07:06:25,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:25,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484972512] [2023-11-29 07:06:25,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:25,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:25,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:25,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:25,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 07:06:25,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:25,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484972512] [2023-11-29 07:06:25,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484972512] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:25,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136695900] [2023-11-29 07:06:25,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:25,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:25,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:25,464 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:25,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 07:06:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:25,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 07:06:25,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:25,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:06:25,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136695900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:25,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:06:25,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2023-11-29 07:06:25,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516608612] [2023-11-29 07:06:25,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:25,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:06:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:25,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:06:25,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:06:25,683 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-11-29 07:06:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:25,716 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2023-11-29 07:06:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:06:25,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 33 [2023-11-29 07:06:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:25,718 INFO L225 Difference]: With dead ends: 46 [2023-11-29 07:06:25,718 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 07:06:25,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:06:25,719 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:25,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:06:25,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 07:06:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-29 07:06:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-11-29 07:06:25,725 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 33 [2023-11-29 07:06:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:25,726 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-11-29 07:06:25,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-11-29 07:06:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-11-29 07:06:25,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 07:06:25,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:25,727 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:25,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 07:06:25,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:25,933 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:25,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash 742551468, now seen corresponding path program 1 times [2023-11-29 07:06:25,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:25,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261535864] [2023-11-29 07:06:25,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:25,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:26,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:26,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:26,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 07:06:26,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:26,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261535864] [2023-11-29 07:06:26,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261535864] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:26,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116831310] [2023-11-29 07:06:26,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:26,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:26,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:26,265 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:26,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 07:06:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:26,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 07:06:26,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:26,533 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:06:26,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116831310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:26,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:06:26,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2023-11-29 07:06:26,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204110907] [2023-11-29 07:06:26,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:26,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:06:26,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:26,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:06:26,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-11-29 07:06:26,535 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-11-29 07:06:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:26,599 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2023-11-29 07:06:26,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:06:26,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-11-29 07:06:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:26,600 INFO L225 Difference]: With dead ends: 41 [2023-11-29 07:06:26,601 INFO L226 Difference]: Without dead ends: 40 [2023-11-29 07:06:26,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-29 07:06:26,602 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:26,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 91 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:06:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-29 07:06:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-11-29 07:06:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2023-11-29 07:06:26,607 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 37 [2023-11-29 07:06:26,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:26,608 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2023-11-29 07:06:26,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-11-29 07:06:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2023-11-29 07:06:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 07:06:26,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:26,609 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:26,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 07:06:26,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 07:06:26,811 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:26,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:26,812 INFO L85 PathProgramCache]: Analyzing trace with hash 742603010, now seen corresponding path program 1 times [2023-11-29 07:06:26,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:26,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463858974] [2023-11-29 07:06:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:26,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:26,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:27,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 07:06:27,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:27,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463858974] [2023-11-29 07:06:27,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463858974] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:27,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803822916] [2023-11-29 07:06:27,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:27,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:27,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:27,057 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:27,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 07:06:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:27,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 07:06:27,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:27,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:27,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803822916] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:27,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:27,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2023-11-29 07:06:27,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943163993] [2023-11-29 07:06:27,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:27,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 07:06:27,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:27,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 07:06:27,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-11-29 07:06:27,416 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 07:06:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:27,618 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2023-11-29 07:06:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 07:06:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2023-11-29 07:06:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:27,619 INFO L225 Difference]: With dead ends: 88 [2023-11-29 07:06:27,619 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 07:06:27,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2023-11-29 07:06:27,620 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:27,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 224 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 07:06:27,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2023-11-29 07:06:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 50 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-11-29 07:06:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2023-11-29 07:06:27,627 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 37 [2023-11-29 07:06:27,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:27,627 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2023-11-29 07:06:27,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 07:06:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2023-11-29 07:06:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 07:06:27,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:27,629 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-11-29 07:06:27,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 07:06:27,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 07:06:27,836 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:27,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash -163704132, now seen corresponding path program 1 times [2023-11-29 07:06:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:27,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765428681] [2023-11-29 07:06:27,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:27,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:27,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:27,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:27,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:27,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765428681] [2023-11-29 07:06:27,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765428681] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375012048] [2023-11-29 07:06:27,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:27,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:27,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:27,983 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:27,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 07:06:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 07:06:28,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:28,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375012048] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:28,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:28,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-11-29 07:06:28,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179857765] [2023-11-29 07:06:28,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:28,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 07:06:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:28,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 07:06:28,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-29 07:06:28,298 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:28,411 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2023-11-29 07:06:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 07:06:28,412 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2023-11-29 07:06:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:28,412 INFO L225 Difference]: With dead ends: 64 [2023-11-29 07:06:28,412 INFO L226 Difference]: Without dead ends: 55 [2023-11-29 07:06:28,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-11-29 07:06:28,413 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:28,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 207 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:28,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-29 07:06:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-29 07:06:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2023-11-29 07:06:28,420 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 41 [2023-11-29 07:06:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:28,421 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2023-11-29 07:06:28,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2023-11-29 07:06:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 07:06:28,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:28,422 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:28,428 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 07:06:28,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 07:06:28,623 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:28,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:28,623 INFO L85 PathProgramCache]: Analyzing trace with hash -665880132, now seen corresponding path program 2 times [2023-11-29 07:06:28,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:28,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293687722] [2023-11-29 07:06:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:28,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:28,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293687722] [2023-11-29 07:06:28,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293687722] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:28,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890617602] [2023-11-29 07:06:28,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:06:28,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:28,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:28,838 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:28,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 07:06:29,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:06:29,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:06:29,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 07:06:29,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:29,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:29,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890617602] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:29,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:29,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2023-11-29 07:06:29,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316293729] [2023-11-29 07:06:29,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:29,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 07:06:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:29,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 07:06:29,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2023-11-29 07:06:29,263 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 21 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:29,469 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2023-11-29 07:06:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 07:06:29,470 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2023-11-29 07:06:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:29,471 INFO L225 Difference]: With dead ends: 89 [2023-11-29 07:06:29,471 INFO L226 Difference]: Without dead ends: 71 [2023-11-29 07:06:29,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2023-11-29 07:06:29,472 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:29,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 209 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-29 07:06:29,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2023-11-29 07:06:29,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 62 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2023-11-29 07:06:29,479 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 51 [2023-11-29 07:06:29,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:29,479 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2023-11-29 07:06:29,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:29,479 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2023-11-29 07:06:29,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 07:06:29,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:29,481 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:29,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 07:06:29,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 07:06:29,687 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:29,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:29,688 INFO L85 PathProgramCache]: Analyzing trace with hash 332979890, now seen corresponding path program 1 times [2023-11-29 07:06:29,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:29,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493974697] [2023-11-29 07:06:29,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:29,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:29,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:29,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:29,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:29,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:29,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493974697] [2023-11-29 07:06:29,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493974697] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:29,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756268232] [2023-11-29 07:06:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:29,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:29,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:29,990 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:29,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 07:06:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:30,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 07:06:30,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:30,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:30,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756268232] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:30,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:30,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2023-11-29 07:06:30,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696751082] [2023-11-29 07:06:30,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:30,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 07:06:30,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:30,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 07:06:30,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 07:06:30,621 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 33 states, 32 states have (on average 3.0) internal successors, (96), 32 states have internal predecessors, (96), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:30,950 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2023-11-29 07:06:30,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 07:06:30,950 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.0) internal successors, (96), 32 states have internal predecessors, (96), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2023-11-29 07:06:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:30,951 INFO L225 Difference]: With dead ends: 141 [2023-11-29 07:06:30,951 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 07:06:30,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=604, Invalid=1558, Unknown=0, NotChecked=0, Total=2162 [2023-11-29 07:06:30,954 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 104 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:30,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 247 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 07:06:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 105. [2023-11-29 07:06:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 100 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2023-11-29 07:06:30,963 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 65 [2023-11-29 07:06:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:30,963 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2023-11-29 07:06:30,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.0) internal successors, (96), 32 states have internal predecessors, (96), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2023-11-29 07:06:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 07:06:30,964 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:30,965 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:30,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 07:06:31,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 07:06:31,165 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:31,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:31,166 INFO L85 PathProgramCache]: Analyzing trace with hash -681310276, now seen corresponding path program 3 times [2023-11-29 07:06:31,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:31,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450962767] [2023-11-29 07:06:31,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:31,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 07:06:31,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:31,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450962767] [2023-11-29 07:06:31,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450962767] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:31,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040398124] [2023-11-29 07:06:31,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 07:06:31,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:31,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:31,592 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:31,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 07:06:31,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 07:06:31,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:06:31,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-29 07:06:31,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:32,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:06:32,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 07:06:32,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2023-11-29 07:06:32,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 07:06:32,425 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_1| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_1|) 0) 0))) is different from true [2023-11-29 07:06:32,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:06:32,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-29 07:06:32,473 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 07:06:32,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 07:06:32,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2023-11-29 07:06:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 120 trivial. 2 not checked. [2023-11-29 07:06:32,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:32,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040398124] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:32,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:06:32,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2023-11-29 07:06:32,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137330195] [2023-11-29 07:06:32,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:32,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 07:06:32,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:32,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 07:06:32,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1269, Unknown=2, NotChecked=72, Total=1482 [2023-11-29 07:06:32,922 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 35 states, 31 states have (on average 2.935483870967742) internal successors, (91), 31 states have internal predecessors, (91), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 07:06:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:34,065 INFO L93 Difference]: Finished difference Result 199 states and 218 transitions. [2023-11-29 07:06:34,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-29 07:06:34,065 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 2.935483870967742) internal successors, (91), 31 states have internal predecessors, (91), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 71 [2023-11-29 07:06:34,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:34,067 INFO L225 Difference]: With dead ends: 199 [2023-11-29 07:06:34,067 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 07:06:34,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=430, Invalid=3478, Unknown=2, NotChecked=122, Total=4032 [2023-11-29 07:06:34,070 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 100 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:34,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 465 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 536 Invalid, 0 Unknown, 88 Unchecked, 0.4s Time] [2023-11-29 07:06:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 07:06:34,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2023-11-29 07:06:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 104 states have internal predecessors, (113), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2023-11-29 07:06:34,078 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 71 [2023-11-29 07:06:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:34,078 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2023-11-29 07:06:34,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 2.935483870967742) internal successors, (91), 31 states have internal predecessors, (91), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 07:06:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2023-11-29 07:06:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-29 07:06:34,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:34,079 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:34,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 07:06:34,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 07:06:34,280 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:34,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash 682430319, now seen corresponding path program 1 times [2023-11-29 07:06:34,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:34,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205694227] [2023-11-29 07:06:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:34,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:34,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:34,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:06:34,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205694227] [2023-11-29 07:06:34,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205694227] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:34,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331625924] [2023-11-29 07:06:34,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:34,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:34,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:34,682 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:34,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 07:06:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:34,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 07:06:34,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:06:35,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:06:35,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331625924] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:35,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:35,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 40 [2023-11-29 07:06:35,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127508957] [2023-11-29 07:06:35,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:35,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-29 07:06:35,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:35,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 07:06:35,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1253, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 07:06:35,468 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 41 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:35,941 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2023-11-29 07:06:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-29 07:06:35,941 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2023-11-29 07:06:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:35,943 INFO L225 Difference]: With dead ends: 164 [2023-11-29 07:06:35,943 INFO L226 Difference]: Without dead ends: 126 [2023-11-29 07:06:35,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=948, Invalid=3342, Unknown=0, NotChecked=0, Total=4290 [2023-11-29 07:06:35,945 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 165 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:35,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 209 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-29 07:06:35,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2023-11-29 07:06:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 115 states have (on average 1.0347826086956522) internal successors, (119), 116 states have internal predecessors, (119), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2023-11-29 07:06:35,954 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 78 [2023-11-29 07:06:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:35,954 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2023-11-29 07:06:35,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2023-11-29 07:06:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-29 07:06:35,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:35,956 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 16, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:35,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 07:06:36,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 07:06:36,157 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:36,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:36,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1225888119, now seen corresponding path program 1 times [2023-11-29 07:06:36,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:36,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319512227] [2023-11-29 07:06:36,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:36,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:37,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:37,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:37,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 0 proven. 680 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:06:37,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:37,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319512227] [2023-11-29 07:06:37,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319512227] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:37,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906590486] [2023-11-29 07:06:37,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:37,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:37,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:37,158 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:37,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 07:06:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:37,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 07:06:37,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 0 proven. 680 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:06:37,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 0 proven. 680 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:06:38,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906590486] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:38,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 72 [2023-11-29 07:06:38,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410267603] [2023-11-29 07:06:38,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:38,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-11-29 07:06:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:38,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-11-29 07:06:38,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=3923, Unknown=0, NotChecked=0, Total=5256 [2023-11-29 07:06:38,610 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand has 73 states, 72 states have (on average 2.736111111111111) internal successors, (197), 72 states have internal predecessors, (197), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:39,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:39,486 INFO L93 Difference]: Finished difference Result 296 states and 316 transitions. [2023-11-29 07:06:39,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-11-29 07:06:39,487 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 2.736111111111111) internal successors, (197), 72 states have internal predecessors, (197), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 117 [2023-11-29 07:06:39,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:39,489 INFO L225 Difference]: With dead ends: 296 [2023-11-29 07:06:39,489 INFO L226 Difference]: Without dead ends: 295 [2023-11-29 07:06:39,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2472 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3154, Invalid=8188, Unknown=0, NotChecked=0, Total=11342 [2023-11-29 07:06:39,492 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 367 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:39,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 319 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:06:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-11-29 07:06:39,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 210. [2023-11-29 07:06:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 203 states have (on average 1.103448275862069) internal successors, (224), 204 states have internal predecessors, (224), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 230 transitions. [2023-11-29 07:06:39,505 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 230 transitions. Word has length 117 [2023-11-29 07:06:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:39,505 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 230 transitions. [2023-11-29 07:06:39,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 2.736111111111111) internal successors, (197), 72 states have internal predecessors, (197), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 230 transitions. [2023-11-29 07:06:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 07:06:39,507 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:39,507 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:39,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 07:06:39,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 07:06:39,708 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:39,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash 217764545, now seen corresponding path program 2 times [2023-11-29 07:06:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:39,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240776434] [2023-11-29 07:06:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:40,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:40,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:40,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:06:40,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:40,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240776434] [2023-11-29 07:06:40,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240776434] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:40,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246132577] [2023-11-29 07:06:40,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:06:40,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:40,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:40,690 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:40,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 07:06:41,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:06:41,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:06:41,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 07:06:41,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:06:41,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:06:42,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246132577] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:42,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:42,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 76 [2023-11-29 07:06:42,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083132301] [2023-11-29 07:06:42,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:42,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-11-29 07:06:42,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:42,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-11-29 07:06:42,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1413, Invalid=4439, Unknown=0, NotChecked=0, Total=5852 [2023-11-29 07:06:42,242 INFO L87 Difference]: Start difference. First operand 210 states and 230 transitions. Second operand has 77 states, 76 states have (on average 2.75) internal successors, (209), 76 states have internal predecessors, (209), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:43,704 INFO L93 Difference]: Finished difference Result 289 states and 309 transitions. [2023-11-29 07:06:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2023-11-29 07:06:43,704 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.75) internal successors, (209), 76 states have internal predecessors, (209), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 123 [2023-11-29 07:06:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:43,706 INFO L225 Difference]: With dead ends: 289 [2023-11-29 07:06:43,706 INFO L226 Difference]: Without dead ends: 216 [2023-11-29 07:06:43,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3892 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3666, Invalid=12846, Unknown=0, NotChecked=0, Total=16512 [2023-11-29 07:06:43,713 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 459 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:43,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 261 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:06:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-29 07:06:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 212. [2023-11-29 07:06:43,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 205 states have (on average 1.0195121951219512) internal successors, (209), 206 states have internal predecessors, (209), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 215 transitions. [2023-11-29 07:06:43,721 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 215 transitions. Word has length 123 [2023-11-29 07:06:43,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:43,722 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 215 transitions. [2023-11-29 07:06:43,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.75) internal successors, (209), 76 states have internal predecessors, (209), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 215 transitions. [2023-11-29 07:06:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-11-29 07:06:43,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:43,724 INFO L195 NwaCegarLoop]: trace histogram [35, 35, 35, 35, 34, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:43,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 07:06:43,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:43,924 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:43,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:43,925 INFO L85 PathProgramCache]: Analyzing trace with hash -483988425, now seen corresponding path program 2 times [2023-11-29 07:06:43,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:43,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517696357] [2023-11-29 07:06:43,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:43,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:46,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:46,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2993 backedges. 0 proven. 2975 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:06:46,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:46,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517696357] [2023-11-29 07:06:46,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517696357] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:46,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573877126] [2023-11-29 07:06:46,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:06:46,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:46,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:46,522 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:46,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 07:06:46,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:06:46,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:06:46,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 07:06:46,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2993 backedges. 0 proven. 2975 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:06:47,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2993 backedges. 0 proven. 2975 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:06:50,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573877126] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:50,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:50,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 71, 71] total 144 [2023-11-29 07:06:50,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834894576] [2023-11-29 07:06:50,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:50,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 145 states [2023-11-29 07:06:50,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:50,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2023-11-29 07:06:50,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5257, Invalid=15623, Unknown=0, NotChecked=0, Total=20880 [2023-11-29 07:06:50,617 INFO L87 Difference]: Start difference. First operand 212 states and 215 transitions. Second operand has 145 states, 144 states have (on average 2.6180555555555554) internal successors, (377), 144 states have internal predecessors, (377), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:53,884 INFO L93 Difference]: Finished difference Result 566 states and 604 transitions. [2023-11-29 07:06:53,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2023-11-29 07:06:53,884 INFO L78 Accepts]: Start accepts. Automaton has has 145 states, 144 states have (on average 2.6180555555555554) internal successors, (377), 144 states have internal predecessors, (377), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 207 [2023-11-29 07:06:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:53,887 INFO L225 Difference]: With dead ends: 566 [2023-11-29 07:06:53,887 INFO L226 Difference]: Without dead ends: 565 [2023-11-29 07:06:53,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10140 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=12784, Invalid=33226, Unknown=0, NotChecked=0, Total=46010 [2023-11-29 07:06:53,891 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1479 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:53,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 493 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:06:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2023-11-29 07:06:53,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 390. [2023-11-29 07:06:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 383 states have (on average 1.1018276762402088) internal successors, (422), 384 states have internal predecessors, (422), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:06:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 428 transitions. [2023-11-29 07:06:53,912 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 428 transitions. Word has length 207 [2023-11-29 07:06:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:53,913 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 428 transitions. [2023-11-29 07:06:53,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 145 states, 144 states have (on average 2.6180555555555554) internal successors, (377), 144 states have internal predecessors, (377), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:06:53,913 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 428 transitions. [2023-11-29 07:06:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-29 07:06:53,916 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:53,916 INFO L195 NwaCegarLoop]: trace histogram [36, 35, 35, 35, 35, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:53,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 07:06:54,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:54,117 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:06:54,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:54,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1596908159, now seen corresponding path program 3 times [2023-11-29 07:06:54,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:54,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139657398] [2023-11-29 07:06:54,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:54,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:56,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:56,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:06:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3063 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 07:06:56,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:56,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139657398] [2023-11-29 07:06:56,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139657398] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844620720] [2023-11-29 07:06:56,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 07:06:56,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:56,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:56,825 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:56,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 07:06:57,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2023-11-29 07:06:57,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:06:57,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 155 conjunts are in the unsatisfiable core [2023-11-29 07:06:57,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:57,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:06:58,082 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 07:06:58,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 07:06:58,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 07:06:58,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:06:58,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-29 07:06:58,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 07:06:58,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 07:06:58,611 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-29 07:06:58,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 22 [2023-11-29 07:06:58,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:06:58,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2023-11-29 07:06:58,642 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 07:06:58,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 07:06:59,644 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2023-11-29 07:06:59,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 100 [2023-11-29 07:06:59,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2023-11-29 07:06:59,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2023-11-29 07:07:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3063 backedges. 408 proven. 15 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2023-11-29 07:07:00,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:07:03,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844620720] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:07:03,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:07:03,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 29] total 102 [2023-11-29 07:07:03,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668012821] [2023-11-29 07:07:03,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:07:03,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2023-11-29 07:07:03,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:03,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2023-11-29 07:07:03,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1494, Invalid=11616, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 07:07:03,133 INFO L87 Difference]: Start difference. First operand 390 states and 428 transitions. Second operand has 102 states, 98 states have (on average 2.510204081632653) internal successors, (246), 96 states have internal predecessors, (246), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 07:07:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:11,989 INFO L93 Difference]: Finished difference Result 761 states and 836 transitions. [2023-11-29 07:07:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2023-11-29 07:07:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 98 states have (on average 2.510204081632653) internal successors, (246), 96 states have internal predecessors, (246), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 213 [2023-11-29 07:07:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:11,992 INFO L225 Difference]: With dead ends: 761 [2023-11-29 07:07:11,992 INFO L226 Difference]: Without dead ends: 393 [2023-11-29 07:07:11,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10071 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=6432, Invalid=35798, Unknown=0, NotChecked=0, Total=42230 [2023-11-29 07:07:11,997 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 458 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:07:11,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 537 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 07:07:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2023-11-29 07:07:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 392. [2023-11-29 07:07:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 385 states have (on average 1.0987012987012987) internal successors, (423), 386 states have internal predecessors, (423), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:07:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 429 transitions. [2023-11-29 07:07:12,018 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 429 transitions. Word has length 213 [2023-11-29 07:07:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:12,018 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 429 transitions. [2023-11-29 07:07:12,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 98 states have (on average 2.510204081632653) internal successors, (246), 96 states have internal predecessors, (246), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 07:07:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 429 transitions. [2023-11-29 07:07:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-11-29 07:07:12,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:12,019 INFO L195 NwaCegarLoop]: trace histogram [37, 36, 36, 36, 36, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:07:12,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-29 07:07:12,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:07:12,220 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:07:12,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:12,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1064616330, now seen corresponding path program 4 times [2023-11-29 07:07:12,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:12,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146029312] [2023-11-29 07:07:12,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:12,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:14,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:14,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:07:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:14,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:07:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3244 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 07:07:14,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:14,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146029312] [2023-11-29 07:07:14,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146029312] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:07:14,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258146330] [2023-11-29 07:07:14,943 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 07:07:14,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:07:14,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:07:14,944 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:07:14,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 07:07:15,308 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 07:07:15,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:07:15,319 WARN L260 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 498 conjunts are in the unsatisfiable core [2023-11-29 07:07:15,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:07:15,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:07:15,601 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 07:07:15,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 07:07:15,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 07:07:15,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 07:07:15,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 14 [2023-11-29 07:07:15,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2023-11-29 07:07:15,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 07:07:16,114 INFO L349 Elim1Store]: treesize reduction 107, result has 24.6 percent of original size [2023-11-29 07:07:16,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 46 [2023-11-29 07:07:16,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:07:16,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 38 [2023-11-29 07:07:16,159 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-11-29 07:07:16,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2023-11-29 07:07:17,721 INFO L349 Elim1Store]: treesize reduction 218, result has 15.5 percent of original size [2023-11-29 07:07:17,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 516 treesize of output 183 [2023-11-29 07:07:17,774 INFO L349 Elim1Store]: treesize reduction 294, result has 13.5 percent of original size [2023-11-29 07:07:17,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 405 treesize of output 290 [2023-11-29 07:07:17,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 430 treesize of output 342 [2023-11-29 07:07:17,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 346 treesize of output 266 [2023-11-29 07:07:35,768 INFO L349 Elim1Store]: treesize reduction 86, result has 7.5 percent of original size [2023-11-29 07:07:35,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 236 treesize of output 105 [2023-11-29 07:07:36,183 INFO L349 Elim1Store]: treesize reduction 131, result has 7.1 percent of original size [2023-11-29 07:07:36,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 141 treesize of output 51 [2023-11-29 07:07:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3244 backedges. 295 proven. 469 refuted. 0 times theorem prover too weak. 2480 trivial. 0 not checked. [2023-11-29 07:07:36,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:09:25,666 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse75 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse76 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse81 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse82 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| Int)) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| 0) (forall ((v_ArrVal_2907 Int) (v_DerPreprocessor_2 Int)) (let ((.cse79 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_DerPreprocessor_2))) (.cse77 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_ArrVal_2907)))) (let ((.cse71 (select (select .cse77 .cse81) .cse82)) (.cse80 (+ (select (select .cse79 .cse81) .cse82) 4))) (let ((.cse78 (select (select .cse77 .cse71) .cse80))) (let ((.cse1 (select .cse77 .cse78)) (.cse2 (+ (select (select .cse79 .cse71) .cse80) 4))) (let ((.cse7 (store .cse79 .cse78 (store (select .cse79 .cse78) .cse2 0))) (.cse4 (store .cse77 .cse78 (store .cse1 .cse2 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|)))) (let ((.cse3 (select (select .cse4 .cse75) .cse76)) (.cse74 (+ (select (select .cse7 .cse75) .cse76) 4))) (let ((.cse72 (select (select .cse4 .cse3) .cse74)) (.cse73 (+ (select (select .cse7 .cse3) .cse74) 4))) (let ((.cse69 (select (select .cse4 .cse72) .cse73)) (.cse70 (+ (select (select .cse7 .cse72) .cse73) 4))) (let ((.cse0 (select (select .cse4 .cse69) .cse70))) (or (= .cse0 0) (not (= (select .cse1 .cse2) 0)) (= .cse3 0) (not (= (let ((.cse68 (+ (select (select .cse7 .cse69) .cse70) 4))) (let ((.cse66 (select (select .cse4 .cse0) .cse68)) (.cse67 (+ (select (select .cse7 .cse0) .cse68) 4))) (let ((.cse64 (select (select .cse4 .cse66) .cse67)) (.cse65 (+ (select (select .cse7 .cse66) .cse67) 4))) (let ((.cse62 (select (select .cse4 .cse64) .cse65)) (.cse63 (+ 4 (select (select .cse7 .cse64) .cse65)))) (let ((.cse60 (select (select .cse4 .cse62) .cse63)) (.cse61 (+ (select (select .cse7 .cse62) .cse63) 4))) (let ((.cse58 (select (select .cse4 .cse60) .cse61)) (.cse59 (+ 4 (select (select .cse7 .cse60) .cse61)))) (let ((.cse56 (select (select .cse4 .cse58) .cse59)) (.cse57 (+ (select (select .cse7 .cse58) .cse59) 4))) (let ((.cse54 (select (select .cse4 .cse56) .cse57)) (.cse55 (+ (select (select .cse7 .cse56) .cse57) 4))) (let ((.cse52 (select (select .cse4 .cse54) .cse55)) (.cse53 (+ (select (select .cse7 .cse54) .cse55) 4))) (let ((.cse50 (select (select .cse4 .cse52) .cse53)) (.cse51 (+ 4 (select (select .cse7 .cse52) .cse53)))) (let ((.cse48 (select (select .cse4 .cse50) .cse51)) (.cse49 (+ (select (select .cse7 .cse50) .cse51) 4))) (let ((.cse46 (select (select .cse4 .cse48) .cse49)) (.cse47 (+ 4 (select (select .cse7 .cse48) .cse49)))) (let ((.cse44 (select (select .cse4 .cse46) .cse47)) (.cse45 (+ (select (select .cse7 .cse46) .cse47) 4))) (let ((.cse42 (select (select .cse4 .cse44) .cse45)) (.cse43 (+ 4 (select (select .cse7 .cse44) .cse45)))) (let ((.cse40 (select (select .cse4 .cse42) .cse43)) (.cse41 (+ 4 (select (select .cse7 .cse42) .cse43)))) (let ((.cse38 (select (select .cse4 .cse40) .cse41)) (.cse39 (+ (select (select .cse7 .cse40) .cse41) 4))) (let ((.cse36 (select (select .cse4 .cse38) .cse39)) (.cse37 (+ (select (select .cse7 .cse38) .cse39) 4))) (let ((.cse34 (select (select .cse4 .cse36) .cse37)) (.cse35 (+ (select (select .cse7 .cse36) .cse37) 4))) (let ((.cse32 (select (select .cse4 .cse34) .cse35)) (.cse33 (+ (select (select .cse7 .cse34) .cse35) 4))) (let ((.cse30 (select (select .cse4 .cse32) .cse33)) (.cse31 (+ (select (select .cse7 .cse32) .cse33) 4))) (let ((.cse28 (select (select .cse4 .cse30) .cse31)) (.cse29 (+ (select (select .cse7 .cse30) .cse31) 4))) (let ((.cse26 (select (select .cse4 .cse28) .cse29)) (.cse27 (+ (select (select .cse7 .cse28) .cse29) 4))) (let ((.cse24 (select (select .cse4 .cse26) .cse27)) (.cse25 (+ 4 (select (select .cse7 .cse26) .cse27)))) (let ((.cse22 (select (select .cse4 .cse24) .cse25)) (.cse23 (+ (select (select .cse7 .cse24) .cse25) 4))) (let ((.cse20 (select (select .cse4 .cse22) .cse23)) (.cse21 (+ 4 (select (select .cse7 .cse22) .cse23)))) (let ((.cse18 (select (select .cse4 .cse20) .cse21)) (.cse19 (+ 4 (select (select .cse7 .cse20) .cse21)))) (let ((.cse16 (select (select .cse4 .cse18) .cse19)) (.cse17 (+ (select (select .cse7 .cse18) .cse19) 4))) (let ((.cse14 (select (select .cse4 .cse16) .cse17)) (.cse15 (+ (select (select .cse7 .cse16) .cse17) 4))) (let ((.cse12 (select (select .cse4 .cse14) .cse15)) (.cse13 (+ (select (select .cse7 .cse14) .cse15) 4))) (let ((.cse10 (select (select .cse4 .cse12) .cse13)) (.cse11 (+ (select (select .cse7 .cse12) .cse13) 4))) (let ((.cse8 (select (select .cse4 .cse10) .cse11)) (.cse9 (+ (select (select .cse7 .cse10) .cse11) 4))) (let ((.cse5 (select (select .cse4 .cse8) .cse9)) (.cse6 (+ (select (select .cse7 .cse8) .cse9) 4))) (select (select .cse4 (select (select .cse4 .cse5) .cse6)) (+ (select (select .cse7 .cse5) .cse6) 4)))))))))))))))))))))))))))))))))) 0)) (= .cse71 0)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| Int)) (or (forall ((v_ArrVal_2907 Int) (v_DerPreprocessor_2 Int)) (let ((.cse161 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_DerPreprocessor_2)))) (let ((.cse86 (select (select .cse161 .cse81) .cse82)) (.cse159 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_ArrVal_2907)))) (let ((.cse162 (select (select .cse159 .cse81) .cse82)) (.cse163 (+ .cse86 4))) (let ((.cse160 (select (select .cse159 .cse162) .cse163))) (let ((.cse84 (select .cse159 .cse160)) (.cse85 (+ (select (select .cse161 .cse162) .cse163) 4))) (let ((.cse91 (store .cse161 .cse160 (store (select .cse161 .cse160) .cse85 0))) (.cse88 (store .cse159 .cse160 (store .cse84 .cse85 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|)))) (let ((.cse87 (select (select .cse88 .cse75) .cse76)) (.cse158 (+ (select (select .cse91 .cse75) .cse76) 4))) (let ((.cse156 (select (select .cse88 .cse87) .cse158)) (.cse157 (+ (select (select .cse91 .cse87) .cse158) 4))) (let ((.cse154 (select (select .cse88 .cse156) .cse157)) (.cse155 (+ (select (select .cse91 .cse156) .cse157) 4))) (let ((.cse83 (select (select .cse91 .cse154) .cse155))) (or (= .cse83 0) (not (= (select .cse84 .cse85) 0)) (= .cse86 0) (= .cse87 0) (not (= (let ((.cse152 (select (select .cse88 .cse154) .cse155)) (.cse153 (+ .cse83 4))) (let ((.cse150 (select (select .cse88 .cse152) .cse153)) (.cse151 (+ (select (select .cse91 .cse152) .cse153) 4))) (let ((.cse148 (select (select .cse88 .cse150) .cse151)) (.cse149 (+ (select (select .cse91 .cse150) .cse151) 4))) (let ((.cse146 (select (select .cse88 .cse148) .cse149)) (.cse147 (+ 4 (select (select .cse91 .cse148) .cse149)))) (let ((.cse144 (select (select .cse88 .cse146) .cse147)) (.cse145 (+ (select (select .cse91 .cse146) .cse147) 4))) (let ((.cse142 (select (select .cse88 .cse144) .cse145)) (.cse143 (+ 4 (select (select .cse91 .cse144) .cse145)))) (let ((.cse140 (select (select .cse88 .cse142) .cse143)) (.cse141 (+ (select (select .cse91 .cse142) .cse143) 4))) (let ((.cse138 (select (select .cse88 .cse140) .cse141)) (.cse139 (+ (select (select .cse91 .cse140) .cse141) 4))) (let ((.cse136 (select (select .cse88 .cse138) .cse139)) (.cse137 (+ (select (select .cse91 .cse138) .cse139) 4))) (let ((.cse134 (select (select .cse88 .cse136) .cse137)) (.cse135 (+ 4 (select (select .cse91 .cse136) .cse137)))) (let ((.cse132 (select (select .cse88 .cse134) .cse135)) (.cse133 (+ (select (select .cse91 .cse134) .cse135) 4))) (let ((.cse130 (select (select .cse88 .cse132) .cse133)) (.cse131 (+ 4 (select (select .cse91 .cse132) .cse133)))) (let ((.cse128 (select (select .cse88 .cse130) .cse131)) (.cse129 (+ (select (select .cse91 .cse130) .cse131) 4))) (let ((.cse126 (select (select .cse88 .cse128) .cse129)) (.cse127 (+ 4 (select (select .cse91 .cse128) .cse129)))) (let ((.cse124 (select (select .cse88 .cse126) .cse127)) (.cse125 (+ 4 (select (select .cse91 .cse126) .cse127)))) (let ((.cse122 (select (select .cse88 .cse124) .cse125)) (.cse123 (+ (select (select .cse91 .cse124) .cse125) 4))) (let ((.cse120 (select (select .cse88 .cse122) .cse123)) (.cse121 (+ (select (select .cse91 .cse122) .cse123) 4))) (let ((.cse118 (select (select .cse88 .cse120) .cse121)) (.cse119 (+ (select (select .cse91 .cse120) .cse121) 4))) (let ((.cse116 (select (select .cse88 .cse118) .cse119)) (.cse117 (+ (select (select .cse91 .cse118) .cse119) 4))) (let ((.cse114 (select (select .cse88 .cse116) .cse117)) (.cse115 (+ (select (select .cse91 .cse116) .cse117) 4))) (let ((.cse112 (select (select .cse88 .cse114) .cse115)) (.cse113 (+ (select (select .cse91 .cse114) .cse115) 4))) (let ((.cse110 (select (select .cse88 .cse112) .cse113)) (.cse111 (+ (select (select .cse91 .cse112) .cse113) 4))) (let ((.cse108 (select (select .cse88 .cse110) .cse111)) (.cse109 (+ 4 (select (select .cse91 .cse110) .cse111)))) (let ((.cse106 (select (select .cse88 .cse108) .cse109)) (.cse107 (+ (select (select .cse91 .cse108) .cse109) 4))) (let ((.cse104 (select (select .cse88 .cse106) .cse107)) (.cse105 (+ 4 (select (select .cse91 .cse106) .cse107)))) (let ((.cse102 (select (select .cse88 .cse104) .cse105)) (.cse103 (+ 4 (select (select .cse91 .cse104) .cse105)))) (let ((.cse100 (select (select .cse88 .cse102) .cse103)) (.cse101 (+ (select (select .cse91 .cse102) .cse103) 4))) (let ((.cse98 (select (select .cse88 .cse100) .cse101)) (.cse99 (+ (select (select .cse91 .cse100) .cse101) 4))) (let ((.cse96 (select (select .cse88 .cse98) .cse99)) (.cse97 (+ (select (select .cse91 .cse98) .cse99) 4))) (let ((.cse94 (select (select .cse88 .cse96) .cse97)) (.cse95 (+ (select (select .cse91 .cse96) .cse97) 4))) (let ((.cse92 (select (select .cse88 .cse94) .cse95)) (.cse93 (+ (select (select .cse91 .cse94) .cse95) 4))) (let ((.cse89 (select (select .cse88 .cse92) .cse93)) (.cse90 (+ (select (select .cse91 .cse92) .cse93) 4))) (select (select .cse88 (select (select .cse88 .cse89) .cse90)) (+ (select (select .cse91 .cse89) .cse90) 4)))))))))))))))))))))))))))))))))) 0)))))))))))))) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| Int)) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| 0) (forall ((v_ArrVal_2907 Int) (v_DerPreprocessor_2 Int)) (let ((.cse242 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_DerPreprocessor_2)))) (let ((.cse167 (select (select .cse242 .cse81) .cse82)) (.cse240 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_ArrVal_2907)))) (let ((.cse243 (select (select .cse240 .cse81) .cse82)) (.cse244 (+ .cse167 4))) (let ((.cse166 (+ (select (select .cse242 .cse243) .cse244) 4)) (.cse241 (select (select .cse240 .cse243) .cse244))) (let ((.cse165 (select .cse240 .cse241)) (.cse172 (store .cse242 .cse241 (store (select .cse242 .cse241) .cse166 0)))) (let ((.cse168 (select (select .cse172 .cse75) .cse76)) (.cse169 (store .cse240 .cse241 (store .cse165 .cse166 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|)))) (let ((.cse238 (select (select .cse169 .cse75) .cse76)) (.cse239 (+ .cse168 4))) (let ((.cse236 (select (select .cse169 .cse238) .cse239)) (.cse237 (+ (select (select .cse172 .cse238) .cse239) 4))) (let ((.cse234 (select (select .cse169 .cse236) .cse237)) (.cse235 (+ (select (select .cse172 .cse236) .cse237) 4))) (let ((.cse164 (select (select .cse169 .cse234) .cse235))) (or (= .cse164 0) (not (= (select .cse165 .cse166) 0)) (= .cse167 0) (= .cse168 0) (not (= (let ((.cse233 (+ (select (select .cse172 .cse234) .cse235) 4))) (let ((.cse231 (select (select .cse169 .cse164) .cse233)) (.cse232 (+ (select (select .cse172 .cse164) .cse233) 4))) (let ((.cse229 (select (select .cse169 .cse231) .cse232)) (.cse230 (+ (select (select .cse172 .cse231) .cse232) 4))) (let ((.cse227 (select (select .cse169 .cse229) .cse230)) (.cse228 (+ 4 (select (select .cse172 .cse229) .cse230)))) (let ((.cse225 (select (select .cse169 .cse227) .cse228)) (.cse226 (+ (select (select .cse172 .cse227) .cse228) 4))) (let ((.cse223 (select (select .cse169 .cse225) .cse226)) (.cse224 (+ 4 (select (select .cse172 .cse225) .cse226)))) (let ((.cse221 (select (select .cse169 .cse223) .cse224)) (.cse222 (+ (select (select .cse172 .cse223) .cse224) 4))) (let ((.cse219 (select (select .cse169 .cse221) .cse222)) (.cse220 (+ (select (select .cse172 .cse221) .cse222) 4))) (let ((.cse217 (select (select .cse169 .cse219) .cse220)) (.cse218 (+ (select (select .cse172 .cse219) .cse220) 4))) (let ((.cse215 (select (select .cse169 .cse217) .cse218)) (.cse216 (+ 4 (select (select .cse172 .cse217) .cse218)))) (let ((.cse213 (select (select .cse169 .cse215) .cse216)) (.cse214 (+ (select (select .cse172 .cse215) .cse216) 4))) (let ((.cse211 (select (select .cse169 .cse213) .cse214)) (.cse212 (+ 4 (select (select .cse172 .cse213) .cse214)))) (let ((.cse209 (select (select .cse169 .cse211) .cse212)) (.cse210 (+ (select (select .cse172 .cse211) .cse212) 4))) (let ((.cse207 (select (select .cse169 .cse209) .cse210)) (.cse208 (+ 4 (select (select .cse172 .cse209) .cse210)))) (let ((.cse205 (select (select .cse169 .cse207) .cse208)) (.cse206 (+ 4 (select (select .cse172 .cse207) .cse208)))) (let ((.cse203 (select (select .cse169 .cse205) .cse206)) (.cse204 (+ (select (select .cse172 .cse205) .cse206) 4))) (let ((.cse201 (select (select .cse169 .cse203) .cse204)) (.cse202 (+ (select (select .cse172 .cse203) .cse204) 4))) (let ((.cse199 (select (select .cse169 .cse201) .cse202)) (.cse200 (+ (select (select .cse172 .cse201) .cse202) 4))) (let ((.cse197 (select (select .cse169 .cse199) .cse200)) (.cse198 (+ (select (select .cse172 .cse199) .cse200) 4))) (let ((.cse195 (select (select .cse169 .cse197) .cse198)) (.cse196 (+ (select (select .cse172 .cse197) .cse198) 4))) (let ((.cse193 (select (select .cse169 .cse195) .cse196)) (.cse194 (+ (select (select .cse172 .cse195) .cse196) 4))) (let ((.cse191 (select (select .cse169 .cse193) .cse194)) (.cse192 (+ (select (select .cse172 .cse193) .cse194) 4))) (let ((.cse189 (select (select .cse169 .cse191) .cse192)) (.cse190 (+ 4 (select (select .cse172 .cse191) .cse192)))) (let ((.cse187 (select (select .cse169 .cse189) .cse190)) (.cse188 (+ (select (select .cse172 .cse189) .cse190) 4))) (let ((.cse185 (select (select .cse169 .cse187) .cse188)) (.cse186 (+ 4 (select (select .cse172 .cse187) .cse188)))) (let ((.cse183 (select (select .cse169 .cse185) .cse186)) (.cse184 (+ 4 (select (select .cse172 .cse185) .cse186)))) (let ((.cse181 (select (select .cse169 .cse183) .cse184)) (.cse182 (+ (select (select .cse172 .cse183) .cse184) 4))) (let ((.cse179 (select (select .cse169 .cse181) .cse182)) (.cse180 (+ (select (select .cse172 .cse181) .cse182) 4))) (let ((.cse177 (select (select .cse169 .cse179) .cse180)) (.cse178 (+ (select (select .cse172 .cse179) .cse180) 4))) (let ((.cse175 (select (select .cse169 .cse177) .cse178)) (.cse176 (+ (select (select .cse172 .cse177) .cse178) 4))) (let ((.cse173 (select (select .cse169 .cse175) .cse176)) (.cse174 (+ (select (select .cse172 .cse175) .cse176) 4))) (let ((.cse170 (select (select .cse169 .cse173) .cse174)) (.cse171 (+ (select (select .cse172 .cse173) .cse174) 4))) (select (select .cse169 (select (select .cse169 .cse170) .cse171)) (+ (select (select .cse172 .cse170) .cse171) 4)))))))))))))))))))))))))))))))))) 0)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| Int)) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| 0) (forall ((v_ArrVal_2907 Int) (v_DerPreprocessor_2 Int)) (let ((.cse322 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_DerPreprocessor_2)))) (let ((.cse248 (select (select .cse322 .cse81) .cse82)) (.cse320 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_ArrVal_2907)))) (let ((.cse323 (select (select .cse320 .cse81) .cse82)) (.cse324 (+ .cse248 4))) (let ((.cse321 (select (select .cse320 .cse323) .cse324))) (let ((.cse246 (select .cse320 .cse321)) (.cse247 (+ (select (select .cse322 .cse323) .cse324) 4))) (let ((.cse253 (store .cse322 .cse321 (store (select .cse322 .cse321) .cse247 0))) (.cse250 (store .cse320 .cse321 (store .cse246 .cse247 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|)))) (let ((.cse249 (select (select .cse250 .cse75) .cse76)) (.cse319 (+ (select (select .cse253 .cse75) .cse76) 4))) (let ((.cse317 (select (select .cse250 .cse249) .cse319)) (.cse318 (+ (select (select .cse253 .cse249) .cse319) 4))) (let ((.cse315 (select (select .cse250 .cse317) .cse318)) (.cse316 (+ (select (select .cse253 .cse317) .cse318) 4))) (let ((.cse245 (select (select .cse250 .cse315) .cse316))) (or (= .cse245 0) (not (= (select .cse246 .cse247) 0)) (= .cse248 0) (= .cse249 0) (not (= (let ((.cse314 (+ (select (select .cse253 .cse315) .cse316) 4))) (let ((.cse312 (select (select .cse250 .cse245) .cse314)) (.cse313 (+ (select (select .cse253 .cse245) .cse314) 4))) (let ((.cse310 (select (select .cse250 .cse312) .cse313)) (.cse311 (+ (select (select .cse253 .cse312) .cse313) 4))) (let ((.cse308 (select (select .cse250 .cse310) .cse311)) (.cse309 (+ 4 (select (select .cse253 .cse310) .cse311)))) (let ((.cse306 (select (select .cse250 .cse308) .cse309)) (.cse307 (+ (select (select .cse253 .cse308) .cse309) 4))) (let ((.cse304 (select (select .cse250 .cse306) .cse307)) (.cse305 (+ 4 (select (select .cse253 .cse306) .cse307)))) (let ((.cse302 (select (select .cse250 .cse304) .cse305)) (.cse303 (+ (select (select .cse253 .cse304) .cse305) 4))) (let ((.cse300 (select (select .cse250 .cse302) .cse303)) (.cse301 (+ (select (select .cse253 .cse302) .cse303) 4))) (let ((.cse298 (select (select .cse250 .cse300) .cse301)) (.cse299 (+ (select (select .cse253 .cse300) .cse301) 4))) (let ((.cse296 (select (select .cse250 .cse298) .cse299)) (.cse297 (+ 4 (select (select .cse253 .cse298) .cse299)))) (let ((.cse294 (select (select .cse250 .cse296) .cse297)) (.cse295 (+ (select (select .cse253 .cse296) .cse297) 4))) (let ((.cse292 (select (select .cse250 .cse294) .cse295)) (.cse293 (+ 4 (select (select .cse253 .cse294) .cse295)))) (let ((.cse290 (select (select .cse250 .cse292) .cse293)) (.cse291 (+ (select (select .cse253 .cse292) .cse293) 4))) (let ((.cse288 (select (select .cse250 .cse290) .cse291)) (.cse289 (+ 4 (select (select .cse253 .cse290) .cse291)))) (let ((.cse286 (select (select .cse250 .cse288) .cse289)) (.cse287 (+ 4 (select (select .cse253 .cse288) .cse289)))) (let ((.cse284 (select (select .cse250 .cse286) .cse287)) (.cse285 (+ (select (select .cse253 .cse286) .cse287) 4))) (let ((.cse282 (select (select .cse250 .cse284) .cse285)) (.cse283 (+ (select (select .cse253 .cse284) .cse285) 4))) (let ((.cse280 (select (select .cse250 .cse282) .cse283)) (.cse281 (+ (select (select .cse253 .cse282) .cse283) 4))) (let ((.cse278 (select (select .cse250 .cse280) .cse281)) (.cse279 (+ (select (select .cse253 .cse280) .cse281) 4))) (let ((.cse276 (select (select .cse250 .cse278) .cse279)) (.cse277 (+ (select (select .cse253 .cse278) .cse279) 4))) (let ((.cse274 (select (select .cse250 .cse276) .cse277)) (.cse275 (+ (select (select .cse253 .cse276) .cse277) 4))) (let ((.cse272 (select (select .cse250 .cse274) .cse275)) (.cse273 (+ (select (select .cse253 .cse274) .cse275) 4))) (let ((.cse270 (select (select .cse250 .cse272) .cse273)) (.cse271 (+ 4 (select (select .cse253 .cse272) .cse273)))) (let ((.cse268 (select (select .cse250 .cse270) .cse271)) (.cse269 (+ (select (select .cse253 .cse270) .cse271) 4))) (let ((.cse266 (select (select .cse250 .cse268) .cse269)) (.cse267 (+ 4 (select (select .cse253 .cse268) .cse269)))) (let ((.cse264 (select (select .cse250 .cse266) .cse267)) (.cse265 (+ 4 (select (select .cse253 .cse266) .cse267)))) (let ((.cse262 (select (select .cse250 .cse264) .cse265)) (.cse263 (+ (select (select .cse253 .cse264) .cse265) 4))) (let ((.cse260 (select (select .cse250 .cse262) .cse263)) (.cse261 (+ (select (select .cse253 .cse262) .cse263) 4))) (let ((.cse258 (select (select .cse250 .cse260) .cse261)) (.cse259 (+ (select (select .cse253 .cse260) .cse261) 4))) (let ((.cse256 (select (select .cse250 .cse258) .cse259)) (.cse257 (+ (select (select .cse253 .cse258) .cse259) 4))) (let ((.cse254 (select (select .cse250 .cse256) .cse257)) (.cse255 (+ (select (select .cse253 .cse256) .cse257) 4))) (let ((.cse251 (select (select .cse250 .cse254) .cse255)) (.cse252 (+ (select (select .cse253 .cse254) .cse255) 4))) (select (select .cse250 (select (select .cse250 .cse251) .cse252)) (+ (select (select .cse253 .cse251) .cse252) 4)))))))))))))))))))))))))))))))))) 0)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| Int)) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| 0) (forall ((v_ArrVal_2907 Int) (v_DerPreprocessor_2 Int)) (let ((.cse403 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_DerPreprocessor_2))) (.cse401 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_ArrVal_2907)))) (let ((.cse397 (select (select .cse401 .cse81) .cse82)) (.cse404 (+ (select (select .cse403 .cse81) .cse82) 4))) (let ((.cse402 (select (select .cse401 .cse397) .cse404))) (let ((.cse326 (select .cse401 .cse402)) (.cse327 (+ (select (select .cse403 .cse397) .cse404) 4))) (let ((.cse332 (store .cse403 .cse402 (store (select .cse403 .cse402) .cse327 0))) (.cse329 (store .cse401 .cse402 (store .cse326 .cse327 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|)))) (let ((.cse328 (select (select .cse329 .cse75) .cse76)) (.cse400 (+ (select (select .cse332 .cse75) .cse76) 4))) (let ((.cse398 (select (select .cse329 .cse328) .cse400)) (.cse399 (+ (select (select .cse332 .cse328) .cse400) 4))) (let ((.cse395 (select (select .cse329 .cse398) .cse399)) (.cse396 (+ (select (select .cse332 .cse398) .cse399) 4))) (let ((.cse325 (select (select .cse332 .cse395) .cse396))) (or (= .cse325 0) (not (= (select .cse326 .cse327) 0)) (= .cse328 0) (not (= (let ((.cse393 (select (select .cse329 .cse395) .cse396)) (.cse394 (+ .cse325 4))) (let ((.cse391 (select (select .cse329 .cse393) .cse394)) (.cse392 (+ (select (select .cse332 .cse393) .cse394) 4))) (let ((.cse389 (select (select .cse329 .cse391) .cse392)) (.cse390 (+ (select (select .cse332 .cse391) .cse392) 4))) (let ((.cse387 (select (select .cse329 .cse389) .cse390)) (.cse388 (+ 4 (select (select .cse332 .cse389) .cse390)))) (let ((.cse385 (select (select .cse329 .cse387) .cse388)) (.cse386 (+ (select (select .cse332 .cse387) .cse388) 4))) (let ((.cse383 (select (select .cse329 .cse385) .cse386)) (.cse384 (+ 4 (select (select .cse332 .cse385) .cse386)))) (let ((.cse381 (select (select .cse329 .cse383) .cse384)) (.cse382 (+ (select (select .cse332 .cse383) .cse384) 4))) (let ((.cse379 (select (select .cse329 .cse381) .cse382)) (.cse380 (+ (select (select .cse332 .cse381) .cse382) 4))) (let ((.cse377 (select (select .cse329 .cse379) .cse380)) (.cse378 (+ (select (select .cse332 .cse379) .cse380) 4))) (let ((.cse375 (select (select .cse329 .cse377) .cse378)) (.cse376 (+ 4 (select (select .cse332 .cse377) .cse378)))) (let ((.cse373 (select (select .cse329 .cse375) .cse376)) (.cse374 (+ (select (select .cse332 .cse375) .cse376) 4))) (let ((.cse371 (select (select .cse329 .cse373) .cse374)) (.cse372 (+ 4 (select (select .cse332 .cse373) .cse374)))) (let ((.cse369 (select (select .cse329 .cse371) .cse372)) (.cse370 (+ (select (select .cse332 .cse371) .cse372) 4))) (let ((.cse367 (select (select .cse329 .cse369) .cse370)) (.cse368 (+ 4 (select (select .cse332 .cse369) .cse370)))) (let ((.cse365 (select (select .cse329 .cse367) .cse368)) (.cse366 (+ 4 (select (select .cse332 .cse367) .cse368)))) (let ((.cse363 (select (select .cse329 .cse365) .cse366)) (.cse364 (+ (select (select .cse332 .cse365) .cse366) 4))) (let ((.cse361 (select (select .cse329 .cse363) .cse364)) (.cse362 (+ (select (select .cse332 .cse363) .cse364) 4))) (let ((.cse359 (select (select .cse329 .cse361) .cse362)) (.cse360 (+ (select (select .cse332 .cse361) .cse362) 4))) (let ((.cse357 (select (select .cse329 .cse359) .cse360)) (.cse358 (+ (select (select .cse332 .cse359) .cse360) 4))) (let ((.cse355 (select (select .cse329 .cse357) .cse358)) (.cse356 (+ (select (select .cse332 .cse357) .cse358) 4))) (let ((.cse353 (select (select .cse329 .cse355) .cse356)) (.cse354 (+ (select (select .cse332 .cse355) .cse356) 4))) (let ((.cse351 (select (select .cse329 .cse353) .cse354)) (.cse352 (+ (select (select .cse332 .cse353) .cse354) 4))) (let ((.cse349 (select (select .cse329 .cse351) .cse352)) (.cse350 (+ 4 (select (select .cse332 .cse351) .cse352)))) (let ((.cse347 (select (select .cse329 .cse349) .cse350)) (.cse348 (+ (select (select .cse332 .cse349) .cse350) 4))) (let ((.cse345 (select (select .cse329 .cse347) .cse348)) (.cse346 (+ 4 (select (select .cse332 .cse347) .cse348)))) (let ((.cse343 (select (select .cse329 .cse345) .cse346)) (.cse344 (+ 4 (select (select .cse332 .cse345) .cse346)))) (let ((.cse341 (select (select .cse329 .cse343) .cse344)) (.cse342 (+ (select (select .cse332 .cse343) .cse344) 4))) (let ((.cse339 (select (select .cse329 .cse341) .cse342)) (.cse340 (+ (select (select .cse332 .cse341) .cse342) 4))) (let ((.cse337 (select (select .cse329 .cse339) .cse340)) (.cse338 (+ (select (select .cse332 .cse339) .cse340) 4))) (let ((.cse335 (select (select .cse329 .cse337) .cse338)) (.cse336 (+ (select (select .cse332 .cse337) .cse338) 4))) (let ((.cse333 (select (select .cse329 .cse335) .cse336)) (.cse334 (+ (select (select .cse332 .cse335) .cse336) 4))) (let ((.cse330 (select (select .cse329 .cse333) .cse334)) (.cse331 (+ (select (select .cse332 .cse333) .cse334) 4))) (select (select .cse329 (select (select .cse329 .cse330) .cse331)) (+ (select (select .cse332 .cse330) .cse331) 4)))))))))))))))))))))))))))))))))) 0)) (= .cse397 0)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| Int)) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 0)) (forall ((v_ArrVal_2907 Int) (v_DerPreprocessor_2 Int)) (let ((.cse484 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_DerPreprocessor_2))) (.cse482 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_ArrVal_2907)))) (let ((.cse477 (select (select .cse482 .cse81) .cse82)) (.cse485 (+ (select (select .cse484 .cse81) .cse82) 4))) (let ((.cse407 (+ (select (select .cse484 .cse477) .cse485) 4)) (.cse483 (select (select .cse482 .cse477) .cse485))) (let ((.cse406 (select .cse482 .cse483)) (.cse412 (store .cse484 .cse483 (store (select .cse484 .cse483) .cse407 0)))) (let ((.cse408 (select (select .cse412 .cse75) .cse76)) (.cse409 (store .cse482 .cse483 (store .cse406 .cse407 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|)))) (let ((.cse480 (select (select .cse409 .cse75) .cse76)) (.cse481 (+ .cse408 4))) (let ((.cse478 (select (select .cse409 .cse480) .cse481)) (.cse479 (+ (select (select .cse412 .cse480) .cse481) 4))) (let ((.cse475 (select (select .cse409 .cse478) .cse479)) (.cse476 (+ (select (select .cse412 .cse478) .cse479) 4))) (let ((.cse405 (select (select .cse412 .cse475) .cse476))) (or (= .cse405 0) (not (= (select .cse406 .cse407) 0)) (= .cse408 0) (not (= (let ((.cse473 (select (select .cse409 .cse475) .cse476)) (.cse474 (+ .cse405 4))) (let ((.cse471 (select (select .cse409 .cse473) .cse474)) (.cse472 (+ (select (select .cse412 .cse473) .cse474) 4))) (let ((.cse469 (select (select .cse409 .cse471) .cse472)) (.cse470 (+ (select (select .cse412 .cse471) .cse472) 4))) (let ((.cse467 (select (select .cse409 .cse469) .cse470)) (.cse468 (+ 4 (select (select .cse412 .cse469) .cse470)))) (let ((.cse465 (select (select .cse409 .cse467) .cse468)) (.cse466 (+ (select (select .cse412 .cse467) .cse468) 4))) (let ((.cse463 (select (select .cse409 .cse465) .cse466)) (.cse464 (+ 4 (select (select .cse412 .cse465) .cse466)))) (let ((.cse461 (select (select .cse409 .cse463) .cse464)) (.cse462 (+ (select (select .cse412 .cse463) .cse464) 4))) (let ((.cse459 (select (select .cse409 .cse461) .cse462)) (.cse460 (+ (select (select .cse412 .cse461) .cse462) 4))) (let ((.cse457 (select (select .cse409 .cse459) .cse460)) (.cse458 (+ (select (select .cse412 .cse459) .cse460) 4))) (let ((.cse455 (select (select .cse409 .cse457) .cse458)) (.cse456 (+ 4 (select (select .cse412 .cse457) .cse458)))) (let ((.cse453 (select (select .cse409 .cse455) .cse456)) (.cse454 (+ (select (select .cse412 .cse455) .cse456) 4))) (let ((.cse451 (select (select .cse409 .cse453) .cse454)) (.cse452 (+ 4 (select (select .cse412 .cse453) .cse454)))) (let ((.cse449 (select (select .cse409 .cse451) .cse452)) (.cse450 (+ (select (select .cse412 .cse451) .cse452) 4))) (let ((.cse447 (select (select .cse409 .cse449) .cse450)) (.cse448 (+ 4 (select (select .cse412 .cse449) .cse450)))) (let ((.cse445 (select (select .cse409 .cse447) .cse448)) (.cse446 (+ 4 (select (select .cse412 .cse447) .cse448)))) (let ((.cse443 (select (select .cse409 .cse445) .cse446)) (.cse444 (+ (select (select .cse412 .cse445) .cse446) 4))) (let ((.cse441 (select (select .cse409 .cse443) .cse444)) (.cse442 (+ (select (select .cse412 .cse443) .cse444) 4))) (let ((.cse439 (select (select .cse409 .cse441) .cse442)) (.cse440 (+ (select (select .cse412 .cse441) .cse442) 4))) (let ((.cse437 (select (select .cse409 .cse439) .cse440)) (.cse438 (+ (select (select .cse412 .cse439) .cse440) 4))) (let ((.cse435 (select (select .cse409 .cse437) .cse438)) (.cse436 (+ (select (select .cse412 .cse437) .cse438) 4))) (let ((.cse433 (select (select .cse409 .cse435) .cse436)) (.cse434 (+ (select (select .cse412 .cse435) .cse436) 4))) (let ((.cse431 (select (select .cse409 .cse433) .cse434)) (.cse432 (+ (select (select .cse412 .cse433) .cse434) 4))) (let ((.cse429 (select (select .cse409 .cse431) .cse432)) (.cse430 (+ 4 (select (select .cse412 .cse431) .cse432)))) (let ((.cse427 (select (select .cse409 .cse429) .cse430)) (.cse428 (+ (select (select .cse412 .cse429) .cse430) 4))) (let ((.cse425 (select (select .cse409 .cse427) .cse428)) (.cse426 (+ 4 (select (select .cse412 .cse427) .cse428)))) (let ((.cse423 (select (select .cse409 .cse425) .cse426)) (.cse424 (+ 4 (select (select .cse412 .cse425) .cse426)))) (let ((.cse421 (select (select .cse409 .cse423) .cse424)) (.cse422 (+ (select (select .cse412 .cse423) .cse424) 4))) (let ((.cse419 (select (select .cse409 .cse421) .cse422)) (.cse420 (+ (select (select .cse412 .cse421) .cse422) 4))) (let ((.cse417 (select (select .cse409 .cse419) .cse420)) (.cse418 (+ (select (select .cse412 .cse419) .cse420) 4))) (let ((.cse415 (select (select .cse409 .cse417) .cse418)) (.cse416 (+ (select (select .cse412 .cse417) .cse418) 4))) (let ((.cse413 (select (select .cse409 .cse415) .cse416)) (.cse414 (+ (select (select .cse412 .cse415) .cse416) 4))) (let ((.cse410 (select (select .cse409 .cse413) .cse414)) (.cse411 (+ (select (select .cse412 .cse413) .cse414) 4))) (select (select .cse409 (select (select .cse409 .cse410) .cse411)) (+ (select (select .cse412 .cse410) .cse411) 4)))))))))))))))))))))))))))))))))) 0)) (= .cse477 0)))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| Int)) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| 0) (forall ((v_ArrVal_2907 Int) (v_DerPreprocessor_2 Int)) (let ((.cse564 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_DerPreprocessor_2))) (.cse562 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_ArrVal_2907)))) (let ((.cse557 (select (select .cse562 .cse81) .cse82)) (.cse565 (+ (select (select .cse564 .cse81) .cse82) 4))) (let ((.cse488 (+ (select (select .cse564 .cse557) .cse565) 4)) (.cse563 (select (select .cse562 .cse557) .cse565))) (let ((.cse487 (select .cse562 .cse563)) (.cse493 (store .cse564 .cse563 (store (select .cse564 .cse563) .cse488 0)))) (let ((.cse489 (select (select .cse493 .cse75) .cse76)) (.cse490 (store .cse562 .cse563 (store .cse487 .cse488 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|)))) (let ((.cse560 (select (select .cse490 .cse75) .cse76)) (.cse561 (+ .cse489 4))) (let ((.cse558 (select (select .cse490 .cse560) .cse561)) (.cse559 (+ (select (select .cse493 .cse560) .cse561) 4))) (let ((.cse555 (select (select .cse490 .cse558) .cse559)) (.cse556 (+ (select (select .cse493 .cse558) .cse559) 4))) (let ((.cse486 (select (select .cse490 .cse555) .cse556))) (or (= .cse486 0) (not (= (select .cse487 .cse488) 0)) (= .cse489 0) (not (= (let ((.cse554 (+ (select (select .cse493 .cse555) .cse556) 4))) (let ((.cse552 (select (select .cse490 .cse486) .cse554)) (.cse553 (+ (select (select .cse493 .cse486) .cse554) 4))) (let ((.cse550 (select (select .cse490 .cse552) .cse553)) (.cse551 (+ (select (select .cse493 .cse552) .cse553) 4))) (let ((.cse548 (select (select .cse490 .cse550) .cse551)) (.cse549 (+ 4 (select (select .cse493 .cse550) .cse551)))) (let ((.cse546 (select (select .cse490 .cse548) .cse549)) (.cse547 (+ (select (select .cse493 .cse548) .cse549) 4))) (let ((.cse544 (select (select .cse490 .cse546) .cse547)) (.cse545 (+ 4 (select (select .cse493 .cse546) .cse547)))) (let ((.cse542 (select (select .cse490 .cse544) .cse545)) (.cse543 (+ (select (select .cse493 .cse544) .cse545) 4))) (let ((.cse540 (select (select .cse490 .cse542) .cse543)) (.cse541 (+ (select (select .cse493 .cse542) .cse543) 4))) (let ((.cse538 (select (select .cse490 .cse540) .cse541)) (.cse539 (+ (select (select .cse493 .cse540) .cse541) 4))) (let ((.cse536 (select (select .cse490 .cse538) .cse539)) (.cse537 (+ 4 (select (select .cse493 .cse538) .cse539)))) (let ((.cse534 (select (select .cse490 .cse536) .cse537)) (.cse535 (+ (select (select .cse493 .cse536) .cse537) 4))) (let ((.cse532 (select (select .cse490 .cse534) .cse535)) (.cse533 (+ 4 (select (select .cse493 .cse534) .cse535)))) (let ((.cse530 (select (select .cse490 .cse532) .cse533)) (.cse531 (+ (select (select .cse493 .cse532) .cse533) 4))) (let ((.cse528 (select (select .cse490 .cse530) .cse531)) (.cse529 (+ 4 (select (select .cse493 .cse530) .cse531)))) (let ((.cse526 (select (select .cse490 .cse528) .cse529)) (.cse527 (+ 4 (select (select .cse493 .cse528) .cse529)))) (let ((.cse524 (select (select .cse490 .cse526) .cse527)) (.cse525 (+ (select (select .cse493 .cse526) .cse527) 4))) (let ((.cse522 (select (select .cse490 .cse524) .cse525)) (.cse523 (+ (select (select .cse493 .cse524) .cse525) 4))) (let ((.cse520 (select (select .cse490 .cse522) .cse523)) (.cse521 (+ (select (select .cse493 .cse522) .cse523) 4))) (let ((.cse518 (select (select .cse490 .cse520) .cse521)) (.cse519 (+ (select (select .cse493 .cse520) .cse521) 4))) (let ((.cse516 (select (select .cse490 .cse518) .cse519)) (.cse517 (+ (select (select .cse493 .cse518) .cse519) 4))) (let ((.cse514 (select (select .cse490 .cse516) .cse517)) (.cse515 (+ (select (select .cse493 .cse516) .cse517) 4))) (let ((.cse512 (select (select .cse490 .cse514) .cse515)) (.cse513 (+ (select (select .cse493 .cse514) .cse515) 4))) (let ((.cse510 (select (select .cse490 .cse512) .cse513)) (.cse511 (+ 4 (select (select .cse493 .cse512) .cse513)))) (let ((.cse508 (select (select .cse490 .cse510) .cse511)) (.cse509 (+ (select (select .cse493 .cse510) .cse511) 4))) (let ((.cse506 (select (select .cse490 .cse508) .cse509)) (.cse507 (+ 4 (select (select .cse493 .cse508) .cse509)))) (let ((.cse504 (select (select .cse490 .cse506) .cse507)) (.cse505 (+ 4 (select (select .cse493 .cse506) .cse507)))) (let ((.cse502 (select (select .cse490 .cse504) .cse505)) (.cse503 (+ (select (select .cse493 .cse504) .cse505) 4))) (let ((.cse500 (select (select .cse490 .cse502) .cse503)) (.cse501 (+ (select (select .cse493 .cse502) .cse503) 4))) (let ((.cse498 (select (select .cse490 .cse500) .cse501)) (.cse499 (+ (select (select .cse493 .cse500) .cse501) 4))) (let ((.cse496 (select (select .cse490 .cse498) .cse499)) (.cse497 (+ (select (select .cse493 .cse498) .cse499) 4))) (let ((.cse494 (select (select .cse490 .cse496) .cse497)) (.cse495 (+ (select (select .cse493 .cse496) .cse497) 4))) (let ((.cse491 (select (select .cse490 .cse494) .cse495)) (.cse492 (+ (select (select .cse493 .cse494) .cse495) 4))) (select (select .cse490 (select (select .cse490 .cse491) .cse492)) (+ (select (select .cse493 .cse491) .cse492) 4)))))))))))))))))))))))))))))))))) 0)) (= .cse557 0)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| Int)) (or (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| 0) (forall ((v_ArrVal_2907 Int) (v_DerPreprocessor_2 Int)) (let ((.cse645 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_DerPreprocessor_2)))) (let ((.cse569 (select (select .cse645 .cse81) .cse82)) (.cse643 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 4 0) 0 v_ArrVal_2907)))) (let ((.cse646 (select (select .cse643 .cse81) .cse82)) (.cse647 (+ .cse569 4))) (let ((.cse568 (+ (select (select .cse645 .cse646) .cse647) 4)) (.cse644 (select (select .cse643 .cse646) .cse647))) (let ((.cse567 (select .cse643 .cse644)) (.cse574 (store .cse645 .cse644 (store (select .cse645 .cse644) .cse568 0)))) (let ((.cse570 (select (select .cse574 .cse75) .cse76)) (.cse571 (store .cse643 .cse644 (store .cse567 .cse568 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|)))) (let ((.cse641 (select (select .cse571 .cse75) .cse76)) (.cse642 (+ .cse570 4))) (let ((.cse639 (select (select .cse571 .cse641) .cse642)) (.cse640 (+ (select (select .cse574 .cse641) .cse642) 4))) (let ((.cse637 (select (select .cse571 .cse639) .cse640)) (.cse638 (+ (select (select .cse574 .cse639) .cse640) 4))) (let ((.cse566 (select (select .cse574 .cse637) .cse638))) (or (= .cse566 0) (not (= (select .cse567 .cse568) 0)) (= .cse569 0) (= .cse570 0) (not (= (let ((.cse635 (select (select .cse571 .cse637) .cse638)) (.cse636 (+ .cse566 4))) (let ((.cse633 (select (select .cse571 .cse635) .cse636)) (.cse634 (+ (select (select .cse574 .cse635) .cse636) 4))) (let ((.cse631 (select (select .cse571 .cse633) .cse634)) (.cse632 (+ (select (select .cse574 .cse633) .cse634) 4))) (let ((.cse629 (select (select .cse571 .cse631) .cse632)) (.cse630 (+ 4 (select (select .cse574 .cse631) .cse632)))) (let ((.cse627 (select (select .cse571 .cse629) .cse630)) (.cse628 (+ (select (select .cse574 .cse629) .cse630) 4))) (let ((.cse625 (select (select .cse571 .cse627) .cse628)) (.cse626 (+ 4 (select (select .cse574 .cse627) .cse628)))) (let ((.cse623 (select (select .cse571 .cse625) .cse626)) (.cse624 (+ (select (select .cse574 .cse625) .cse626) 4))) (let ((.cse621 (select (select .cse571 .cse623) .cse624)) (.cse622 (+ (select (select .cse574 .cse623) .cse624) 4))) (let ((.cse619 (select (select .cse571 .cse621) .cse622)) (.cse620 (+ (select (select .cse574 .cse621) .cse622) 4))) (let ((.cse617 (select (select .cse571 .cse619) .cse620)) (.cse618 (+ 4 (select (select .cse574 .cse619) .cse620)))) (let ((.cse615 (select (select .cse571 .cse617) .cse618)) (.cse616 (+ (select (select .cse574 .cse617) .cse618) 4))) (let ((.cse613 (select (select .cse571 .cse615) .cse616)) (.cse614 (+ 4 (select (select .cse574 .cse615) .cse616)))) (let ((.cse611 (select (select .cse571 .cse613) .cse614)) (.cse612 (+ (select (select .cse574 .cse613) .cse614) 4))) (let ((.cse609 (select (select .cse571 .cse611) .cse612)) (.cse610 (+ 4 (select (select .cse574 .cse611) .cse612)))) (let ((.cse607 (select (select .cse571 .cse609) .cse610)) (.cse608 (+ 4 (select (select .cse574 .cse609) .cse610)))) (let ((.cse605 (select (select .cse571 .cse607) .cse608)) (.cse606 (+ (select (select .cse574 .cse607) .cse608) 4))) (let ((.cse603 (select (select .cse571 .cse605) .cse606)) (.cse604 (+ (select (select .cse574 .cse605) .cse606) 4))) (let ((.cse601 (select (select .cse571 .cse603) .cse604)) (.cse602 (+ (select (select .cse574 .cse603) .cse604) 4))) (let ((.cse599 (select (select .cse571 .cse601) .cse602)) (.cse600 (+ (select (select .cse574 .cse601) .cse602) 4))) (let ((.cse597 (select (select .cse571 .cse599) .cse600)) (.cse598 (+ (select (select .cse574 .cse599) .cse600) 4))) (let ((.cse595 (select (select .cse571 .cse597) .cse598)) (.cse596 (+ (select (select .cse574 .cse597) .cse598) 4))) (let ((.cse593 (select (select .cse571 .cse595) .cse596)) (.cse594 (+ (select (select .cse574 .cse595) .cse596) 4))) (let ((.cse591 (select (select .cse571 .cse593) .cse594)) (.cse592 (+ 4 (select (select .cse574 .cse593) .cse594)))) (let ((.cse589 (select (select .cse571 .cse591) .cse592)) (.cse590 (+ (select (select .cse574 .cse591) .cse592) 4))) (let ((.cse587 (select (select .cse571 .cse589) .cse590)) (.cse588 (+ 4 (select (select .cse574 .cse589) .cse590)))) (let ((.cse585 (select (select .cse571 .cse587) .cse588)) (.cse586 (+ 4 (select (select .cse574 .cse587) .cse588)))) (let ((.cse583 (select (select .cse571 .cse585) .cse586)) (.cse584 (+ (select (select .cse574 .cse585) .cse586) 4))) (let ((.cse581 (select (select .cse571 .cse583) .cse584)) (.cse582 (+ (select (select .cse574 .cse583) .cse584) 4))) (let ((.cse579 (select (select .cse571 .cse581) .cse582)) (.cse580 (+ (select (select .cse574 .cse581) .cse582) 4))) (let ((.cse577 (select (select .cse571 .cse579) .cse580)) (.cse578 (+ (select (select .cse574 .cse579) .cse580) 4))) (let ((.cse575 (select (select .cse571 .cse577) .cse578)) (.cse576 (+ (select (select .cse574 .cse577) .cse578) 4))) (let ((.cse572 (select (select .cse571 .cse575) .cse576)) (.cse573 (+ (select (select .cse574 .cse575) .cse576) 4))) (select (select .cse571 (select (select .cse571 .cse572) .cse573)) (+ (select (select .cse574 .cse572) .cse573) 4)))))))))))))))))))))))))))))))))) 0)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_39|) 0)))))) is different from true [2023-11-29 07:09:25,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258146330] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:09:25,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:09:25,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 38] total 113 [2023-11-29 07:09:25,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855168988] [2023-11-29 07:09:25,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:09:25,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 113 states [2023-11-29 07:09:25,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:09:25,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2023-11-29 07:09:25,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1819, Invalid=36796, Unknown=1, NotChecked=390, Total=39006 [2023-11-29 07:09:25,688 INFO L87 Difference]: Start difference. First operand 392 states and 429 transitions. Second operand has 113 states, 109 states have (on average 2.3944954128440368) internal successors, (261), 107 states have internal predecessors, (261), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 07:11:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:34,808 INFO L93 Difference]: Finished difference Result 764 states and 837 transitions. [2023-11-29 07:11:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2023-11-29 07:11:34,809 INFO L78 Accepts]: Start accepts. Automaton has has 113 states, 109 states have (on average 2.3944954128440368) internal successors, (261), 107 states have internal predecessors, (261), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 220 [2023-11-29 07:11:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:34,813 INFO L225 Difference]: With dead ends: 764 [2023-11-29 07:11:34,813 INFO L226 Difference]: Without dead ends: 755 [2023-11-29 07:11:34,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 271 SyntacticMatches, 31 SemanticMatches, 397 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39799 ImplicationChecksByTransitivity, 218.8s TimeCoverageRelationStatistics Valid=22180, Invalid=135829, Unknown=1, NotChecked=792, Total=158802 [2023-11-29 07:11:34,825 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 942 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:34,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 596 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 07:11:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2023-11-29 07:11:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 752. [2023-11-29 07:11:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 745 states have (on average 1.0523489932885906) internal successors, (784), 746 states have internal predecessors, (784), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:11:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 790 transitions. [2023-11-29 07:11:34,902 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 790 transitions. Word has length 220 [2023-11-29 07:11:34,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:34,903 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 790 transitions. [2023-11-29 07:11:34,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 113 states, 109 states have (on average 2.3944954128440368) internal successors, (261), 107 states have internal predecessors, (261), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 07:11:34,903 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 790 transitions. [2023-11-29 07:11:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-11-29 07:11:34,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:34,905 INFO L195 NwaCegarLoop]: trace histogram [38, 37, 37, 37, 37, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:11:34,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-29 07:11:35,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:11:35,106 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:11:35,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:35,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1306590603, now seen corresponding path program 5 times [2023-11-29 07:11:35,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:35,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761791508] [2023-11-29 07:11:35,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:35,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:38,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:11:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:11:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:38,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:11:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:11:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 07:11:38,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:11:38,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761791508] [2023-11-29 07:11:38,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761791508] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:11:38,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133000295] [2023-11-29 07:11:38,210 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 07:11:38,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:11:38,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:11:38,211 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:11:38,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-29 07:11:38,687 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2023-11-29 07:11:38,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:11:38,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-29 07:11:38,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:11:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 07:11:39,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:11:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 07:11:43,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133000295] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:11:43,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:11:43,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 77, 77] total 156 [2023-11-29 07:11:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131616009] [2023-11-29 07:11:43,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:11:43,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 157 states [2023-11-29 07:11:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:11:43,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2023-11-29 07:11:43,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6013, Invalid=18479, Unknown=0, NotChecked=0, Total=24492 [2023-11-29 07:11:43,899 INFO L87 Difference]: Start difference. First operand 752 states and 790 transitions. Second operand has 157 states, 156 states have (on average 2.621794871794872) internal successors, (409), 156 states have internal predecessors, (409), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:11:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:11:50,280 INFO L93 Difference]: Finished difference Result 957 states and 1007 transitions. [2023-11-29 07:11:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2023-11-29 07:11:50,281 INFO L78 Accepts]: Start accepts. Automaton has has 157 states, 156 states have (on average 2.621794871794872) internal successors, (409), 156 states have internal predecessors, (409), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 227 [2023-11-29 07:11:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:11:50,284 INFO L225 Difference]: With dead ends: 957 [2023-11-29 07:11:50,284 INFO L226 Difference]: Without dead ends: 803 [2023-11-29 07:11:50,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17352 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16086, Invalid=56006, Unknown=0, NotChecked=0, Total=72092 [2023-11-29 07:11:50,291 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 919 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 07:11:50,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 484 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 07:11:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2023-11-29 07:11:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 794. [2023-11-29 07:11:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 787 states have (on average 1.0076238881829733) internal successors, (793), 788 states have internal predecessors, (793), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 07:11:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 799 transitions. [2023-11-29 07:11:50,356 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 799 transitions. Word has length 227 [2023-11-29 07:11:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:11:50,357 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 799 transitions. [2023-11-29 07:11:50,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 157 states, 156 states have (on average 2.621794871794872) internal successors, (409), 156 states have internal predecessors, (409), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 07:11:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 799 transitions. [2023-11-29 07:11:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2023-11-29 07:11:50,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:11:50,361 INFO L195 NwaCegarLoop]: trace histogram [75, 75, 75, 75, 74, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:11:50,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-11-29 07:11:50,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:11:50,562 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:11:50,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:11:50,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2076638332, now seen corresponding path program 3 times [2023-11-29 07:11:50,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:11:50,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227315769] [2023-11-29 07:11:50,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:11:50,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:11:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:12:03,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:12:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:12:03,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:12:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:12:03,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 07:12:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:12:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 13897 backedges. 0 proven. 13875 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 07:12:03,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:12:03,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227315769] [2023-11-29 07:12:03,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227315769] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:12:03,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692817740] [2023-11-29 07:12:03,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 07:12:03,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:12:03,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:12:03,257 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:12:03,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-29 07:12:03,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 07:12:03,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:12:03,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 07:12:03,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:12:03,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:12:04,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 07:12:04,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 07:12:04,572 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 07:12:04,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 07:12:04,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 07:12:04,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 07:12:04,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-11-29 07:12:04,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-11-29 07:12:05,193 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-29 07:12:05,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 37 [2023-11-29 07:12:05,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 07:12:05,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 07:12:05,506 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_append_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2023-11-29 07:12:05,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:12:05,529 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-11-29 07:12:05,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 71 [2023-11-29 07:12:05,551 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-29 07:12:05,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 07:12:05,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2023-11-29 07:12:05,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 46 [2023-11-29 07:12:06,076 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 07:12:06,085 INFO L349 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2023-11-29 07:12:06,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 33 [2023-11-29 07:12:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13897 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 13875 trivial. 2 not checked. [2023-11-29 07:12:06,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:12:07,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692817740] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:12:07,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:12:07,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [152, 20] total 171 [2023-11-29 07:12:07,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126736795] [2023-11-29 07:12:07,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:12:07,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 171 states [2023-11-29 07:12:07,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:12:07,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2023-11-29 07:12:07,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5912, Invalid=24541, Unknown=1, NotChecked=346, Total=30800 [2023-11-29 07:12:07,253 INFO L87 Difference]: Start difference. First operand 794 states and 799 transitions. Second operand has 171 states, 167 states have (on average 2.5508982035928143) internal successors, (426), 166 states have internal predecessors, (426), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 07:12:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:12:15,592 INFO L93 Difference]: Finished difference Result 1588 states and 1601 transitions. [2023-11-29 07:12:15,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2023-11-29 07:12:15,593 INFO L78 Accepts]: Start accepts. Automaton has has 171 states, 167 states have (on average 2.5508982035928143) internal successors, (426), 166 states have internal predecessors, (426), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 409 [2023-11-29 07:12:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:12:15,596 INFO L225 Difference]: With dead ends: 1588 [2023-11-29 07:12:15,596 INFO L226 Difference]: Without dead ends: 809 [2023-11-29 07:12:15,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 778 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12705 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=14585, Invalid=51210, Unknown=1, NotChecked=510, Total=66306 [2023-11-29 07:12:15,601 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 596 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 433 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:12:15,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 626 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 953 Invalid, 0 Unknown, 433 Unchecked, 1.0s Time] [2023-11-29 07:12:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2023-11-29 07:12:15,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 807. [2023-11-29 07:12:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 799 states have (on average 1.0075093867334168) internal successors, (805), 800 states have internal predecessors, (805), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 07:12:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 813 transitions. [2023-11-29 07:12:15,660 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 813 transitions. Word has length 409 [2023-11-29 07:12:15,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:12:15,661 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 813 transitions. [2023-11-29 07:12:15,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 171 states, 167 states have (on average 2.5508982035928143) internal successors, (426), 166 states have internal predecessors, (426), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 07:12:15,661 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 813 transitions. [2023-11-29 07:12:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2023-11-29 07:12:15,663 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:12:15,664 INFO L195 NwaCegarLoop]: trace histogram [76, 76, 76, 76, 75, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:12:15,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-11-29 07:12:15,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:12:15,864 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 07:12:15,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:12:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash -466025395, now seen corresponding path program 4 times [2023-11-29 07:12:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:12:15,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378542750] [2023-11-29 07:12:15,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:12:15,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:12:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:12:16,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:12:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:12:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:12:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:12:16,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:12:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:12:16,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 07:12:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:12:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14292 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 14274 trivial. 0 not checked. [2023-11-29 07:12:16,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:12:16,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378542750] [2023-11-29 07:12:16,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378542750] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:12:16,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169990848] [2023-11-29 07:12:16,261 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 07:12:16,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:12:16,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:12:16,262 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:12:16,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-29 07:12:16,920 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 07:12:16,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:12:16,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 1820 conjuncts, 210 conjunts are in the unsatisfiable core [2023-11-29 07:12:16,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:12:16,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 07:12:17,084 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 07:12:17,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 07:12:17,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 07:12:17,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:12:17,299 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 07:12:17,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 07:12:17,340 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-11-29 07:12:17,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2023-11-29 07:12:17,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 07:12:17,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2023-11-29 07:12:17,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:12:17,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-29 07:12:17,612 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 07:12:17,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 37 [2023-11-29 07:12:17,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 07:12:17,625 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 07:12:17,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 10 [2023-11-29 07:12:17,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:12:17,839 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-11-29 07:12:17,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 54 [2023-11-29 07:12:17,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:12:17,870 INFO L349 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2023-11-29 07:12:17,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 40 [2023-11-29 07:12:17,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:12:17,928 INFO L349 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2023-11-29 07:12:17,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 49 [2023-11-29 07:12:19,293 INFO L349 Elim1Store]: treesize reduction 132, result has 16.5 percent of original size [2023-11-29 07:12:19,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 227 treesize of output 101 [2023-11-29 07:12:19,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:12:19,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:12:19,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:12:19,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:12:19,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:12:19,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 78 [2023-11-29 07:12:19,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 95 [2023-11-29 07:12:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 14292 backedges. 1263 proven. 33 refuted. 0 times theorem prover too weak. 12996 trivial. 0 not checked. [2023-11-29 07:12:20,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:12:28,398 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse17 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse18 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (and (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 0)) (forall ((v_DerPreprocessor_3 Int)) (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_DerPreprocessor_3)))) (let ((.cse0 (select (select .cse13 .cse17) .cse18))) (or (= .cse0 0) (forall ((v_ArrVal_3445 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_ArrVal_3445)))) (let ((.cse15 (select (select .cse9 .cse17) .cse18)) (.cse16 (+ 4 .cse0))) (let ((.cse14 (select (select .cse13 .cse15) .cse16)) (.cse10 (select (select .cse9 .cse15) .cse16))) (let ((.cse11 (select .cse9 .cse10)) (.cse12 (+ .cse14 4))) (or (= (let ((.cse1 (store .cse13 .cse10 (store (select .cse13 .cse10) .cse12 0))) (.cse2 (store .cse9 .cse10 (store .cse11 .cse12 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|)))) (let ((.cse5 (select (select .cse2 .cse7) .cse8)) (.cse6 (+ (select (select .cse1 .cse7) .cse8) 4))) (let ((.cse3 (select (select .cse2 .cse5) .cse6)) (.cse4 (+ (select (select .cse1 .cse5) .cse6) 4))) (select (select .cse1 (select (select .cse2 .cse3) .cse4)) (+ 4 (select (select .cse1 .cse3) .cse4)))))) 0) (not (= 0 (select .cse11 .cse12))) (= .cse14 0))))))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| Int)) (or (forall ((v_DerPreprocessor_3 Int)) (let ((.cse29 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_DerPreprocessor_3)))) (let ((.cse33 (select (select .cse29 .cse17) .cse18))) (or (forall ((v_ArrVal_3445 Int)) (let ((.cse25 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_ArrVal_3445)))) (let ((.cse31 (select (select .cse25 .cse17) .cse18)) (.cse32 (+ 4 .cse33))) (let ((.cse30 (select (select .cse29 .cse31) .cse32)) (.cse26 (select (select .cse25 .cse31) .cse32))) (let ((.cse27 (select .cse25 .cse26)) (.cse28 (+ .cse30 4))) (or (= (let ((.cse22 (store .cse29 .cse26 (store (select .cse29 .cse26) .cse28 0))) (.cse19 (store .cse25 .cse26 (store .cse27 .cse28 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|)))) (let ((.cse23 (select (select .cse19 .cse7) .cse8)) (.cse24 (+ (select (select .cse22 .cse7) .cse8) 4))) (let ((.cse20 (select (select .cse19 .cse23) .cse24)) (.cse21 (+ (select (select .cse22 .cse23) .cse24) 4))) (select (select .cse19 (select (select .cse19 .cse20) .cse21)) (+ 4 (select (select .cse22 .cse20) .cse21)))))) 0) (not (= 0 (select .cse27 .cse28))) (= .cse30 0))))))) (= .cse33 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| Int)) (or (forall ((v_ArrVal_3445 Int)) (let ((.cse40 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_ArrVal_3445)))) (let ((.cse46 (select (select .cse40 .cse17) .cse18))) (or (forall ((v_DerPreprocessor_3 Int)) (let ((.cse44 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_DerPreprocessor_3)))) (let ((.cse47 (+ 4 (select (select .cse44 .cse17) .cse18)))) (let ((.cse45 (select (select .cse44 .cse46) .cse47)) (.cse41 (select (select .cse40 .cse46) .cse47))) (let ((.cse42 (select .cse40 .cse41)) (.cse43 (+ .cse45 4))) (or (= (let ((.cse37 (store .cse44 .cse41 (store (select .cse44 .cse41) .cse43 0))) (.cse34 (store .cse40 .cse41 (store .cse42 .cse43 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|)))) (let ((.cse38 (select (select .cse34 .cse7) .cse8)) (.cse39 (+ (select (select .cse37 .cse7) .cse8) 4))) (let ((.cse35 (select (select .cse34 .cse38) .cse39)) (.cse36 (+ (select (select .cse37 .cse38) .cse39) 4))) (select (select .cse34 (select (select .cse34 .cse35) .cse36)) (+ 4 (select (select .cse37 .cse35) .cse36)))))) 0) (not (= 0 (select .cse42 .cse43))) (= .cse45 0))))))) (= .cse46 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| Int)) (or (forall ((v_ArrVal_3445 Int)) (let ((.cse54 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_ArrVal_3445)))) (let ((.cse59 (select (select .cse54 .cse17) .cse18))) (or (forall ((v_DerPreprocessor_3 Int)) (let ((.cse58 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_DerPreprocessor_3)))) (let ((.cse60 (+ 4 (select (select .cse58 .cse17) .cse18)))) (let ((.cse55 (select (select .cse54 .cse59) .cse60))) (let ((.cse56 (select .cse54 .cse55)) (.cse57 (+ (select (select .cse58 .cse59) .cse60) 4))) (or (= (let ((.cse48 (store .cse58 .cse55 (store (select .cse58 .cse55) .cse57 0))) (.cse49 (store .cse54 .cse55 (store .cse56 .cse57 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|)))) (let ((.cse52 (select (select .cse49 .cse7) .cse8)) (.cse53 (+ (select (select .cse48 .cse7) .cse8) 4))) (let ((.cse50 (select (select .cse49 .cse52) .cse53)) (.cse51 (+ (select (select .cse48 .cse52) .cse53) 4))) (select (select .cse48 (select (select .cse49 .cse50) .cse51)) (+ 4 (select (select .cse48 .cse50) .cse51)))))) 0) (= .cse55 0) (not (= 0 (select .cse56 .cse57))))))))) (= .cse59 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| Int)) (or (forall ((v_DerPreprocessor_3 Int)) (let ((.cse71 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_DerPreprocessor_3)))) (let ((.cse74 (select (select .cse71 .cse17) .cse18))) (or (forall ((v_ArrVal_3445 Int)) (let ((.cse68 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_ArrVal_3445)))) (let ((.cse72 (select (select .cse68 .cse17) .cse18)) (.cse73 (+ 4 .cse74))) (let ((.cse61 (select (select .cse68 .cse72) .cse73))) (let ((.cse69 (select .cse68 .cse61)) (.cse70 (+ (select (select .cse71 .cse72) .cse73) 4))) (or (= .cse61 0) (= (let ((.cse65 (store .cse71 .cse61 (store (select .cse71 .cse61) .cse70 0))) (.cse62 (store .cse68 .cse61 (store .cse69 .cse70 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|)))) (let ((.cse66 (select (select .cse62 .cse7) .cse8)) (.cse67 (+ (select (select .cse65 .cse7) .cse8) 4))) (let ((.cse63 (select (select .cse62 .cse66) .cse67)) (.cse64 (+ (select (select .cse65 .cse66) .cse67) 4))) (select (select .cse62 (select (select .cse62 .cse63) .cse64)) (+ 4 (select (select .cse65 .cse63) .cse64)))))) 0) (not (= 0 (select .cse69 .cse70))))))))) (= .cse74 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| Int)) (or (forall ((v_ArrVal_3445 Int)) (let ((.cse83 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_ArrVal_3445)))) (let ((.cse75 (select (select .cse83 .cse17) .cse18))) (or (= .cse75 0) (forall ((v_DerPreprocessor_3 Int)) (let ((.cse86 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_DerPreprocessor_3)))) (let ((.cse87 (+ 4 (select (select .cse86 .cse17) .cse18)))) (let ((.cse76 (select (select .cse83 .cse75) .cse87))) (let ((.cse84 (select .cse83 .cse76)) (.cse85 (+ (select (select .cse86 .cse75) .cse87) 4))) (or (= .cse76 0) (= (let ((.cse80 (store .cse86 .cse76 (store (select .cse86 .cse76) .cse85 0))) (.cse77 (store .cse83 .cse76 (store .cse84 .cse85 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|)))) (let ((.cse81 (select (select .cse77 .cse7) .cse8)) (.cse82 (+ (select (select .cse80 .cse7) .cse8) 4))) (let ((.cse78 (select (select .cse77 .cse81) .cse82)) (.cse79 (+ (select (select .cse80 .cse81) .cse82) 4))) (select (select .cse77 (select (select .cse77 .cse78) .cse79)) (+ 4 (select (select .cse80 .cse78) .cse79)))))) 0) (not (= 0 (select .cse84 .cse85))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| Int)) (or (forall ((v_ArrVal_3445 Int)) (let ((.cse94 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_ArrVal_3445)))) (let ((.cse100 (select (select .cse94 .cse17) .cse18))) (or (forall ((v_DerPreprocessor_3 Int)) (let ((.cse98 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_DerPreprocessor_3)))) (let ((.cse101 (+ 4 (select (select .cse98 .cse17) .cse18)))) (let ((.cse99 (select (select .cse98 .cse100) .cse101)) (.cse95 (select (select .cse94 .cse100) .cse101))) (let ((.cse96 (select .cse94 .cse95)) (.cse97 (+ .cse99 4))) (or (= (let ((.cse88 (store .cse98 .cse95 (store (select .cse98 .cse95) .cse97 0))) (.cse89 (store .cse94 .cse95 (store .cse96 .cse97 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|)))) (let ((.cse92 (select (select .cse89 .cse7) .cse8)) (.cse93 (+ (select (select .cse88 .cse7) .cse8) 4))) (let ((.cse90 (select (select .cse89 .cse92) .cse93)) (.cse91 (+ (select (select .cse88 .cse92) .cse93) 4))) (select (select .cse88 (select (select .cse89 .cse90) .cse91)) (+ 4 (select (select .cse88 .cse90) .cse91)))))) 0) (not (= 0 (select .cse96 .cse97))) (= .cse99 0))))))) (= .cse100 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| Int)) (or (forall ((v_DerPreprocessor_3 Int)) (let ((.cse113 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_DerPreprocessor_3)))) (let ((.cse102 (select (select .cse113 .cse17) .cse18))) (or (= .cse102 0) (forall ((v_ArrVal_3445 Int)) (let ((.cse109 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 4 0) 0 v_ArrVal_3445)))) (let ((.cse114 (select (select .cse109 .cse17) .cse18)) (.cse115 (+ 4 .cse102))) (let ((.cse110 (select (select .cse109 .cse114) .cse115))) (let ((.cse111 (select .cse109 .cse110)) (.cse112 (+ (select (select .cse113 .cse114) .cse115) 4))) (or (= (let ((.cse103 (store .cse113 .cse110 (store (select .cse113 .cse110) .cse112 0))) (.cse104 (store .cse109 .cse110 (store .cse111 .cse112 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|)))) (let ((.cse107 (select (select .cse104 .cse7) .cse8)) (.cse108 (+ (select (select .cse103 .cse7) .cse8) 4))) (let ((.cse105 (select (select .cse104 .cse107) .cse108)) (.cse106 (+ (select (select .cse103 .cse107) .cse108) 4))) (select (select .cse103 (select (select .cse104 .cse105) .cse106)) (+ 4 (select (select .cse103 .cse105) .cse106)))))) 0) (= .cse110 0) (not (= 0 (select .cse111 .cse112))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_48|) 0)))))) is different from true [2023-11-29 07:12:28,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169990848] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:12:28,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:12:28,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 38] total 44 [2023-11-29 07:12:28,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128666431] [2023-11-29 07:12:28,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:12:28,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-29 07:12:28,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:12:28,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-29 07:12:28,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3491, Unknown=1, NotChecked=118, Total=3782 [2023-11-29 07:12:28,406 INFO L87 Difference]: Start difference. First operand 807 states and 813 transitions. Second operand has 44 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 36 states have internal predecessors, (82), 7 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-29 07:12:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:12:29,453 INFO L93 Difference]: Finished difference Result 810 states and 815 transitions. [2023-11-29 07:12:29,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 07:12:29,453 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 36 states have internal predecessors, (82), 7 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 422 [2023-11-29 07:12:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:12:29,453 INFO L225 Difference]: With dead ends: 810 [2023-11-29 07:12:29,453 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 07:12:29,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 768 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=213, Invalid=4346, Unknown=1, NotChecked=132, Total=4692 [2023-11-29 07:12:29,455 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 07:12:29,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 54 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 07:12:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 07:12:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 07:12:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:12:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 07:12:29,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 422 [2023-11-29 07:12:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:12:29,456 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 07:12:29,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 36 states have internal predecessors, (82), 7 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-29 07:12:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 07:12:29,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 07:12:29,459 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-29 07:12:29,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-29 07:12:29,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-29 07:12:29,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-29 07:12:29,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-29 07:12:29,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-29 07:12:29,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-29 07:12:29,460 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-29 07:12:29,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-11-29 07:12:29,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 07:12:29,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 07:12:30,756 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2023-11-29 07:12:30,757 INFO L899 garLoopResultBuilder]: For program point L605-1(lines 605 607) no Hoare annotation was computed. [2023-11-29 07:12:30,757 INFO L895 garLoopResultBuilder]: At program point L605-3(lines 605 607) the Hoare annotation is: (let ((.cse10 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse20 (select (select |#memory_$Pointer$#1.base| .cse10) 4))) (let ((.cse0 (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (not (= .cse10 0))) (.cse2 (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| .cse20))) (.cse3 (= |ULTIMATE.start_sll_append_~last~0#1.offset| 0)) (.cse6 (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0))) (.cse7 (= |ULTIMATE.start_sll_append_~head#1.offset| 0)) (.cse8 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_append_~head#1.base|) 0) 0)) (.cse9 (= (select |#valid| .cse20) 1)) (.cse11 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse12 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse13 (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse14 (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0)) (.cse15 (= (select (select |#memory_$Pointer$#1.offset| .cse10) 4) 0)) (.cse16 (= (select |#valid| (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_append_~head#1.base|) 0)) 1)) (.cse17 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4) 0)) (.cse18 (not (= .cse20 0)))) (or (let ((.cse4 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_append_~last~0#1.base|) 4)) (.cse5 (+ (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_append_~last~0#1.base|) 4) 4))) (and .cse0 .cse1 .cse2 .cse3 (= (select (select |#memory_$Pointer$#1.offset| .cse4) .cse5) 0) .cse6 .cse7 .cse8 (= (select (select |#memory_$Pointer$#1.base| .cse4) .cse5) 0) .cse9 (= .cse10 |ULTIMATE.start_sll_append_~last~0#1.base|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_36| Int)) (let ((.cse19 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_36|) 4))) (and (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse19) (= (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_36|) 4) 0) (= (select (select |#memory_$Pointer$#1.base| .cse19) 4) 0) (not (= |v_ULTIMATE.start_sll_append_~last~0#1.base_36| .cse19)) (= (select (select |#memory_$Pointer$#1.offset| .cse19) 4) 0)))) .cse11 .cse12 .cse13 .cse14 .cse15 (= |ULTIMATE.start_sll_append_~last~0#1.base| .cse20) .cse16 .cse17 .cse18))))) [2023-11-29 07:12:30,757 INFO L899 garLoopResultBuilder]: For program point L605-4(lines 605 607) no Hoare annotation was computed. [2023-11-29 07:12:30,757 INFO L899 garLoopResultBuilder]: For program point L622(lines 622 624) no Hoare annotation was computed. [2023-11-29 07:12:30,757 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 611 640) no Hoare annotation was computed. [2023-11-29 07:12:30,757 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 633) no Hoare annotation was computed. [2023-11-29 07:12:30,757 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2023-11-29 07:12:30,757 INFO L899 garLoopResultBuilder]: For program point L631(line 631) no Hoare annotation was computed. [2023-11-29 07:12:30,757 INFO L899 garLoopResultBuilder]: For program point L631-1(line 631) no Hoare annotation was computed. [2023-11-29 07:12:30,758 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-11-29 07:12:30,758 INFO L899 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2023-11-29 07:12:30,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 585) no Hoare annotation was computed. [2023-11-29 07:12:30,758 INFO L899 garLoopResultBuilder]: For program point L599(lines 599 610) no Hoare annotation was computed. [2023-11-29 07:12:30,758 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 07:12:30,758 INFO L899 garLoopResultBuilder]: For program point L633(line 633) no Hoare annotation was computed. [2023-11-29 07:12:30,758 INFO L895 garLoopResultBuilder]: At program point L600(line 600) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse4 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_append_~head#1.base|) 0))) (let ((.cse0 (select (select |#memory_$Pointer$#1.base| .cse4) 4)) (.cse1 (+ (select (select |#memory_$Pointer$#1.offset| .cse4) 4) 4)) (.cse3 (select (select |#memory_$Pointer$#1.base| .cse2) 4))) (and (= |ULTIMATE.start_sll_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$#1.offset| .cse0) .cse1) 0) (not (= .cse2 0)) (= (select (select |#memory_$Pointer$#1.base| .cse0) .cse1) 0) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_append_~head#1.base|) 0) 0) (= (select |#valid| .cse3) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select |#valid| .cse4) 1) (not (= .cse3 0))))) [2023-11-29 07:12:30,758 INFO L899 garLoopResultBuilder]: For program point L633-1(lines 633 635) no Hoare annotation was computed. [2023-11-29 07:12:30,759 INFO L899 garLoopResultBuilder]: For program point L600-1(line 600) no Hoare annotation was computed. [2023-11-29 07:12:30,759 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2023-11-29 07:12:30,759 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 609) no Hoare annotation was computed. [2023-11-29 07:12:30,759 INFO L899 garLoopResultBuilder]: For program point L626(line 626) no Hoare annotation was computed. [2023-11-29 07:12:30,759 INFO L899 garLoopResultBuilder]: For program point L626-1(line 626) no Hoare annotation was computed. [2023-11-29 07:12:30,759 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2023-11-29 07:12:30,759 INFO L899 garLoopResultBuilder]: For program point L585-3(line 585) no Hoare annotation was computed. [2023-11-29 07:12:30,759 INFO L899 garLoopResultBuilder]: For program point L585-4(line 585) no Hoare annotation was computed. [2023-11-29 07:12:30,759 INFO L895 garLoopResultBuilder]: At program point L585-5(lines 585 589) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (.cse8 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))) (let ((.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (not .cse8)) (.cse4 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (.cse7 (= .cse0 0)) (.cse3 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse5 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (= (select (select |#memory_$Pointer$#1.base| .cse0) 4) 0) .cse1 .cse2 .cse3 (<= |ULTIMATE.start_sll_create_~len#1| 0) .cse4 (= (select |#valid| .cse0) 1) .cse5 .cse6 (not .cse7) (= (select (select |#memory_$Pointer$#1.offset| .cse0) 4) 0)) (and .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_sll_create_~len#1| 1) .cse7 .cse5 .cse6) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse3 .cse8 .cse5 .cse6)))) [2023-11-29 07:12:30,759 INFO L899 garLoopResultBuilder]: For program point L585-6(lines 585 589) no Hoare annotation was computed. [2023-11-29 07:12:30,760 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2023-11-29 07:12:30,760 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 632) no Hoare annotation was computed. [2023-11-29 07:12:30,760 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse0 (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (.cse2 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not .cse0) .cse1 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |ULTIMATE.start_sll_create_~len#1| 1) (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) .cse2 .cse3) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse1 .cse0 .cse2 .cse3))) [2023-11-29 07:12:30,760 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-11-29 07:12:30,760 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 619 632) no Hoare annotation was computed. [2023-11-29 07:12:30,760 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 07:12:30,760 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2023-11-29 07:12:30,760 INFO L899 garLoopResultBuilder]: For program point L628(lines 628 630) no Hoare annotation was computed. [2023-11-29 07:12:30,760 INFO L899 garLoopResultBuilder]: For program point L620-1(lines 620 627) no Hoare annotation was computed. [2023-11-29 07:12:30,761 INFO L895 garLoopResultBuilder]: At program point L620-3(lines 620 627) the Hoare annotation is: (let ((.cse17 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse18 (select (select |#memory_$Pointer$#1.base| .cse17) 4))) (let ((.cse16 (select (select |#memory_$Pointer$#1.base| .cse18) 4))) (let ((.cse0 (not (= .cse17 .cse16))) (.cse1 (= (select (select |#memory_$Pointer$#1.offset| .cse18) 4) 0)) (.cse4 (= |ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse5 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (.cse6 (not (= .cse18 .cse16))) (.cse7 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse9 (= (select (select |#memory_$Pointer$#1.offset| .cse16) 4) 0)) (.cse10 (= (select (select |#memory_$Pointer$#1.offset| .cse17) 4) 0)) (.cse11 (= 0 (select (select |#memory_$Pointer$#1.base| .cse16) 4)))) (or (and (= |ULTIMATE.start_main_~count~0#1| 1) .cse0 .cse1 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_120| Int)) (let ((.cse3 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_120|) 4))) (let ((.cse2 (select (select |#memory_$Pointer$#1.base| .cse3) 4))) (and (not (= .cse2 .cse3)) (= (select (select |#memory_$Pointer$#1.offset| .cse2) 4) 0) (= (select (select |#memory_$Pointer$#1.base| .cse2) 4) 0) (= .cse3 |ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_120|) 4) 0) (not (= .cse2 |v_ULTIMATE.start_main_~ptr~0#1.base_120|)) (= (select (select |#memory_$Pointer$#1.offset| .cse3) 4) 0))))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse13 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse12 (select (select |#memory_$Pointer$#1.base| .cse13) 4))) (and (= (select (select |#memory_$Pointer$#1.base| .cse12) 4) 0) (not (= .cse12 |ULTIMATE.start_main_~ptr~0#1.base|)) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~ptr~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$#1.offset| .cse12) 4) 0) .cse0 .cse1 .cse4 .cse5 (= |ULTIMATE.start_main_~count~0#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (select (select |#memory_$Pointer$#1.offset| .cse13) 4) 0) (not (= .cse12 .cse13))))) (and .cse0 (<= |ULTIMATE.start_main_~count~0#1| 2) (<= 1 |ULTIMATE.start_main_~count~0#1|) .cse1 .cse4 .cse5 .cse6 (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_120| Int)) (let ((.cse15 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~ptr~0#1.base_120|) 4))) (let ((.cse14 (select (select |#memory_$Pointer$#1.base| .cse15) 4))) (and (not (= .cse14 .cse15)) (= (select (select |#memory_$Pointer$#1.offset| .cse14) 4) 0) (= (select (select |#memory_$Pointer$#1.base| .cse14) 4) 0) (= .cse14 |ULTIMATE.start_main_~ptr~0#1.base|) (= (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_120|) 4) 0) (not (= .cse14 |v_ULTIMATE.start_main_~ptr~0#1.base_120|)) (= (select (select |#memory_$Pointer$#1.offset| .cse15) 4) 0))))) .cse7 .cse8 .cse9 .cse10 .cse11)))))) [2023-11-29 07:12:30,761 INFO L899 garLoopResultBuilder]: For program point L620-4(lines 620 627) no Hoare annotation was computed. [2023-11-29 07:12:30,761 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2023-11-29 07:12:30,761 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 611 640) no Hoare annotation was computed. [2023-11-29 07:12:30,761 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 633) no Hoare annotation was computed. [2023-11-29 07:12:30,761 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-11-29 07:12:30,761 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-11-29 07:12:30,761 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) [2023-11-29 07:12:30,761 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-11-29 07:12:30,764 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:12:30,766 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 07:12:30,775 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-29 07:12:30,776 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-29 07:12:30,777 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-11-29 07:12:30,777 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated [2023-11-29 07:12:30,777 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-29 07:12:30,777 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-11-29 07:12:30,777 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-11-29 07:12:30,777 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-11-29 07:12:30,778 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-11-29 07:12:30,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-11-29 07:12:30,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-29 07:12:30,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-29 07:12:30,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_120 : int :: (((((!(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4]][4] == 0) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4]][4] == 0) && #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4] == ~ptr~0!base) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~ptr~0#1.base_120][4] == 0) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_120)) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == 0) could not be translated [2023-11-29 07:12:30,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-11-29 07:12:30,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 07:12:30,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-29 07:12:30,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4]][4] could not be translated [2023-11-29 07:12:30,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 07:12:30,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4]][4] could not be translated [2023-11-29 07:12:30,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4]][4] could not be translated [2023-11-29 07:12:30,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4] could not be translated [2023-11-29 07:12:30,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~ptr~0!base][4] could not be translated [2023-11-29 07:12:30,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4]][4] could not be translated [2023-11-29 07:12:30,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-11-29 07:12:30,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-29 07:12:30,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-29 07:12:30,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-11-29 07:12:30,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 07:12:30,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-29 07:12:30,787 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4]][4] could not be translated [2023-11-29 07:12:30,787 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 07:12:30,787 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4]][4] could not be translated [2023-11-29 07:12:30,787 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~ptr~0!base][4]][4] could not be translated [2023-11-29 07:12:30,787 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4] could not be translated [2023-11-29 07:12:30,788 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~ptr~0!base][4] could not be translated [2023-11-29 07:12:30,788 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-11-29 07:12:30,788 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-29 07:12:30,788 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-29 07:12:30,788 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated [2023-11-29 07:12:30,788 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 07:12:30,788 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated [2023-11-29 07:12:30,789 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_120 : int :: (((((!(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4]][4] == 0) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4]][4] == 0) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == ~ptr~0!base) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~ptr~0#1.base_120][4] == 0) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_120)) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == 0) could not be translated [2023-11-29 07:12:30,789 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4]][4] could not be translated [2023-11-29 07:12:30,789 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 07:12:30,789 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4]][4] could not be translated [2023-11-29 07:12:30,792 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 07:12:30,792 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-11-29 07:12:30,792 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-11-29 07:12:30,792 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 07:12:30,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~last~0!base][4]][#memory_$Pointer$#1.offset[~last~0!base][4] + 4] could not be translated [2023-11-29 07:12:30,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 07:12:30,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head!base][0] could not be translated [2023-11-29 07:12:30,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~last~0!base][4]][#memory_$Pointer$#1.offset[~last~0!base][4] + 4] could not be translated [2023-11-29 07:12:30,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]] could not be translated [2023-11-29 07:12:30,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-11-29 07:12:30,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-29 07:12:30,793 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~new_last~0!base][4] could not be translated [2023-11-29 07:12:30,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 07:12:30,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#2.base[~head!base][0]] could not be translated [2023-11-29 07:12:30,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~new_last~0!base][4] could not be translated [2023-11-29 07:12:30,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 07:12:30,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 07:12:30,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~#s~0 [2023-11-29 07:12:30,794 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated [2023-11-29 07:12:30,795 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 07:12:30,795 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-29 07:12:30,795 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head!base][0] could not be translated [2023-11-29 07:12:30,795 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]] could not be translated [2023-11-29 07:12:30,795 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_append_~last~0#1.base_36 : int :: (((~last~0!base == #memory_$Pointer$#1.base[v_ULTIMATE.start_sll_append_~last~0#1.base_36][4] && #memory_$Pointer$#1.offset[v_ULTIMATE.start_sll_append_~last~0#1.base_36][4] == 0) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_sll_append_~last~0#1.base_36][4]][4] == 0) && !(v_ULTIMATE.start_sll_append_~last~0#1.base_36 == #memory_$Pointer$#1.base[v_ULTIMATE.start_sll_append_~last~0#1.base_36][4])) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_sll_append_~last~0#1.base_36][4]][4] == 0) could not be translated [2023-11-29 07:12:30,795 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable ~len~0 [2023-11-29 07:12:30,795 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~new_last~0!base][4] could not be translated [2023-11-29 07:12:30,795 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 07:12:30,796 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 07:12:30,796 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#2.base[~head!base][0]] could not be translated [2023-11-29 07:12:30,796 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~new_last~0!base][4] could not be translated [2023-11-29 07:12:30,796 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated [2023-11-29 07:12:30,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:12:30 BoogieIcfgContainer [2023-11-29 07:12:30,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 07:12:30,797 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 07:12:30,797 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 07:12:30,797 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 07:12:30,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:06:19" (3/4) ... [2023-11-29 07:12:30,799 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 07:12:30,802 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2023-11-29 07:12:30,805 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-29 07:12:30,806 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 07:12:30,806 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 07:12:30,806 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 07:12:30,882 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 07:12:30,882 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 07:12:30,882 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 07:12:30,883 INFO L158 Benchmark]: Toolchain (without parser) took 372305.55ms. Allocated memory was 140.5MB in the beginning and 1.1GB in the end (delta: 994.1MB). Free memory was 102.5MB in the beginning and 518.7MB in the end (delta: -416.2MB). Peak memory consumption was 580.2MB. Max. memory is 16.1GB. [2023-11-29 07:12:30,883 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 107.0MB. Free memory was 57.4MB in the beginning and 57.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:12:30,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.26ms. Allocated memory is still 140.5MB. Free memory was 102.5MB in the beginning and 84.5MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 07:12:30,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.22ms. Allocated memory is still 140.5MB. Free memory was 84.5MB in the beginning and 82.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:12:30,884 INFO L158 Benchmark]: Boogie Preprocessor took 59.29ms. Allocated memory is still 140.5MB. Free memory was 82.4MB in the beginning and 79.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:12:30,884 INFO L158 Benchmark]: RCFGBuilder took 468.92ms. Allocated memory is still 140.5MB. Free memory was 79.0MB in the beginning and 104.9MB in the end (delta: -25.9MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2023-11-29 07:12:30,885 INFO L158 Benchmark]: TraceAbstraction took 371207.94ms. Allocated memory was 140.5MB in the beginning and 1.1GB in the end (delta: 994.1MB). Free memory was 104.9MB in the beginning and 524.0MB in the end (delta: -419.1MB). Peak memory consumption was 573.6MB. Max. memory is 16.1GB. [2023-11-29 07:12:30,885 INFO L158 Benchmark]: Witness Printer took 85.30ms. Allocated memory is still 1.1GB. Free memory was 524.0MB in the beginning and 518.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 07:12:30,887 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 107.0MB. Free memory was 57.4MB in the beginning and 57.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.26ms. Allocated memory is still 140.5MB. Free memory was 102.5MB in the beginning and 84.5MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.22ms. Allocated memory is still 140.5MB. Free memory was 84.5MB in the beginning and 82.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.29ms. Allocated memory is still 140.5MB. Free memory was 82.4MB in the beginning and 79.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 468.92ms. Allocated memory is still 140.5MB. Free memory was 79.0MB in the beginning and 104.9MB in the end (delta: -25.9MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 371207.94ms. Allocated memory was 140.5MB in the beginning and 1.1GB in the end (delta: 994.1MB). Free memory was 104.9MB in the beginning and 524.0MB in the end (delta: -419.1MB). Peak memory consumption was 573.6MB. Max. memory is 16.1GB. * Witness Printer took 85.30ms. Allocated memory is still 1.1GB. Free memory was 524.0MB in the beginning and 518.7MB in the end (delta: 5.2MB). 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: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_120 : int :: (((((!(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4]][4] == 0) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4]][4] == 0) && #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4] == ~ptr~0!base) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~ptr~0#1.base_120][4] == 0) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_120)) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~ptr~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~ptr~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~ptr~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~ptr~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~ptr~0#1.base_120 : int :: (((((!(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4]][4] == 0) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4]][4] == 0) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == ~ptr~0!base) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~ptr~0#1.base_120][4] == 0) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == v_ULTIMATE.start_main_~ptr~0#1.base_120)) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_main_~ptr~0#1.base_120][4]][4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]][4]][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: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~last~0!base][4]][#memory_$Pointer$#1.offset[~last~0!base][4] + 4] 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: ArrayAccessExpression #memory_$Pointer$#2.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~last~0!base][4]][#memory_$Pointer$#1.offset[~last~0!base][4] + 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~new_last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#2.base[~head!base][0]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~new_last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][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: unknown boogie variable ~#s~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] 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: ArrayAccessExpression #memory_$Pointer$#2.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_sll_append_~last~0#1.base_36 : int :: (((~last~0!base == #memory_$Pointer$#1.base[v_ULTIMATE.start_sll_append_~last~0#1.base_36][4] && #memory_$Pointer$#1.offset[v_ULTIMATE.start_sll_append_~last~0#1.base_36][4] == 0) && #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_sll_append_~last~0#1.base_36][4]][4] == 0) && !(v_ULTIMATE.start_sll_append_~last~0#1.base_36 == #memory_$Pointer$#1.base[v_ULTIMATE.start_sll_append_~last~0#1.base_36][4])) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_sll_append_~last~0#1.base_36][4]][4] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~new_last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#2.base[~head!base][0]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~new_last~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0]][4] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 633]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 633]: 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, 46 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 371.1s, OverallIterations: 25, TraceHistogramMax: 76, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 162.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5815 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5813 mSDsluCounter, 5989 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 521 IncrementalHoareTripleChecker+Unchecked, 5369 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7632 IncrementalHoareTripleChecker+Invalid, 8189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 620 mSDtfsCounter, 7632 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6219 GetRequests, 4224 SyntacticMatches, 34 SemanticMatches, 1961 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 99786 ImplicationChecksByTransitivity, 284.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=807occurred in iteration=24, InterpolantAutomatonStates: 1228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 350 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 25 NumberOfFragments, 1269 HoareAnnotationTreeSize, 13 FomulaSimplifications, 885 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 460 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 194.3s InterpolantComputationTime, 5078 NumberOfCodeBlocks, 4324 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 5989 ConstructedInterpolants, 240 QuantifiedInterpolants, 69484 SizeOfPredicates, 482 NumberOfNonLiveVariables, 12795 ConjunctsInSsa, 1366 ConjunctsInUnsatCore, 58 InterpolantComputations, 10 PerfectInterpolantSequences, 49145/94155 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: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((len <= 0) && (len == 2)) || ((len == 1) && (len == 2))) || ((2 == len) && (len == 2))) - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: ((((count == 1) && (len == 2)) || ((count == 0) && (len == 2))) || (((count <= 2) && (1 <= count)) && (len == 2))) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-29 07:12:31,106 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-11-29 07:12:31,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f4a6bf4-8346-46d5-8d5c-da38ff3ec443/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE