./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:08:52,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:08:52,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:08:52,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:08:52,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:08:52,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:08:52,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:08:52,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:08:52,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:08:52,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:08:52,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:08:52,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:08:52,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:08:52,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:08:52,661 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:08:52,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:08:52,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:08:52,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:08:52,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:08:52,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:08:52,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:08:52,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:08:52,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:08:52,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:08:52,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:08:52,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:08:52,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:08:52,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:08:52,668 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:08:52,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:08:52,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:08:52,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:08:52,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:08:52,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:08:52,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:08:52,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:08:52,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:08:52,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:08:52,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:08:52,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:08:52,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:08:52,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:08:52,673 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-11-09 22:08:52,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:08:52,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:08:52,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:08:52,964 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:08:52,965 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:08:52,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-11-09 22:08:54,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:08:54,666 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:08:54,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-11-09 22:08:54,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f5962578/63101af0ee184a2eaa8a4de59e67255b/FLAG23abe9e53 [2024-11-09 22:08:54,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f5962578/63101af0ee184a2eaa8a4de59e67255b [2024-11-09 22:08:54,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:08:54,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:08:54,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:08:54,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:08:54,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:08:54,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:08:54" (1/1) ... [2024-11-09 22:08:54,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a235556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:54, skipping insertion in model container [2024-11-09 22:08:54,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:08:54" (1/1) ... [2024-11-09 22:08:54,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:08:55,088 WARN L250 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-11-09 22:08:55,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:08:55,105 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:08:55,178 WARN L250 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-11-09 22:08:55,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:08:55,210 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:08:55,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55 WrapperNode [2024-11-09 22:08:55,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:08:55,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:08:55,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:08:55,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:08:55,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55" (1/1) ... [2024-11-09 22:08:55,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55" (1/1) ... [2024-11-09 22:08:55,263 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 169 [2024-11-09 22:08:55,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:08:55,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:08:55,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:08:55,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:08:55,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55" (1/1) ... [2024-11-09 22:08:55,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55" (1/1) ... [2024-11-09 22:08:55,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55" (1/1) ... [2024-11-09 22:08:55,310 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 18, 10]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-11-09 22:08:55,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55" (1/1) ... [2024-11-09 22:08:55,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55" (1/1) ... [2024-11-09 22:08:55,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55" (1/1) ... [2024-11-09 22:08:55,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55" (1/1) ... [2024-11-09 22:08:55,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55" (1/1) ... [2024-11-09 22:08:55,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55" (1/1) ... [2024-11-09 22:08:55,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:08:55,334 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:08:55,334 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:08:55,335 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:08:55,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55" (1/1) ... [2024-11-09 22:08:55,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:08:55,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:08:55,374 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-11-09 22:08:55,378 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-11-09 22:08:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 22:08:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 22:08:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 22:08:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:08:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:08:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 22:08:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 22:08:55,438 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 22:08:55,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:08:55,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:08:55,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 22:08:55,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:08:55,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:08:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 22:08:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:08:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:08:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 22:08:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:08:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 22:08:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 22:08:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 22:08:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:08:55,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:08:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 22:08:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:08:55,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:08:55,669 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:08:55,671 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:08:55,951 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-09 22:08:55,973 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-09 22:08:56,000 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-11-09 22:08:56,001 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:08:56,014 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:08:56,014 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:08:56,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:08:56 BoogieIcfgContainer [2024-11-09 22:08:56,015 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:08:56,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:08:56,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:08:56,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:08:56,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:08:54" (1/3) ... [2024-11-09 22:08:56,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce92d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:08:56, skipping insertion in model container [2024-11-09 22:08:56,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:08:55" (2/3) ... [2024-11-09 22:08:56,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce92d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:08:56, skipping insertion in model container [2024-11-09 22:08:56,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:08:56" (3/3) ... [2024-11-09 22:08:56,026 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2024-11-09 22:08:56,043 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:08:56,043 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:08:56,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:08:56,105 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;@15e093c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:08:56,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:08:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:08:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:08:56,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:08:56,116 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:08:56,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:08:56,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:08:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash -176916179, now seen corresponding path program 1 times [2024-11-09 22:08:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:08:56,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104046962] [2024-11-09 22:08:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:08:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:56,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:08:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:56,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:08:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 22:08:56,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:08:56,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104046962] [2024-11-09 22:08:56,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104046962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:08:56,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:08:56,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:08:56,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9104480] [2024-11-09 22:08:56,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:08:56,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:08:56,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:08:56,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:08:56,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:08:56,484 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 states have internal predecessors, (58), 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 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:08:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:08:56,555 INFO L93 Difference]: Finished difference Result 81 states and 115 transitions. [2024-11-09 22:08:56,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:08:56,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-09 22:08:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:08:56,565 INFO L225 Difference]: With dead ends: 81 [2024-11-09 22:08:56,565 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 22:08:56,568 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-11-09 22:08:56,572 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:08:56,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:08:56,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 22:08:56,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 22:08:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:08:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2024-11-09 22:08:56,619 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 26 [2024-11-09 22:08:56,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:08:56,620 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-11-09 22:08:56,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:08:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-11-09 22:08:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 22:08:56,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:08:56,622 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:08:56,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:08:56,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:08:56,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:08:56,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1783785455, now seen corresponding path program 1 times [2024-11-09 22:08:56,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:08:56,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832192028] [2024-11-09 22:08:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:56,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:08:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:56,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:08:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 22:08:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 22:08:57,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:08:57,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832192028] [2024-11-09 22:08:57,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832192028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:08:57,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:08:57,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:08:57,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404696707] [2024-11-09 22:08:57,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:08:57,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:08:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:08:57,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:08:57,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:08:57,017 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:08:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:08:57,074 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-11-09 22:08:57,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:08:57,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-09 22:08:57,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:08:57,076 INFO L225 Difference]: With dead ends: 66 [2024-11-09 22:08:57,076 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 22:08:57,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:08:57,078 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:08:57,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 104 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:08:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 22:08:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-09 22:08:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:08:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2024-11-09 22:08:57,086 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 28 [2024-11-09 22:08:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:08:57,086 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-11-09 22:08:57,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:08:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2024-11-09 22:08:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 22:08:57,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:08:57,088 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:08:57,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:08:57,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:08:57,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:08:57,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2063644769, now seen corresponding path program 1 times [2024-11-09 22:08:57,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:08:57,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387508928] [2024-11-09 22:08:57,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:57,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:08:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:57,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:08:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:57,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:08:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:08:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:08:57,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:08:57,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387508928] [2024-11-09 22:08:57,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387508928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:08:57,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:08:57,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:08:57,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854976047] [2024-11-09 22:08:57,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:08:57,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:08:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:08:57,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:08:57,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:08:57,294 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-11-09 22:08:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:08:57,337 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-09 22:08:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:08:57,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 37 [2024-11-09 22:08:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:08:57,339 INFO L225 Difference]: With dead ends: 53 [2024-11-09 22:08:57,339 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 22:08:57,340 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-11-09 22:08:57,341 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:08:57,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:08:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 22:08:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 22:08:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 22:08:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2024-11-09 22:08:57,351 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 37 [2024-11-09 22:08:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:08:57,352 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-09 22:08:57,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-11-09 22:08:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2024-11-09 22:08:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 22:08:57,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:08:57,356 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:08:57,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:08:57,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:08:57,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:08:57,357 INFO L85 PathProgramCache]: Analyzing trace with hash 51881854, now seen corresponding path program 1 times [2024-11-09 22:08:57,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:08:57,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739367027] [2024-11-09 22:08:57,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:57,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:08:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:57,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:08:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:57,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:08:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:57,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:08:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:08:57,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:08:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739367027] [2024-11-09 22:08:57,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739367027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:08:57,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:08:57,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:08:57,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627044392] [2024-11-09 22:08:57,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:08:57,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:08:57,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:08:57,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:08:57,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:08:57,691 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-11-09 22:08:57,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:08:57,772 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2024-11-09 22:08:57,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:08:57,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 39 [2024-11-09 22:08:57,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:08:57,774 INFO L225 Difference]: With dead ends: 58 [2024-11-09 22:08:57,775 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 22:08:57,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-11-09 22:08:57,776 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 28 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:08:57,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 111 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:08:57,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 22:08:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-09 22:08:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 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-11-09 22:08:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-09 22:08:57,791 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 39 [2024-11-09 22:08:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:08:57,791 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-09 22:08:57,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-11-09 22:08:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-09 22:08:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 22:08:57,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:08:57,794 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:08:57,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 22:08:57,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:08:57,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:08:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash 82475584, now seen corresponding path program 1 times [2024-11-09 22:08:57,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:08:57,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453384517] [2024-11-09 22:08:57,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:57,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:08:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:59,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:08:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:59,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:08:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:59,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:08:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:08:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:08:59,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:08:59,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453384517] [2024-11-09 22:08:59,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453384517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:08:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16508820] [2024-11-09 22:08:59,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:08:59,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:08:59,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:08:59,817 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-11-09 22:08:59,820 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-11-09 22:09:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:00,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-09 22:09:00,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:00,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:09:00,743 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-11-09 22:09:00,840 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:09:00,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 22:09:00,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 22:09:01,050 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 16 treesize of output 11 [2024-11-09 22:09:01,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-09 22:09:01,286 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-11-09 22:09:01,518 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 22:09:01,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-09 22:09:01,557 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 22:09:01,558 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-11-09 22:09:01,911 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 59 treesize of output 26 [2024-11-09 22:09:01,916 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 26 treesize of output 15 [2024-11-09 22:09:01,984 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 19 treesize of output 11 [2024-11-09 22:09:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:09:02,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:02,172 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_510) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_509 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_509 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))))) is different from false [2024-11-09 22:09:02,214 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (not (= v_ArrVal_509 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_509 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_509) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_510) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2024-11-09 22:09:02,238 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_509) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_510) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_509 (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_509 .cse1)))))))) is different from false [2024-11-09 22:09:02,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16508820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:02,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:09:02,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2024-11-09 22:09:02,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109407803] [2024-11-09 22:09:02,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:02,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-09 22:09:02,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:02,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-09 22:09:02,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1924, Unknown=3, NotChecked=270, Total=2352 [2024-11-09 22:09:02,384 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 43 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 34 states have internal predecessors, (63), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:09:03,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:03,662 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2024-11-09 22:09:03,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 22:09:03,662 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 34 states have internal predecessors, (63), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2024-11-09 22:09:03,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:03,663 INFO L225 Difference]: With dead ends: 67 [2024-11-09 22:09:03,664 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 22:09:03,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=277, Invalid=3392, Unknown=3, NotChecked=360, Total=4032 [2024-11-09 22:09:03,666 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 44 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:03,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 608 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 22:09:03,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 22:09:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2024-11-09 22:09:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 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-11-09 22:09:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-11-09 22:09:03,683 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 39 [2024-11-09 22:09:03,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:03,683 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-11-09 22:09:03,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 34 states have internal predecessors, (63), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:09:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-11-09 22:09:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 22:09:03,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:03,687 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:03,711 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-11-09 22:09:03,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:03,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:03,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:03,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1181192803, now seen corresponding path program 1 times [2024-11-09 22:09:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:03,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633116711] [2024-11-09 22:09:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:03,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:09:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:09:04,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:04,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633116711] [2024-11-09 22:09:04,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633116711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:04,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161132469] [2024-11-09 22:09:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:04,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:04,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:04,059 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-11-09 22:09:04,062 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-11-09 22:09:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 22:09:04,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:09:04,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:04,341 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:09:04,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161132469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:09:04,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:09:04,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-09 22:09:04,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540513302] [2024-11-09 22:09:04,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:04,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 22:09:04,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:04,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 22:09:04,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:09:04,343 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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-11-09 22:09:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:04,460 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2024-11-09 22:09:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:09:04,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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 41 [2024-11-09 22:09:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:04,465 INFO L225 Difference]: With dead ends: 66 [2024-11-09 22:09:04,465 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 22:09:04,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 85 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-11-09 22:09:04,466 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:04,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 238 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:09:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 22:09:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-09 22:09:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 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-11-09 22:09:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-11-09 22:09:04,479 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 41 [2024-11-09 22:09:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:04,479 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-11-09 22:09:04,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 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-11-09 22:09:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-11-09 22:09:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 22:09:04,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:04,480 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:04,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 22:09:04,681 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,SelfDestructingSolverStorable5 [2024-11-09 22:09:04,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:04,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:04,682 INFO L85 PathProgramCache]: Analyzing trace with hash -293689122, now seen corresponding path program 1 times [2024-11-09 22:09:04,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:04,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591143833] [2024-11-09 22:09:04,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:09:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:09:04,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:04,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591143833] [2024-11-09 22:09:04,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591143833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:04,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776071819] [2024-11-09 22:09:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:04,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:04,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:04,973 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-11-09 22:09:04,974 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-11-09 22:09:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:05,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 22:09:05,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:05,251 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-11-09 22:09:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 22:09:05,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 22:09:05,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776071819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:09:05,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:09:05,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 15 [2024-11-09 22:09:05,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779496337] [2024-11-09 22:09:05,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:09:05,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 22:09:05,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:05,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 22:09:05,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-09 22:09:05,334 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 13 states have internal predecessors, (44), 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-11-09 22:09:09,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:09:13,366 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-11-09 22:09:17,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:09:21,392 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-11-09 22:09:25,571 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-11-09 22:09:29,618 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-11-09 22:09:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:29,625 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2024-11-09 22:09:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 22:09:29,626 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 13 states have internal predecessors, (44), 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 41 [2024-11-09 22:09:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:29,627 INFO L225 Difference]: With dead ends: 80 [2024-11-09 22:09:29,627 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 22:09:29,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-09 22:09:29,628 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 46 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:29,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 355 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2024-11-09 22:09:29,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 22:09:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2024-11-09 22:09:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 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-11-09 22:09:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-11-09 22:09:29,640 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 41 [2024-11-09 22:09:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:29,640 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-11-09 22:09:29,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 13 states have internal predecessors, (44), 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-11-09 22:09:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-11-09 22:09:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 22:09:29,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:29,641 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:29,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:09:29,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:29,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:29,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1150599073, now seen corresponding path program 2 times [2024-11-09 22:09:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:29,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110156113] [2024-11-09 22:09:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:30,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:30,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:30,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:09:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 22:09:30,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110156113] [2024-11-09 22:09:30,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110156113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079683333] [2024-11-09 22:09:30,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:09:30,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:30,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:30,040 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-11-09 22:09:30,041 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-11-09 22:09:30,221 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:09:30,221 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:09:30,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:09:30,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 22:09:30,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:09:30,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079683333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:09:30,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:09:30,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-09 22:09:30,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082986520] [2024-11-09 22:09:30,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:09:30,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:09:30,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:09:30,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:09:30,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:09:30,266 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-11-09 22:09:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:09:30,297 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2024-11-09 22:09:30,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:09:30,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 41 [2024-11-09 22:09:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:09:30,299 INFO L225 Difference]: With dead ends: 65 [2024-11-09 22:09:30,299 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 22:09:30,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 22:09:30,300 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:09:30,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 116 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:09:30,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 22:09:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-09 22:09:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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-11-09 22:09:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-09 22:09:30,315 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 41 [2024-11-09 22:09:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:09:30,316 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-09 22:09:30,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-11-09 22:09:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-09 22:09:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 22:09:30,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:09:30,317 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:09:30,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 22:09:30,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:30,517 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:09:30,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:09:30,518 INFO L85 PathProgramCache]: Analyzing trace with hash 396626783, now seen corresponding path program 1 times [2024-11-09 22:09:30,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:09:30,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319524419] [2024-11-09 22:09:30,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:30,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:09:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:31,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:09:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:31,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:09:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:31,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:09:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 22:09:31,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:09:31,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319524419] [2024-11-09 22:09:31,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319524419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:09:31,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492991784] [2024-11-09 22:09:31,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:09:31,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:09:31,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:09:31,687 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-11-09 22:09:31,688 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-11-09 22:09:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:09:31,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-09 22:09:31,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:09:31,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 22:09:32,183 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 22:09:32,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 22:09:32,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:09:32,324 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 22:09:32,324 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 34 treesize of output 33 [2024-11-09 22:09:32,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 22:09:32,455 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-11-09 22:09:32,590 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-11-09 22:09:32,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:09:32,686 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 38 treesize of output 27 [2024-11-09 22:09:32,708 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 22:09:32,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-09 22:09:33,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:09:33,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2024-11-09 22:09:33,128 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 32 [2024-11-09 22:09:33,141 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 22:09:33,142 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-11-09 22:09:33,146 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-11-09 22:09:33,154 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-11-09 22:09:33,158 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-11-09 22:09:33,235 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-11-09 22:09:33,336 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-11-09 22:09:33,342 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-11-09 22:09:33,350 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-11-09 22:09:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:09:33,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:09:33,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:09:33,479 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 69 treesize of output 70 [2024-11-09 22:09:33,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:09:33,490 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 136 treesize of output 139 [2024-11-09 22:09:33,498 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 60 treesize of output 54 [2024-11-09 22:09:33,651 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse0 (and (forall ((v_ArrVal_1176 Int) (v_arrayElimCell_36 Int) (v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse9 (select (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1182))) (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1176))) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1178) .cse1) .cse4)))) (or (forall ((v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 (+ 4 v_arrayElimCell_37)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 (+ 4 v_arrayElimCell_36)))))) (or .cse2 (forall ((v_ArrVal_1176 Int) (v_ArrVal_1178 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_1182 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1182))) (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (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| v_ArrVal_1176))) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1178) .cse1) .cse4)) (+ 4 v_arrayElimCell_36)))))))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse1)) (or .cse2 (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1182) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1178) .cse1) .cse4)) .cse5)))) (or (forall ((v_ArrVal_1176 Int) (v_ArrVal_1178 (Array Int Int)) (v_arrayElimCell_37 Int) (v_ArrVal_1182 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1182))) (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1176))) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1178) .cse1) .cse4)) (+ 4 v_arrayElimCell_37)))) (not .cse2)) (forall ((v_ArrVal_1176 Int) (v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1182)) (.cse8 (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1178) .cse1) .cse4))) (or (forall ((v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1176)) .cse8) (+ 4 v_arrayElimCell_37)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse7 .cse8) .cse5))))) (or .cse0 (= .cse4 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))))) is different from false [2024-11-09 22:09:33,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse8 (and (forall ((v_ArrVal_1176 Int) (v_arrayElimCell_36 Int) (v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse9 (select (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1182))) (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1176))) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1178) .cse3) .cse4)))) (or (forall ((v_arrayElimCell_37 Int)) (= (select .cse9 (+ 4 v_arrayElimCell_37)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 (+ 4 v_arrayElimCell_36)))))) (or .cse0 (forall ((v_ArrVal_1176 Int) (v_ArrVal_1178 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_1182 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1182))) (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (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| v_ArrVal_1176))) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1178) .cse3) .cse4)) (+ 4 v_arrayElimCell_36)))))))) (and (or (not .cse0) (forall ((v_ArrVal_1176 Int) (v_ArrVal_1178 (Array Int Int)) (v_arrayElimCell_37 Int) (v_ArrVal_1182 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1182))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1176))) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1178) .cse3) .cse4)) (+ 4 v_arrayElimCell_37)) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1176 Int) (v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1182)) (.cse6 (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1178) .cse3) .cse4))) (or (forall ((v_arrayElimCell_37 Int)) (= (select (select (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1176)) .cse6) (+ 4 v_arrayElimCell_37)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse5 .cse6) .cse7))))) (or (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1182) (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1178) .cse3) .cse4)) .cse7))) .cse0) (or .cse8 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| .cse4)) (or (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) .cse8))))) is different from false [2024-11-09 22:09:34,111 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse4)) (.cse3 (store |c_#memory_$Pointer$#1.base| .cse6 (store (select |c_#memory_$Pointer$#1.base| .cse6) .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4)) (.cse9 (and (forall ((v_ArrVal_1176 Int) (v_arrayElimCell_36 Int) (v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse11 (select (let ((.cse12 (store |c_#memory_int#1| .cse6 v_ArrVal_1182))) (store .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1176))) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1178) .cse4) .cse5)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 4 v_arrayElimCell_36))) (forall ((v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 4 v_arrayElimCell_37))))))) (or .cse7 (forall ((v_ArrVal_1176 Int) (v_ArrVal_1178 (Array Int Int)) (v_arrayElimCell_36 Int) (v_ArrVal_1182 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse13 (store |c_#memory_int#1| .cse6 v_ArrVal_1182))) (store .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1176))) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1178) .cse4) .cse5)) (+ 4 v_arrayElimCell_36)))))))) (and (forall ((v_ArrVal_1176 Int) (v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| .cse6 v_ArrVal_1182)) (.cse1 (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1178) .cse4) .cse5))) (or (forall ((v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1176)) .cse1) (+ 4 v_arrayElimCell_37)))) (= (select (select .cse0 .cse1) .cse2) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse7 (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store |c_#memory_int#1| .cse6 v_ArrVal_1182) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1178) .cse4) .cse5)) .cse2) |c_ULTIMATE.start_main_~uneq~0#1|))) (or (not .cse7) (forall ((v_ArrVal_1176 Int) (v_ArrVal_1178 (Array Int Int)) (v_arrayElimCell_37 Int) (v_ArrVal_1182 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse8 (store |c_#memory_int#1| .cse6 v_ArrVal_1182))) (store .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1176))) (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1178) .cse4) .cse5)) (+ 4 v_arrayElimCell_37))))) (or (= .cse6 .cse4) .cse9) (or (= .cse10 .cse5) .cse9))))) is different from false [2024-11-09 22:09:35,847 INFO L349 Elim1Store]: treesize reduction 744, result has 80.4 percent of original size [2024-11-09 22:09:35,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 37 case distinctions, treesize of input 4119 treesize of output 6558 [2024-11-09 22:09:36,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:09:36,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 3982 treesize of output 5634 [2024-11-09 22:09:36,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:09:36,508 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 3149 treesize of output 3134 [2024-11-09 22:09:36,653 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 3153 treesize of output 3141 [2024-11-09 22:09:36,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:09:36,830 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 3169 treesize of output 3164 [2024-11-09 22:09:37,015 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 3183 treesize of output 3171 [2024-11-09 22:09:37,193 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 3171 treesize of output 3169 [2024-11-09 22:09:37,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:09:37,419 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 3225 treesize of output 3210 [2024-11-09 22:09:37,567 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 3229 treesize of output 3217 [2024-11-09 22:09:47,749 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 8 treesize of output 4