./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:25:41,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:25:41,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:25:41,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:25:41,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:25:41,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:25:41,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:25:41,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:25:41,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:25:41,611 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:25:41,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:25:41,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:25:41,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:25:41,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:25:41,613 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:25:41,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:25:41,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:25:41,616 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:25:41,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:25:41,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:25:41,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:25:41,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:25:41,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:25:41,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:25:41,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:25:41,621 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:25:41,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:25:41,622 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:25:41,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:25:41,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:25:41,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:25:41,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:25:41,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:25:41,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:25:41,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:25:41,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:25:41,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:25:41,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:25:41,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:25:41,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:25:41,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:25:41,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:25:41,626 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 ! call(reach_error())) ) 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2024-10-12 18:25:41,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:25:41,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:25:41,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:25:41,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:25:41,950 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:25:41,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-10-12 18:25:43,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:25:43,718 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:25:43,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-10-12 18:25:43,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9062bfdda/639fb62202ac45b2b0128ebf8753325a/FLAG626fc5565 [2024-10-12 18:25:43,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9062bfdda/639fb62202ac45b2b0128ebf8753325a [2024-10-12 18:25:43,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:25:43,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:25:43,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:25:43,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:25:43,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:25:43,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:25:43" (1/1) ... [2024-10-12 18:25:43,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d445d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:43, skipping insertion in model container [2024-10-12 18:25:43,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:25:43" (1/1) ... [2024-10-12 18:25:43,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:25:44,153 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2024-10-12 18:25:44,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:25:44,173 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:25:44,223 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2024-10-12 18:25:44,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:25:44,259 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:25:44,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44 WrapperNode [2024-10-12 18:25:44,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:25:44,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:25:44,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:25:44,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:25:44,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,317 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 174 [2024-10-12 18:25:44,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:25:44,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:25:44,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:25:44,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:25:44,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,359 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 10, 18]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2024-10-12 18:25:44,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:25:44,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:25:44,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:25:44,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:25:44,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (1/1) ... [2024-10-12 18:25:44,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:25:44,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:44,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:25:44,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:25:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:25:44,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:25:44,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 18:25:44,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:25:44,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:25:44,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 18:25:44,489 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-12 18:25:44,489 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-12 18:25:44,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:25:44,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:25:44,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 18:25:44,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:25:44,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:25:44,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 18:25:44,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:25:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:25:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 18:25:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:25:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 18:25:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 18:25:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 18:25:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:25:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:25:44,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 18:25:44,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:25:44,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:25:44,686 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:25:44,692 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:25:45,064 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-10-12 18:25:45,064 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:25:45,114 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:25:45,115 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-12 18:25:45,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:25:45 BoogieIcfgContainer [2024-10-12 18:25:45,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:25:45,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:25:45,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:25:45,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:25:45,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:25:43" (1/3) ... [2024-10-12 18:25:45,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45675a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:25:45, skipping insertion in model container [2024-10-12 18:25:45,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:25:44" (2/3) ... [2024-10-12 18:25:45,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45675a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:25:45, skipping insertion in model container [2024-10-12 18:25:45,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:25:45" (3/3) ... [2024-10-12 18:25:45,125 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2024-10-12 18:25:45,142 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:25:45,143 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:25:45,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:25:45,216 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@ff18d89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:25:45,217 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:25:45,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:25:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:25:45,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:45,229 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:45,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:45,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:45,236 INFO L85 PathProgramCache]: Analyzing trace with hash -143673426, now seen corresponding path program 1 times [2024-10-12 18:25:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:45,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710087458] [2024-10-12 18:25:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:45,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:25:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:25:45,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:45,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710087458] [2024-10-12 18:25:45,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710087458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:25:45,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:25:45,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:25:45,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961972470] [2024-10-12 18:25:45,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:25:45,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:25:45,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:45,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:25:45,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:25:45,659 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 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) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:25:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:45,727 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2024-10-12 18:25:45,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:25:45,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-10-12 18:25:45,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:45,740 INFO L225 Difference]: With dead ends: 64 [2024-10-12 18:25:45,740 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 18:25:45,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:25:45,746 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:45,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:25:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 18:25:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-12 18:25:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:25:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-10-12 18:25:45,783 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 19 [2024-10-12 18:25:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:45,785 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-12 18:25:45,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:25:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-10-12 18:25:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:25:45,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:45,787 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:45,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:25:45,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:45,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:45,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1502228012, now seen corresponding path program 1 times [2024-10-12 18:25:45,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:45,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093162892] [2024-10-12 18:25:45,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:45,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:25:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:25:46,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:46,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093162892] [2024-10-12 18:25:46,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093162892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:25:46,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:25:46,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:25:46,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352785586] [2024-10-12 18:25:46,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:25:46,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:25:46,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:46,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:25:46,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:25:46,135 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:25:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:46,193 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2024-10-12 18:25:46,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:25:46,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-10-12 18:25:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:46,194 INFO L225 Difference]: With dead ends: 51 [2024-10-12 18:25:46,194 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 18:25:46,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:25:46,196 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:46,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:25:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 18:25:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-12 18:25:46,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:25:46,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-10-12 18:25:46,204 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2024-10-12 18:25:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:46,205 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-10-12 18:25:46,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 18:25:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-10-12 18:25:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 18:25:46,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:46,206 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:46,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:25:46,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:46,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:46,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1969454644, now seen corresponding path program 1 times [2024-10-12 18:25:46,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:46,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586105828] [2024-10-12 18:25:46,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:46,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:25:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:25:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:25:46,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:46,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586105828] [2024-10-12 18:25:46,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586105828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:25:46,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:25:46,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 18:25:46,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24985359] [2024-10-12 18:25:46,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:25:46,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 18:25:46,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:46,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 18:25:46,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:25:46,403 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 18:25:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:46,472 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2024-10-12 18:25:46,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 18:25:46,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-12 18:25:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:46,473 INFO L225 Difference]: With dead ends: 43 [2024-10-12 18:25:46,474 INFO L226 Difference]: Without dead ends: 31 [2024-10-12 18:25:46,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 18:25:46,475 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:46,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:25:46,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-12 18:25:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-12 18:25:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:25:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2024-10-12 18:25:46,486 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 25 [2024-10-12 18:25:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:46,488 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-10-12 18:25:46,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 18:25:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2024-10-12 18:25:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 18:25:46,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:46,489 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:46,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:25:46,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:46,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:46,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1835723964, now seen corresponding path program 1 times [2024-10-12 18:25:46,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:46,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443545293] [2024-10-12 18:25:46,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:46,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:48,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:48,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:25:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:48,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:25:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:25:48,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:48,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443545293] [2024-10-12 18:25:48,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443545293] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197101824] [2024-10-12 18:25:48,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:48,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:48,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:48,561 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:25:48,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:25:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:48,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-12 18:25:48,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:25:48,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:25:49,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-12 18:25:49,366 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-12 18:25:49,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-12 18:25:49,444 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 25 treesize of output 13 [2024-10-12 18:25:49,543 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 21 [2024-10-12 18:25:49,669 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 [2024-10-12 18:25:49,675 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 [2024-10-12 18:25:49,786 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-12 18:25:49,787 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 20 treesize of output 22 [2024-10-12 18:25:50,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:25:50,083 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2024-10-12 18:25:50,089 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 21 [2024-10-12 18:25:50,146 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 25 treesize of output 17 [2024-10-12 18:25:50,149 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 21 treesize of output 13 [2024-10-12 18:25:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:25:50,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:25:50,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197101824] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:50,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:25:50,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2024-10-12 18:25:50,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017446080] [2024-10-12 18:25:50,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 18:25:50,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-12 18:25:50,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:50,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-12 18:25:50,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1815, Unknown=31, NotChecked=0, Total=1980 [2024-10-12 18:25:50,801 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 39 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:25:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:52,157 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-10-12 18:25:52,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 18:25:52,158 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2024-10-12 18:25:52,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:52,159 INFO L225 Difference]: With dead ends: 53 [2024-10-12 18:25:52,160 INFO L226 Difference]: Without dead ends: 51 [2024-10-12 18:25:52,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=256, Invalid=3019, Unknown=31, NotChecked=0, Total=3306 [2024-10-12 18:25:52,162 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:52,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 461 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 18:25:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-12 18:25:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2024-10-12 18:25:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:25:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-10-12 18:25:52,172 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 26 [2024-10-12 18:25:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:52,173 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-10-12 18:25:52,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:25:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-10-12 18:25:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 18:25:52,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:52,174 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:52,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 18:25:52,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:52,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:52,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:52,382 INFO L85 PathProgramCache]: Analyzing trace with hash 462823476, now seen corresponding path program 2 times [2024-10-12 18:25:52,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:52,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486445419] [2024-10-12 18:25:52,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:52,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:52,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:52,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:25:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:52,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:25:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:25:52,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:52,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486445419] [2024-10-12 18:25:52,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486445419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:25:52,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:25:52,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:25:52,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430136705] [2024-10-12 18:25:52,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:25:52,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:25:52,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:52,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:25:52,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:25:52,582 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 18:25:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:52,651 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2024-10-12 18:25:52,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:25:52,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-10-12 18:25:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:52,652 INFO L225 Difference]: With dead ends: 52 [2024-10-12 18:25:52,652 INFO L226 Difference]: Without dead ends: 36 [2024-10-12 18:25:52,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:25:52,653 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:52,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 104 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:25:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-12 18:25:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-10-12 18:25:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:25:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-10-12 18:25:52,662 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 27 [2024-10-12 18:25:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:52,662 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-10-12 18:25:52,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 18:25:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-10-12 18:25:52,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 18:25:52,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:52,663 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:52,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 18:25:52,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:52,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash 162755610, now seen corresponding path program 1 times [2024-10-12 18:25:52,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:52,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760619155] [2024-10-12 18:25:52,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:52,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:52,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:25:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:52,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:25:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:25:52,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:52,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760619155] [2024-10-12 18:25:52,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760619155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:25:52,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:25:52,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:25:52,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006127219] [2024-10-12 18:25:52,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:25:52,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:25:52,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:52,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:25:52,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:25:52,802 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 18:25:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:52,858 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2024-10-12 18:25:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:25:52,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-10-12 18:25:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:52,860 INFO L225 Difference]: With dead ends: 50 [2024-10-12 18:25:52,860 INFO L226 Difference]: Without dead ends: 35 [2024-10-12 18:25:52,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:25:52,861 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:52,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 79 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:25:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-12 18:25:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-10-12 18:25:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 18:25:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-10-12 18:25:52,873 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 27 [2024-10-12 18:25:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:52,873 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-10-12 18:25:52,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 18:25:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-10-12 18:25:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:25:52,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:52,874 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:52,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 18:25:52,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:52,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:52,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1596717782, now seen corresponding path program 1 times [2024-10-12 18:25:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:52,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797355880] [2024-10-12 18:25:52,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:53,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:53,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:25:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:53,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:25:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:25:53,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:53,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797355880] [2024-10-12 18:25:53,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797355880] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:53,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688815749] [2024-10-12 18:25:53,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:53,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:53,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:53,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:25:53,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 18:25:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:53,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 18:25:53,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:25:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:25:53,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:25:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:25:53,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688815749] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:25:53,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:25:53,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-10-12 18:25:53,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747998726] [2024-10-12 18:25:53,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:25:53,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 18:25:53,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:53,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 18:25:53,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:25:53,358 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 18:25:53,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:25:53,474 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2024-10-12 18:25:53,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:25:53,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-10-12 18:25:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:25:53,475 INFO L225 Difference]: With dead ends: 46 [2024-10-12 18:25:53,475 INFO L226 Difference]: Without dead ends: 33 [2024-10-12 18:25:53,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-12 18:25:53,476 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:25:53,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 116 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:25:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-12 18:25:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-12 18:25:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 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) [2024-10-12 18:25:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-10-12 18:25:53,485 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 28 [2024-10-12 18:25:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:25:53,487 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-12 18:25:53,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 18:25:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-10-12 18:25:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 18:25:53,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:25:53,488 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:25:53,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:25:53,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-12 18:25:53,689 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:25:53,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:25:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1539459480, now seen corresponding path program 1 times [2024-10-12 18:25:53,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:25:53,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488675380] [2024-10-12 18:25:53,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:53,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:25:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:53,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:25:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:53,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:25:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:53,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:25:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:25:53,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:25:53,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488675380] [2024-10-12 18:25:53,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488675380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:25:53,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495149194] [2024-10-12 18:25:53,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:25:53,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:25:53,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:25:53,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:25:53,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 18:25:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:25:54,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 18:25:54,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:25:54,192 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 16 treesize of output 8 [2024-10-12 18:25:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:25:54,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:25:54,254 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 18:25:54,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495149194] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:25:54,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:25:54,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 14 [2024-10-12 18:25:54,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437125397] [2024-10-12 18:25:54,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:25:54,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 18:25:54,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:25:54,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 18:25:54,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-12 18:25:54,256 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 18:25:58,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:26:02,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:26:06,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:26:10,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:26:14,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-12 18:26:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:14,547 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2024-10-12 18:26:14,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 18:26:14,548 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-10-12 18:26:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:14,548 INFO L225 Difference]: With dead ends: 49 [2024-10-12 18:26:14,549 INFO L226 Difference]: Without dead ends: 35 [2024-10-12 18:26:14,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-10-12 18:26:14,550 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:14,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 255 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-10-12 18:26:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-12 18:26:14,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-10-12 18:26:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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) [2024-10-12 18:26:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-12 18:26:14,559 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2024-10-12 18:26:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:14,560 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-12 18:26:14,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 18:26:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-12 18:26:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:26:14,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:14,561 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:14,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 18:26:14,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:14,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:14,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:14,763 INFO L85 PathProgramCache]: Analyzing trace with hash -152500382, now seen corresponding path program 1 times [2024-10-12 18:26:14,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:14,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399937210] [2024-10-12 18:26:14,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:14,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:26:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:14,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:26:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:14,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:26:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:26:15,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399937210] [2024-10-12 18:26:15,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399937210] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948061649] [2024-10-12 18:26:15,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:15,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:15,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:15,011 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:26:15,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 18:26:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:15,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 18:26:15,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:26:15,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 18:26:15,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948061649] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:26:15,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:26:15,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2024-10-12 18:26:15,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214303815] [2024-10-12 18:26:15,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:26:15,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 18:26:15,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:26:15,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 18:26:15,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:26:15,300 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 18:26:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:26:15,378 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-10-12 18:26:15,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:26:15,378 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-10-12 18:26:15,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:26:15,379 INFO L225 Difference]: With dead ends: 42 [2024-10-12 18:26:15,379 INFO L226 Difference]: Without dead ends: 31 [2024-10-12 18:26:15,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-12 18:26:15,380 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:26:15,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:26:15,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-12 18:26:15,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-12 18:26:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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) [2024-10-12 18:26:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-12 18:26:15,390 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 29 [2024-10-12 18:26:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:26:15,391 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-12 18:26:15,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 18:26:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-10-12 18:26:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-12 18:26:15,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:26:15,393 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:26:15,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 18:26:15,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:15,594 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:26:15,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:26:15,595 INFO L85 PathProgramCache]: Analyzing trace with hash -152544092, now seen corresponding path program 1 times [2024-10-12 18:26:15,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:26:15,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974366165] [2024-10-12 18:26:15,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:15,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:26:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 18:26:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 18:26:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 18:26:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 18:26:16,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:26:16,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974366165] [2024-10-12 18:26:16,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974366165] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:26:16,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864004885] [2024-10-12 18:26:16,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:26:16,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:26:16,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:26:16,782 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:26:16,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 18:26:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:26:17,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-10-12 18:26:17,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:26:17,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 18:26:17,315 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 [2024-10-12 18:26:17,410 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 [2024-10-12 18:26:17,481 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-12 18:26:17,481 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 [2024-10-12 18:26:17,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 18:26:17,744 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 30 treesize of output 27 [2024-10-12 18:26:17,753 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-12 18:26:17,766 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-12 18:26:17,767 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 78 [2024-10-12 18:26:17,774 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-10-12 18:26:17,779 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 36 treesize of output 15 [2024-10-12 18:26:17,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 19 [2024-10-12 18:26:17,871 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 50 treesize of output 30 [2024-10-12 18:26:17,965 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 27 treesize of output 15 [2024-10-12 18:26:17,971 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 7 treesize of output 3 [2024-10-12 18:26:17,978 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 15 treesize of output 7 [2024-10-12 18:26:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 18:26:17,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:26:18,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:18,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 62 [2024-10-12 18:26:18,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:18,130 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 123 [2024-10-12 18:26:18,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:18,144 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 92 [2024-10-12 18:26:18,153 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 44 treesize of output 38 [2024-10-12 18:26:18,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:18,172 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 149 [2024-10-12 18:26:18,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-10-12 18:26:18,590 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse6 (forall ((v_arrayElimCell_29 Int) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_32 Int)) (or (not (= v_ArrVal_1273 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1273) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))))) (.cse7 (not .cse1)) (.cse10 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (let ((.cse2 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)) (.cse3 (or .cse1 (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (or (not (= v_ArrVal_1273 (store (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1273) v_arrayElimCell_27) (+ 4 v_arrayElimCell_30)))))))) (.cse4 (or .cse1 (forall ((v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (or (not (= v_ArrVal_1273 (store (select .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1273) v_arrayElimCell_27) .cse10))))))) (.cse8 (forall ((v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (let ((.cse19 (store .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1273))) (or (not (= v_ArrVal_1273 (store (select .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse19 v_arrayElimCell_27) .cse10)) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse19 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))))))) (.cse9 (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (let ((.cse17 (store .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1273))) (or (not (= v_ArrVal_1273 (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse17 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse17 v_arrayElimCell_27) (+ 4 v_arrayElimCell_30)))))))) (.cse0 (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (or (not (= v_ArrVal_1273 (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1273 (+ 4 v_arrayElimCell_30))) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1273) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))))))) (.cse12 (or .cse6 .cse7)) (.cse5 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse14))) (and (or (and .cse0 (or (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1268 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2) (+ 4 v_arrayElimCell_30)))) .cse1)) .cse2) (or (and .cse3 .cse4 (or .cse5 .cse6 .cse7) .cse8 .cse9) .cse2) (or .cse1 (forall ((v_ArrVal_1268 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse10)))) (forall ((v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (or (not (= v_ArrVal_1273 (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1273) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))) (= (select v_ArrVal_1273 .cse10) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse5 (and .cse3 .cse4 .cse12 .cse8 .cse9)) (or (and .cse0 (or (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1268 (Array Int Int)) (v_DerPreprocessor_3 Int)) (= (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3) (+ 4 v_arrayElimCell_30)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse1) .cse12) .cse5) (or .cse7 (forall ((v_arrayElimCell_29 Int) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1268))) (or (not (= v_ArrVal_1273 (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1273) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))))))))))) is different from false [2024-10-12 18:26:19,692 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (= .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (let ((.cse7 (not .cse2)) (.cse9 (forall ((v_arrayElimCell_29 Int) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_32 Int)) (or (not (= v_ArrVal_1273 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| .cse1 v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1273) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))))) (.cse11 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4))) (let ((.cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (.cse4 (or (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#2| .cse1 v_ArrVal_1268))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse22 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1273) v_arrayElimCell_27) (+ 4 v_arrayElimCell_30))) (not (= (store (select .cse22 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1273))))) .cse2)) (.cse5 (forall ((v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#2| .cse1 v_ArrVal_1268))) (let ((.cse21 (store .cse20 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1273))) (or (not (= (store (select .cse20 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1273)) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse21 v_arrayElimCell_27) .cse11))))))) (.cse6 (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#2| .cse1 v_ArrVal_1268))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1273))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_arrayElimCell_27) (+ 4 v_arrayElimCell_30))) (not (= (store (select .cse19 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1273)) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))))))) (.cse10 (or (forall ((v_ArrVal_1268 (Array Int Int)) (v_arrayElimCell_27 Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#2| .cse1 v_ArrVal_1268))) (or (not (= (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1273)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1273) v_arrayElimCell_27) .cse11))))) .cse2)) (.cse8 (= .cse16 .cse1)) (.cse13 (or .cse7 .cse9)) (.cse0 (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#2| .cse1 v_ArrVal_1268))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1273 (+ 4 v_arrayElimCell_30))) (not (= (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1273)) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1273) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))))))) (and (or (and .cse0 (or (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1268 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= (select (store (select (store |c_#memory_int#2| .cse1 v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_DerPreprocessor_2) (+ 4 v_arrayElimCell_30)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse2)) .cse3) (or (and .cse4 .cse5 .cse6 (or .cse7 .cse8 .cse9) .cse10) .cse3) (or (forall ((v_ArrVal_1268 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| .cse1 v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse11))) .cse2) (forall ((v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#2| .cse1 v_ArrVal_1268))) (or (= (select v_ArrVal_1273 .cse11) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1273)) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1273) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))))) (or (and .cse4 .cse5 .cse13 .cse6 .cse10) .cse8) (or .cse7 (forall ((v_arrayElimCell_29 Int) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse14 (store |c_#memory_int#2| .cse1 v_ArrVal_1268))) (or (not (= (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1273 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1273)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1273) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))))) (or .cse8 (and (or (forall ((v_arrayElimCell_30 Int) (v_ArrVal_1268 (Array Int Int)) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| .cse1 v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_DerPreprocessor_3) (+ 4 v_arrayElimCell_30)))) .cse2) .cse13 .cse0))))))) is different from false [2024-10-12 18:26:22,515 INFO L349 Elim1Store]: treesize reduction 1615, result has 18.7 percent of original size [2024-10-12 18:26:22,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 211 case distinctions, treesize of input 2511 treesize of output 2704 [2024-10-12 18:26:22,725 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 1745 treesize of output 1741 [2024-10-12 18:26:23,012 INFO L224 Elim1Store]: Index analysis took 151 ms [2024-10-12 18:26:25,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:25,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 2255 treesize of output 3705 [2024-10-12 18:26:26,775 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-10-12 18:26:26,776 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2046 treesize of output 2080 [2024-10-12 18:26:27,480 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2024-10-12 18:26:27,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 2033 treesize of output 2052 [2024-10-12 18:26:28,689 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-12 18:26:28,689 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2024 treesize of output 2039 [2024-10-12 18:26:29,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:29,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2015 treesize of output 2023 [2024-10-12 18:26:30,506 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-12 18:26:30,507 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2010 treesize of output 2025 [2024-10-12 18:26:31,237 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 2001 treesize of output 1997 [2024-10-12 18:26:31,801 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 2011 treesize of output 2007 [2024-10-12 18:26:32,410 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-12 18:26:32,411 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2007 treesize of output 2022 [2024-10-12 18:26:33,054 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-10-12 18:26:33,054 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1998 treesize of output 2032 [2024-10-12 18:26:33,722 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-12 18:26:33,723 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1985 treesize of output 2000 [2024-10-12 18:26:34,388 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-12 18:26:34,389 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1976 treesize of output 1991 [2024-10-12 18:26:35,113 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-12 18:26:35,114 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1967 treesize of output 1982 [2024-10-12 18:26:35,757 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 1972 treesize of output 1968 [2024-10-12 18:26:36,405 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 1968 treesize of output 1966 [2024-10-12 18:26:37,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 18:26:37,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1966 treesize of output 1974 [2024-10-12 18:26:38,432 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 1961 treesize of output 1957 [2024-10-12 18:26:39,384 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2024-10-12 18:26:39,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 1957 treesize of output 1976