./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/dll2n_prepend_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 a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:36:56,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:36:56,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:36:56,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:36:56,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:36:56,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:36:56,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:36:56,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:36:56,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:36:56,746 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:36:56,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:36:56,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:36:56,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:36:56,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:36:56,753 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:36:56,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:36:56,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:36:56,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:36:56,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:36:56,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:36:56,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:36:56,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:36:56,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:36:56,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:36:56,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:36:56,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:36:56,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:36:56,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:36:56,758 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:36:56,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:36:56,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:36:56,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:36:56,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:36:56,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:36:56,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:36:56,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:36:56,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:36:56,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:36:56,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:36:56,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:36:56,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:36:56,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:36:56,762 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 -> a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 [2024-11-16 06:36:57,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:36:57,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:36:57,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:36:57,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:36:57,045 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:36:57,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2024-11-16 06:36:58,367 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:36:58,563 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:36:58,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2024-11-16 06:36:58,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c2aae3f/d43fb5d74dfd46a69aebdbc66a1b647e/FLAG0ca1375be [2024-11-16 06:36:58,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c2aae3f/d43fb5d74dfd46a69aebdbc66a1b647e [2024-11-16 06:36:58,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:36:58,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:36:58,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:36:58,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:36:58,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:36:58,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:58,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63634d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58, skipping insertion in model container [2024-11-16 06:36:58,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:58,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:36:58,902 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/dll2n_prepend_unequal.i[24450,24463] [2024-11-16 06:36:58,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:36:58,917 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:36:58,963 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/dll2n_prepend_unequal.i[24450,24463] [2024-11-16 06:36:58,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:36:58,992 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:36:58,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58 WrapperNode [2024-11-16 06:36:58,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:36:58,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:36:58,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:36:58,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:36:59,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:59,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:59,033 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 122 [2024-11-16 06:36:59,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:36:59,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:36:59,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:36:59,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:36:59,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:59,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:59,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:59,066 INFO L175 MemorySlicer]: Split 23 memory accesses to 3 slices as follows [2, 7, 14]. 61 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2024-11-16 06:36:59,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:59,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:59,075 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:59,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:59,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:59,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:59,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:36:59,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:36:59,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:36:59,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:36:59,091 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58" (1/1) ... [2024-11-16 06:36:59,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:36:59,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:36:59,121 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-16 06:36:59,124 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-16 06:36:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-16 06:36:59,185 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-16 06:36:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 06:36:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 06:36:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 06:36:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 06:36:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 06:36:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 06:36:59,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 06:36:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:36:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 06:36:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 06:36:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 06:36:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 06:36:59,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 06:36:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 06:36:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 06:36:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 06:36:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-16 06:36:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-16 06:36:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-16 06:36:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:36:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 06:36:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 06:36:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:36:59,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:36:59,336 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:36:59,338 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:36:59,359 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-16 06:36:59,498 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: 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-16 06:36:59,513 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2024-11-16 06:36:59,513 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:36:59,523 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:36:59,523 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:36:59,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:36:59 BoogieIcfgContainer [2024-11-16 06:36:59,523 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:36:59,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:36:59,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:36:59,528 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:36:59,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:36:58" (1/3) ... [2024-11-16 06:36:59,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdacf06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:36:59, skipping insertion in model container [2024-11-16 06:36:59,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:36:58" (2/3) ... [2024-11-16 06:36:59,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdacf06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:36:59, skipping insertion in model container [2024-11-16 06:36:59,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:36:59" (3/3) ... [2024-11-16 06:36:59,530 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.i [2024-11-16 06:36:59,546 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:36:59,546 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:36:59,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:36:59,594 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;@49197e1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:36:59,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:36:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 33 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:36:59,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 06:36:59,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:36:59,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:36:59,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:36:59,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:36:59,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1253558187, now seen corresponding path program 1 times [2024-11-16 06:36:59,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:36:59,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002962433] [2024-11-16 06:36:59,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:36:59,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:36:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:36:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:36:59,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:36:59,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002962433] [2024-11-16 06:36:59,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002962433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:36:59,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:36:59,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 06:36:59,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470151386] [2024-11-16 06:36:59,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:36:59,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 06:36:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:36:59,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 06:36:59,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:36:59,816 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 33 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:36:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:36:59,828 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2024-11-16 06:36:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 06:36:59,830 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-16 06:36:59,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:36:59,835 INFO L225 Difference]: With dead ends: 60 [2024-11-16 06:36:59,835 INFO L226 Difference]: Without dead ends: 24 [2024-11-16 06:36:59,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:36:59,840 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:36:59,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:36:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-16 06:36:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-16 06:36:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:36:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-11-16 06:36:59,866 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 14 [2024-11-16 06:36:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:36:59,867 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-16 06:36:59,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:36:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-11-16 06:36:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 06:36:59,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:36:59,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:36:59,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:36:59,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:36:59,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:36:59,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2033229359, now seen corresponding path program 1 times [2024-11-16 06:36:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:36:59,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895695636] [2024-11-16 06:36:59,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:36:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:36:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:37:00,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:00,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895695636] [2024-11-16 06:37:00,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895695636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:37:00,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:37:00,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:37:00,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122281600] [2024-11-16 06:37:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:37:00,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:37:00,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:00,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:37:00,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:37:00,032 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:00,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:00,048 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-11-16 06:37:00,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:37:00,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-16 06:37:00,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:00,049 INFO L225 Difference]: With dead ends: 46 [2024-11-16 06:37:00,049 INFO L226 Difference]: Without dead ends: 30 [2024-11-16 06:37:00,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:37:00,053 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:00,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:37:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-16 06:37:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-11-16 06:37:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-16 06:37:00,060 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2024-11-16 06:37:00,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:00,060 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-16 06:37:00,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-16 06:37:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-16 06:37:00,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:00,062 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:00,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:37:00,063 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:00,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash -754178380, now seen corresponding path program 1 times [2024-11-16 06:37:00,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:00,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22919031] [2024-11-16 06:37:00,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:00,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:37:00,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:00,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22919031] [2024-11-16 06:37:00,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22919031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:37:00,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:37:00,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:37:00,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114676444] [2024-11-16 06:37:00,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:37:00,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:37:00,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:00,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:37:00,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:37:00,144 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:00,162 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2024-11-16 06:37:00,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:37:00,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-16 06:37:00,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:00,163 INFO L225 Difference]: With dead ends: 51 [2024-11-16 06:37:00,163 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 06:37:00,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:37:00,165 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:00,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:37:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 06:37:00,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-16 06:37:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-16 06:37:00,170 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 21 [2024-11-16 06:37:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:00,170 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-16 06:37:00,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-16 06:37:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-16 06:37:00,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:00,171 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:00,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 06:37:00,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:00,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash 753373429, now seen corresponding path program 1 times [2024-11-16 06:37:00,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:00,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727983461] [2024-11-16 06:37:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:00,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:37:00,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:00,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727983461] [2024-11-16 06:37:00,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727983461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:37:00,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673884831] [2024-11-16 06:37:00,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:00,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:37:00,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:37:00,302 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-16 06:37:00,303 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-16 06:37:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:00,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 06:37:00,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:37:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:37:00,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:37:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:37:00,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673884831] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:37:00,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:37:00,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-16 06:37:00,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600947242] [2024-11-16 06:37:00,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:37:00,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:37:00,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:00,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:37:00,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:37:00,533 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:00,554 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-11-16 06:37:00,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:37:00,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-16 06:37:00,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:00,555 INFO L225 Difference]: With dead ends: 48 [2024-11-16 06:37:00,557 INFO L226 Difference]: Without dead ends: 32 [2024-11-16 06:37:00,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:37:00,558 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:00,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:37:00,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-16 06:37:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-16 06:37:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-16 06:37:00,563 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 21 [2024-11-16 06:37:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:00,564 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-16 06:37:00,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-16 06:37:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-16 06:37:00,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:00,565 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:00,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 06:37:00,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:37:00,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:00,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:00,769 INFO L85 PathProgramCache]: Analyzing trace with hash -195597062, now seen corresponding path program 1 times [2024-11-16 06:37:00,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:00,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176763315] [2024-11-16 06:37:00,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:00,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:37:01,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:01,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176763315] [2024-11-16 06:37:01,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176763315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:37:01,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:37:01,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 06:37:01,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773554879] [2024-11-16 06:37:01,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:37:01,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 06:37:01,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:01,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 06:37:01,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 06:37:01,534 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:01,682 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-16 06:37:01,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 06:37:01,683 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-16 06:37:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:01,684 INFO L225 Difference]: With dead ends: 35 [2024-11-16 06:37:01,684 INFO L226 Difference]: Without dead ends: 32 [2024-11-16 06:37:01,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-16 06:37:01,686 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:01,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 122 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:37:01,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-16 06:37:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-16 06:37:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-16 06:37:01,695 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 27 [2024-11-16 06:37:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:01,695 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-16 06:37:01,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-16 06:37:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 06:37:01,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:01,696 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:01,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 06:37:01,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:01,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1317756413, now seen corresponding path program 1 times [2024-11-16 06:37:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130026478] [2024-11-16 06:37:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:37:02,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:02,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130026478] [2024-11-16 06:37:02,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130026478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:37:02,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058167783] [2024-11-16 06:37:02,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:02,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:37:02,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:37:02,882 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-16 06:37:02,884 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-16 06:37:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:03,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-16 06:37:03,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:37:03,070 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-16 06:37:03,156 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-16 06:37:03,157 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-16 06:37:03,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-16 06:37:03,274 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-16 06:37:03,496 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-16 06:37:03,497 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-16 06:37:03,570 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 20 treesize of output 15 [2024-11-16 06:37:03,615 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 20 treesize of output 15 [2024-11-16 06:37:03,624 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 17 treesize of output 13 [2024-11-16 06:37:03,633 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 17 treesize of output 13 [2024-11-16 06:37:03,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:37:03,693 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 17 [2024-11-16 06:37:03,700 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:37:03,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:37:03,701 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 51 treesize of output 15 [2024-11-16 06:37:03,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:37:03,712 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 17 [2024-11-16 06:37:03,775 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 0 case distinctions, treesize of input 60 treesize of output 33 [2024-11-16 06:37:03,784 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 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-16 06:37:03,844 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 68 treesize of output 48 [2024-11-16 06:37:03,848 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 52 treesize of output 36 [2024-11-16 06:37:03,911 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 33 treesize of output 15 [2024-11-16 06:37:03,916 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 9 treesize of output 3 [2024-11-16 06:37:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:37:03,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:37:04,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (or (not (= v_ArrVal_479 (let ((.cse1 (+ (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_479 .cse1))))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| .cse0 v_ArrVal_479) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_480) .cse3) .cse4)) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_481) .cse3) .cse4)))))))) is different from false [2024-11-16 06:37:04,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:04,188 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 119 treesize of output 120 [2024-11-16 06:37:04,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:04,206 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 238 treesize of output 237 [2024-11-16 06:37:04,218 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 104 treesize of output 88 [2024-11-16 06:37:04,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:04,229 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 178 treesize of output 164 [2024-11-16 06:37:04,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:04,250 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 300 treesize of output 269 [2024-11-16 06:37:04,262 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 53 treesize of output 37 [2024-11-16 06:37:04,707 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse23 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse11 (select .cse23 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse10 (select .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse13 (= .cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse15 (+ .cse11 8))) (let ((.cse7 (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (or (not (= v_ArrVal_479 (store (select |c_#memory_int#2| .cse10) .cse15 (select v_ArrVal_479 .cse15)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_475) .cse10 v_ArrVal_479) v_arrayElimCell_20) v_arrayElimCell_23))))) (.cse16 (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (let ((.cse29 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_475))) (or (not (= v_ArrVal_479 (store (select .cse29 .cse10) .cse15 (select v_ArrVal_479 .cse15)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse29 .cse10 v_ArrVal_479) v_arrayElimCell_20) v_arrayElimCell_23)))))) (.cse8 (not .cse13)) (.cse22 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (forall ((v_ArrVal_479 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_475))) (or (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse27 .cse10 v_ArrVal_479) v_arrayElimCell_20) v_arrayElimCell_23))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_479 v_arrayElimCell_21)) (not (= v_ArrVal_479 (store (select .cse27 .cse10) .cse15 (select v_ArrVal_479 .cse15)))))))) (.cse2 (or .cse13 (forall ((v_ArrVal_479 (Array Int Int)) (v_arrayElimCell_18 Int) (v_arrayElimCell_21 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_475))) (or (not (= v_ArrVal_479 (store (select .cse26 .cse10) .cse15 (select v_ArrVal_479 .cse15)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse26 .cse10 v_ArrVal_479) v_arrayElimCell_18) v_arrayElimCell_21))))))) (.cse5 (forall ((v_ArrVal_479 (Array Int Int)) (v_arrayElimCell_18 Int) (v_arrayElimCell_21 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_475))) (let ((.cse24 (store .cse25 .cse10 v_ArrVal_479))) (or (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse24 v_arrayElimCell_20) v_arrayElimCell_23))) (not (= v_ArrVal_479 (store (select .cse25 .cse10) .cse15 (select v_ArrVal_479 .cse15)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse24 v_arrayElimCell_18) v_arrayElimCell_21))))))) (.cse4 (forall ((v_arrayElimCell_21 Int) (v_ArrVal_475 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_475) .cse10) .cse15 v_DerPreprocessor_1) v_arrayElimCell_21)))) (.cse3 (= .cse10 .cse22)) (.cse0 (forall ((|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11| Int)) (= |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse23 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse9 (or .cse16 .cse8)) (.cse6 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse22)) (.cse17 (forall ((v_ArrVal_479 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_475))) (let ((.cse20 (store .cse21 .cse10 v_ArrVal_479))) (or (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_20) v_arrayElimCell_23))) (not (= v_ArrVal_479 (store (select .cse21 .cse10) .cse15 (select v_ArrVal_479 .cse15)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_18) .cse11))))))) (.cse18 (or .cse13 (forall ((v_ArrVal_479 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_475))) (or (not (= v_ArrVal_479 (store (select .cse19 .cse10) .cse15 (select v_ArrVal_479 .cse15)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse19 .cse10 v_ArrVal_479) v_arrayElimCell_18) .cse11))))))) (.cse12 (or .cse7 .cse8))) (and (or .cse0 (and .cse1 .cse2 (or .cse3 .cse4) .cse5 (or .cse6 .cse7 .cse8) .cse9)) (or .cse3 (forall ((v_ArrVal_475 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_475) .cse10) .cse11)))) (or .cse6 (and .cse1 .cse2 (or .cse7 .cse8 (forall ((|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11|))) .cse12 .cse5 (or .cse13 .cse4))) (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_475))) (or (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 .cse10 v_ArrVal_479) v_arrayElimCell_20) v_arrayElimCell_23))) (not (= v_ArrVal_479 (store (select .cse14 .cse10) .cse15 (select v_ArrVal_479 .cse15)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_479 .cse11))))) (or (not .cse3) .cse16) (or .cse0 (and .cse17 .cse18 .cse9)) (or .cse6 (and .cse17 .cse18 .cse12)))))))) is different from false [2024-11-16 06:37:05,058 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse29 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse27 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse14 (select .cse27 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse12 (select .cse29 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse18 (= .cse12 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse13 (+ .cse14 8))) (let ((.cse2 (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (or (not (= v_ArrVal_479 (store (select |c_#memory_int#2| .cse12) .cse13 (select v_ArrVal_479 .cse13)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_475) .cse12 v_ArrVal_479) v_arrayElimCell_20) v_arrayElimCell_23))))) (.cse19 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse29 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (let ((.cse28 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_475))) (or (not (= v_ArrVal_479 (store (select .cse28 .cse12) .cse13 (select v_ArrVal_479 .cse13)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse28 .cse12 v_ArrVal_479) v_arrayElimCell_20) v_arrayElimCell_23)))))) (.cse3 (not .cse18))) (let ((.cse0 (forall ((|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11| Int)) (= |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse27 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (or .cse10 .cse3)) (.cse5 (forall ((v_ArrVal_479 (Array Int Int)) (v_arrayElimCell_18 Int) (v_arrayElimCell_21 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_475))) (let ((.cse25 (store .cse26 .cse12 v_ArrVal_479))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse25 v_arrayElimCell_18) v_arrayElimCell_21)) (not (= v_ArrVal_479 (store (select .cse26 .cse12) .cse13 (select v_ArrVal_479 .cse13)))) (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse25 v_arrayElimCell_20) v_arrayElimCell_23)))))))) (.cse6 (or .cse18 (forall ((v_ArrVal_479 (Array Int Int)) (v_arrayElimCell_18 Int) (v_arrayElimCell_21 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_475))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse24 .cse12 v_ArrVal_479) v_arrayElimCell_18) v_arrayElimCell_21)) (not (= v_ArrVal_479 (store (select .cse24 .cse12) .cse13 (select v_ArrVal_479 .cse13))))))))) (.cse8 (forall ((v_arrayElimCell_21 Int) (v_ArrVal_475 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_475) .cse12) .cse13 v_DerPreprocessor_1) v_arrayElimCell_21)))) (.cse7 (forall ((v_ArrVal_479 (Array Int Int)) (v_arrayElimCell_21 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_475))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_479 v_arrayElimCell_21)) (not (= v_ArrVal_479 (store (select .cse23 .cse12) .cse13 (select v_ArrVal_479 .cse13)))) (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse23 .cse12 v_ArrVal_479) v_arrayElimCell_20) v_arrayElimCell_23))))))) (.cse4 (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse19)) (.cse17 (or .cse2 .cse3)) (.cse15 (forall ((v_ArrVal_479 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_475))) (let ((.cse21 (store .cse22 .cse12 v_ArrVal_479))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 v_arrayElimCell_18) .cse14)) (not (= v_ArrVal_479 (store (select .cse22 .cse12) .cse13 (select v_ArrVal_479 .cse13)))) (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse21 v_arrayElimCell_20) v_arrayElimCell_23)))))))) (.cse16 (or .cse18 (forall ((v_ArrVal_479 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_475 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_475))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 .cse12 v_ArrVal_479) v_arrayElimCell_18) .cse14)) (not (= v_ArrVal_479 (store (select .cse20 .cse12) .cse13 (select v_ArrVal_479 .cse13))))))))) (.cse9 (= .cse12 .cse19))) (and (or .cse0 (and .cse1 (or .cse2 .cse3 .cse4) .cse5 .cse6 .cse7 (or .cse8 .cse9))) (or (not .cse9) .cse10) (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_475))) (or (not (= v_ArrVal_479 (store (select .cse11 .cse12) .cse13 (select v_ArrVal_479 .cse13)))) (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 .cse12 v_ArrVal_479) v_arrayElimCell_20) v_arrayElimCell_23))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_479 .cse14))))) (or .cse0 (and .cse1 .cse15 .cse16)) (or (and .cse5 .cse6 .cse17 (or .cse18 .cse8) .cse7) .cse4) (or .cse4 (and .cse17 .cse15 .cse16)) (or .cse9 (forall ((v_ArrVal_475 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_475) .cse12) .cse14)))))))))) is different from false [2024-11-16 06:37:05,363 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 149 treesize of output 117 [2024-11-16 06:37:05,373 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 121 treesize of output 93 [2024-11-16 06:37:05,411 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 13 treesize of output 1 [2024-11-16 06:37:09,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:09,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 473 treesize of output 489 [2024-11-16 06:37:09,935 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-16 06:37:09,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 289 treesize of output 293 [2024-11-16 06:37:09,963 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-16 06:37:09,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 267 treesize of output 282 [2024-11-16 06:37:10,003 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 262 treesize of output 260 [2024-11-16 06:37:10,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 260 treesize of output 258 [2024-11-16 06:37:10,026 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 258 treesize of output 254 [2024-11-16 06:37:10,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:12,574 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 12 treesize of output 8 [2024-11-16 06:37:12,689 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 12 treesize of output 8 [2024-11-16 06:37:12,701 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 12 treesize of output 8 [2024-11-16 06:37:12,709 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 428 treesize of output 404 [2024-11-16 06:37:12,819 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 12 treesize of output 8 [2024-11-16 06:37:12,837 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 12 treesize of output 8 [2024-11-16 06:37:12,845 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 12 treesize of output 8 [2024-11-16 06:37:12,864 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 12 treesize of output 8 [2024-11-16 06:37:12,877 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 12 treesize of output 8 [2024-11-16 06:37:12,897 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 12 treesize of output 8 [2024-11-16 06:37:12,903 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 12 treesize of output 8 [2024-11-16 06:37:12,920 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 12 treesize of output 8 [2024-11-16 06:37:12,930 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 12 treesize of output 8 [2024-11-16 06:37:12,965 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 12 treesize of output 8 [2024-11-16 06:37:12,996 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 12 treesize of output 8 [2024-11-16 06:37:13,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:13,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 439 treesize of output 603 [2024-11-16 06:37:32,258 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 12 treesize of output 8 [2024-11-16 06:37:32,263 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 12 treesize of output 8 [2024-11-16 06:37:32,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:32,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 63 [2024-11-16 06:37:32,447 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 12 treesize of output 8 [2024-11-16 06:37:32,515 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 12 treesize of output 8 [2024-11-16 06:37:32,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:32,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 65 [2024-11-16 06:37:32,564 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 12 treesize of output 8 [2024-11-16 06:37:32,599 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 12 treesize of output 8 [2024-11-16 06:37:32,639 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 12 treesize of output 8 [2024-11-16 06:37:32,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:32,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:32,764 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 11 treesize of output 15 [2024-11-16 06:37:32,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:32,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 96 [2024-11-16 06:37:32,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:32,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 93 [2024-11-16 06:37:33,048 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 12 treesize of output 8 [2024-11-16 06:37:33,083 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 12 treesize of output 8 [2024-11-16 06:37:33,123 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 12 treesize of output 8 [2024-11-16 06:37:33,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:33,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:33,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:33,208 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 13 treesize of output 7 [2024-11-16 06:37:33,309 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 12 treesize of output 8 [2024-11-16 06:37:33,328 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 12 treesize of output 8 [2024-11-16 06:37:33,380 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 12 treesize of output 8 [2024-11-16 06:37:33,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:33,392 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 90 treesize of output 76 [2024-11-16 06:37:33,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:33,421 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 13 treesize of output 7 [2024-11-16 06:37:33,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:33,440 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 13 treesize of output 7 [2024-11-16 06:37:33,494 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 12 treesize of output 8 [2024-11-16 06:37:33,519 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 12 treesize of output 8 [2024-11-16 06:37:33,536 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 20 treesize of output 12 [2024-11-16 06:37:33,561 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 12 treesize of output 8 [2024-11-16 06:37:33,568 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 12 treesize of output 8 [2024-11-16 06:37:33,576 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 12 treesize of output 8 [2024-11-16 06:37:33,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:33,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:33,606 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 71 treesize of output 65 [2024-11-16 06:37:33,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:33,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:33,652 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 13 treesize of output 7 [2024-11-16 06:37:33,693 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 306 treesize of output 302 [2024-11-16 06:37:33,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:33,707 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 101 treesize of output 106 [2024-11-16 06:37:33,772 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 962 treesize of output 946 [2024-11-16 06:37:33,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:33,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:33,798 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 587 treesize of output 579 [2024-11-16 06:37:33,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:33,809 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 106 treesize of output 111 [2024-11-16 06:37:33,846 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 474 treesize of output 466 [2024-11-16 06:37:33,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-16 06:37:33,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:33,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-16 06:37:33,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:33,883 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 258 treesize of output 254 [2024-11-16 06:37:33,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:33,892 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 84 treesize of output 89 [2024-11-16 06:37:33,895 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 319 treesize of output 315 [2024-11-16 06:37:33,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:33,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:33,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-16 06:37:33,985 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 7 treesize of output 3 [2024-11-16 06:37:34,013 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 7 treesize of output 3 [2024-11-16 06:37:34,033 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 7 treesize of output 3 [2024-11-16 06:37:34,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:34,066 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 7 treesize of output 3 [2024-11-16 06:37:34,082 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 962 treesize of output 946 [2024-11-16 06:37:34,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-16 06:37:34,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:34,104 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 1027 treesize of output 1011 [2024-11-16 06:37:34,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:34,114 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 106 treesize of output 111 [2024-11-16 06:37:34,174 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 7 treesize of output 3 [2024-11-16 06:37:34,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:34,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-16 06:37:34,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-16 06:37:34,213 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 7 treesize of output 3 [2024-11-16 06:37:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:37:36,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058167783] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:37:36,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:37:36,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 47 [2024-11-16 06:37:36,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580836243] [2024-11-16 06:37:36,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:37:36,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-16 06:37:36,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:36,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-16 06:37:36,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1751, Unknown=5, NotChecked=258, Total=2162 [2024-11-16 06:37:36,978 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 47 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:39,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:39,019 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-11-16 06:37:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 06:37:39,019 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-16 06:37:39,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:39,021 INFO L225 Difference]: With dead ends: 44 [2024-11-16 06:37:39,021 INFO L226 Difference]: Without dead ends: 41 [2024-11-16 06:37:39,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=322, Invalid=3219, Unknown=11, NotChecked=354, Total=3906 [2024-11-16 06:37:39,023 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 7 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:39,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 341 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 807 Invalid, 34 Unknown, 125 Unchecked, 1.1s Time] [2024-11-16 06:37:39,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-16 06:37:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2024-11-16 06:37:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-16 06:37:39,027 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 30 [2024-11-16 06:37:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:39,027 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-16 06:37:39,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-16 06:37:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 06:37:39,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:39,028 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:39,043 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-16 06:37:39,232 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-16 06:37:39,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:39,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:39,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1317692026, now seen corresponding path program 1 times [2024-11-16 06:37:39,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:39,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992845435] [2024-11-16 06:37:39,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:39,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:37:39,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:39,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992845435] [2024-11-16 06:37:39,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992845435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:37:39,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:37:39,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 06:37:39,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964945317] [2024-11-16 06:37:39,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:37:39,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 06:37:39,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:39,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 06:37:39,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-16 06:37:39,855 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:40,032 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-11-16 06:37:40,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 06:37:40,034 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-16 06:37:40,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:40,034 INFO L225 Difference]: With dead ends: 52 [2024-11-16 06:37:40,034 INFO L226 Difference]: Without dead ends: 48 [2024-11-16 06:37:40,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-16 06:37:40,035 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:40,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 169 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:37:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-16 06:37:40,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2024-11-16 06:37:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-16 06:37:40,042 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 30 [2024-11-16 06:37:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:40,042 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-16 06:37:40,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-16 06:37:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 06:37:40,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:40,043 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:40,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 06:37:40,043 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:40,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash -489762437, now seen corresponding path program 1 times [2024-11-16 06:37:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:40,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342223706] [2024-11-16 06:37:40,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:40,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:37:40,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:40,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342223706] [2024-11-16 06:37:40,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342223706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:37:40,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:37:40,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 06:37:40,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717361511] [2024-11-16 06:37:40,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:37:40,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 06:37:40,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:40,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 06:37:40,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:37:40,188 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:40,247 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2024-11-16 06:37:40,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 06:37:40,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-16 06:37:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:40,249 INFO L225 Difference]: With dead ends: 65 [2024-11-16 06:37:40,249 INFO L226 Difference]: Without dead ends: 35 [2024-11-16 06:37:40,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 06:37:40,250 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:40,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 104 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:37:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-16 06:37:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-16 06:37:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-11-16 06:37:40,255 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2024-11-16 06:37:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:40,255 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-11-16 06:37:40,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:37:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-11-16 06:37:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-16 06:37:40,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:40,256 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:40,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 06:37:40,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:40,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1359424026, now seen corresponding path program 1 times [2024-11-16 06:37:40,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:40,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283755858] [2024-11-16 06:37:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:40,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:37:41,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:41,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283755858] [2024-11-16 06:37:41,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283755858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:37:41,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136086857] [2024-11-16 06:37:41,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:41,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:37:41,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:37:41,840 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-16 06:37:41,844 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-16 06:37:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:41,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-16 06:37:41,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:37:42,003 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-16 06:37:42,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-16 06:37:42,134 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-16 06:37:42,135 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-16 06:37:42,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-16 06:37:42,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-16 06:37:42,203 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-16 06:37:42,257 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 91 treesize of output 57 [2024-11-16 06:37:42,264 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 39 treesize of output 15 [2024-11-16 06:37:42,270 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 24 treesize of output 11 [2024-11-16 06:37:42,487 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-16 06:37:42,488 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-16 06:37:42,572 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-16 06:37:42,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 54 [2024-11-16 06:37:42,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-16 06:37:42,588 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 20 treesize of output 15 [2024-11-16 06:37:42,656 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-16 06:37:42,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 61 [2024-11-16 06:37:42,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-16 06:37:42,671 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 29 treesize of output 28 [2024-11-16 06:37:42,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:37:42,745 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:37:42,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:37:42,746 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:37:42,754 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-16 06:37:42,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 81 [2024-11-16 06:37:42,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:37:42,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2024-11-16 06:37:42,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:37:42,777 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:37:42,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:37:42,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2024-11-16 06:37:42,880 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 0 case distinctions, treesize of input 174 treesize of output 110 [2024-11-16 06:37:42,884 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 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-16 06:37:42,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-16 06:37:42,999 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-16 06:37:43,205 INFO L349 Elim1Store]: treesize reduction 73, result has 9.9 percent of original size [2024-11-16 06:37:43,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 119 treesize of output 61 [2024-11-16 06:37:43,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2024-11-16 06:37:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:37:43,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:37:43,494 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse9 (+ (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8))) (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| .cse0 (store (select |c_#memory_$Pointer$#2.offset| .cse0) .cse9 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))) (.cse1 (store |c_#memory_$Pointer$#2.base| .cse0 (store (select |c_#memory_$Pointer$#2.base| .cse0) .cse9 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))) (.cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (+ (select (select .cse4 .cse5) .cse6) 4))) (select (select (store |c_#memory_int#2| .cse0 v_ArrVal_810) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))))) is different from false [2024-11-16 06:38:25,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:25,370 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 425 treesize of output 384 [2024-11-16 06:38:25,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:25,383 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 371 treesize of output 330 [2024-11-16 06:38:25,410 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_810 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_806 (Array Int Int)) (|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_15| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse12 (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse13 (+ |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_15| 4)) (.cse0 (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse10 (+ .cse12 8))) (let ((.cse4 (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_6))) (store .cse11 .cse0 (store (select .cse11 .cse0) .cse10 |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_15|)))) (.cse1 (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_5))) (store .cse9 .cse0 (store (select .cse9 .cse0) .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base|)))) (.cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_15|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (+ (select (select .cse4 .cse5) .cse6) 4))) (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_806) .cse0 v_ArrVal_810) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))) (not (= (select v_arrayElimArr_6 .cse13) .cse12)) (not (= (select v_arrayElimArr_5 .cse13) .cse0)))))) is different from false [2024-11-16 06:38:25,445 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 242 treesize of output 182 [2024-11-16 06:38:25,449 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 242 treesize of output 210