./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:49:43,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:49:43,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:49:43,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:49:43,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:49:43,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:49:43,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:49:43,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:49:43,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:49:43,360 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:49:43,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:49:43,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:49:43,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:49:43,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:49:43,375 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:49:43,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:49:43,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:49:43,376 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:49:43,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:49:43,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:49:43,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:49:43,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:49:43,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:49:43,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:49:43,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:49:43,378 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:49:43,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:49:43,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:49:43,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:49:43,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:49:43,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:49:43,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:49:43,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:49:43,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:49:43,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:49:43,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:49:43,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:49:43,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:49:43,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:49:43,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:49:43,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:49:43,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:49:43,384 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 -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2024-11-19 20:49:43,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:49:43,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:49:43,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:49:43,632 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:49:43,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:49:43,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-19 20:49:45,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:49:45,299 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:49:45,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-19 20:49:45,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8335e7eb1/b72eaa4e265245d79608929bdfb47599/FLAG9651f76ae [2024-11-19 20:49:45,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8335e7eb1/b72eaa4e265245d79608929bdfb47599 [2024-11-19 20:49:45,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:49:45,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:49:45,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:49:45,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:49:45,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:49:45,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c8af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45, skipping insertion in model container [2024-11-19 20:49:45,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:49:45,744 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_insert_unequal.i[24989,25002] [2024-11-19 20:49:45,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:49:45,757 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:49:45,815 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_insert_unequal.i[24989,25002] [2024-11-19 20:49:45,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:49:45,843 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:49:45,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45 WrapperNode [2024-11-19 20:49:45,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:49:45,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:49:45,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:49:45,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:49:45,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,891 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 168 [2024-11-19 20:49:45,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:49:45,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:49:45,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:49:45,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:49:45,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,927 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 21, 8]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2024-11-19 20:49:45,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:49:45,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:49:45,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:49:45,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:49:45,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45" (1/1) ... [2024-11-19 20:49:45,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:49:45,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:49:46,013 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-19 20:49:46,017 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-19 20:49:46,068 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-19 20:49:46,068 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-19 20:49:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 20:49:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 20:49:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 20:49:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 20:49:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 20:49:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 20:49:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:49:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:49:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:49:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:49:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:49:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 20:49:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:49:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:49:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 20:49:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:49:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 20:49:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 20:49:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 20:49:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:49:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:49:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 20:49:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:49:46,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:49:46,241 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:49:46,243 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:49:46,271 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-19 20:49:46,531 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-19 20:49:46,535 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:49:46,546 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:49:46,546 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 20:49:46,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:49:46 BoogieIcfgContainer [2024-11-19 20:49:46,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:49:46,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:49:46,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:49:46,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:49:46,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:49:45" (1/3) ... [2024-11-19 20:49:46,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edf8241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:49:46, skipping insertion in model container [2024-11-19 20:49:46,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:45" (2/3) ... [2024-11-19 20:49:46,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7edf8241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:49:46, skipping insertion in model container [2024-11-19 20:49:46,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:49:46" (3/3) ... [2024-11-19 20:49:46,557 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2024-11-19 20:49:46,576 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:49:46,576 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:49:46,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:49:46,633 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;@53e83cba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:49:46,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:49:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 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-19 20:49:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 20:49:46,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:46,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:46,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:46,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:46,648 INFO L85 PathProgramCache]: Analyzing trace with hash -504255867, now seen corresponding path program 1 times [2024-11-19 20:49:46,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:46,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109810923] [2024-11-19 20:49:46,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:46,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:46,880 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-19 20:49:46,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:46,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109810923] [2024-11-19 20:49:46,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109810923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:49:46,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:49:46,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 20:49:46,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490640416] [2024-11-19 20:49:46,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:49:46,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 20:49:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:46,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 20:49:46,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 20:49:46,910 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 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.5) internal successors, (15), 2 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-19 20:49:46,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:46,923 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2024-11-19 20:49:46,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 20:49:46,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-19 20:49:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:46,945 INFO L225 Difference]: With dead ends: 64 [2024-11-19 20:49:46,946 INFO L226 Difference]: Without dead ends: 27 [2024-11-19 20:49:46,948 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-19 20:49:46,951 INFO L432 NwaCegarLoop]: 49 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, 49 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-19 20:49:46,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-19 20:49:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-19 20:49:46,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 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-19 20:49:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2024-11-19 20:49:46,986 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 15 [2024-11-19 20:49:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:46,987 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2024-11-19 20:49:46,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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-19 20:49:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-11-19 20:49:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 20:49:46,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:46,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:46,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:49:46,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:46,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash 775433970, now seen corresponding path program 1 times [2024-11-19 20:49:46,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83327502] [2024-11-19 20:49:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:47,234 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-19 20:49:47,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:47,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83327502] [2024-11-19 20:49:47,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83327502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:49:47,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:49:47,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:49:47,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661856732] [2024-11-19 20:49:47,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:49:47,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:49:47,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:47,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:49:47,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:49:47,238 INFO L87 Difference]: Start difference. First operand 27 states and 37 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-19 20:49:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:47,258 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-19 20:49:47,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:49:47,259 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-19 20:49:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:47,260 INFO L225 Difference]: With dead ends: 52 [2024-11-19 20:49:47,260 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 20:49:47,261 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-19 20:49:47,262 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 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-19 20:49:47,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:47,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 20:49:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-19 20:49:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-19 20:49:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-11-19 20:49:47,273 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2024-11-19 20:49:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:47,273 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-11-19 20:49:47,273 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-19 20:49:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-11-19 20:49:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 20:49:47,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:47,275 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:47,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 20:49:47,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:47,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1038406110, now seen corresponding path program 1 times [2024-11-19 20:49:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446856797] [2024-11-19 20:49:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:49:47,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:47,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446856797] [2024-11-19 20:49:47,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446856797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:49:47,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:49:47,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:49:47,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061523248] [2024-11-19 20:49:47,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:49:47,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:49:47,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:47,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:49:47,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:49:47,407 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-19 20:49:47,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:47,433 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-11-19 20:49:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:49:47,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-19 20:49:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:47,437 INFO L225 Difference]: With dead ends: 56 [2024-11-19 20:49:47,438 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 20:49:47,438 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-19 20:49:47,439 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 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-19 20:49:47,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 20:49:47,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 20:49:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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-19 20:49:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-11-19 20:49:47,448 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2024-11-19 20:49:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:47,449 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-19 20:49:47,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-19 20:49:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-19 20:49:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 20:49:47,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:47,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:47,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 20:49:47,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:47,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1976697508, now seen corresponding path program 1 times [2024-11-19 20:49:47,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:47,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292806072] [2024-11-19 20:49:47,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:47,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:49:47,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:47,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292806072] [2024-11-19 20:49:47,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292806072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:49:47,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117318707] [2024-11-19 20:49:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:47,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:47,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:49:47,606 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-19 20:49:47,608 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-19 20:49:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:47,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 20:49:47,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:49:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:49:47,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:49:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:49:47,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117318707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:49:47,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:49:47,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-19 20:49:47,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818436803] [2024-11-19 20:49:47,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:49:47,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:49:47,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:47,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:49:47,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:49:47,859 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-19 20:49:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:47,887 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-11-19 20:49:47,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:49:47,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 20 [2024-11-19 20:49:47,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:47,889 INFO L225 Difference]: With dead ends: 53 [2024-11-19 20:49:47,889 INFO L226 Difference]: Without dead ends: 33 [2024-11-19 20:49:47,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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-19 20:49:47,891 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:47,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-19 20:49:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-19 20:49:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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-19 20:49:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-19 20:49:47,900 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2024-11-19 20:49:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:47,900 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-19 20:49:47,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-19 20:49:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-19 20:49:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 20:49:47,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:47,903 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:47,911 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-19 20:49:48,103 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-19 20:49:48,104 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:48,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1871980112, now seen corresponding path program 1 times [2024-11-19 20:49:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:48,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388162280] [2024-11-19 20:49:48,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:48,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:49:48,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:48,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388162280] [2024-11-19 20:49:48,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388162280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:49:48,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:49:48,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:49:48,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195550595] [2024-11-19 20:49:48,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:49:48,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:49:48,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:48,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:49:48,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:49:48,277 INFO L87 Difference]: Start difference. First operand 33 states and 43 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-19 20:49:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:48,296 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2024-11-19 20:49:48,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:49:48,297 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 25 [2024-11-19 20:49:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:48,298 INFO L225 Difference]: With dead ends: 46 [2024-11-19 20:49:48,298 INFO L226 Difference]: Without dead ends: 35 [2024-11-19 20:49:48,298 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-19 20:49:48,301 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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-19 20:49:48,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-19 20:49:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-19 20:49:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 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-19 20:49:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-19 20:49:48,307 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 25 [2024-11-19 20:49:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:48,307 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-19 20:49:48,307 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-19 20:49:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-19 20:49:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 20:49:48,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:48,308 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:48,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 20:49:48,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:48,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:48,309 INFO L85 PathProgramCache]: Analyzing trace with hash 835167343, now seen corresponding path program 1 times [2024-11-19 20:49:48,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:48,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114022350] [2024-11-19 20:49:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:49:48,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:48,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114022350] [2024-11-19 20:49:48,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114022350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:49:48,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:49:48,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:49:48,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208609746] [2024-11-19 20:49:48,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:49:48,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:49:48,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:48,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:49:48,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:49:48,485 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-19 20:49:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:48,513 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-11-19 20:49:48,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:49:48,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 26 [2024-11-19 20:49:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:48,515 INFO L225 Difference]: With dead ends: 49 [2024-11-19 20:49:48,516 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 20:49:48,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:49:48,517 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 65 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-19 20:49:48,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 20:49:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-19 20:49:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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-19 20:49:48,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-19 20:49:48,526 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 26 [2024-11-19 20:49:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:48,526 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-19 20:49:48,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-19 20:49:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-19 20:49:48,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 20:49:48,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:48,527 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:48,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 20:49:48,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:48,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:48,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339204, now seen corresponding path program 1 times [2024-11-19 20:49:48,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:48,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956424883] [2024-11-19 20:49:48,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:48,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:49:50,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:50,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956424883] [2024-11-19 20:49:50,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956424883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:49:50,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305067251] [2024-11-19 20:49:50,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:50,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:50,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:49:50,324 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-19 20:49:50,325 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-19 20:49:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:50,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-19 20:49:50,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:49:50,860 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-19 20:49:51,009 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:49:51,010 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-19 20:49:51,115 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 14 treesize of output 15 [2024-11-19 20:49:51,129 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-19 20:49:51,206 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-19 20:49:51,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 20:49:51,519 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-19 20:49:51,519 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-19 20:49:51,675 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 31 treesize of output 20 [2024-11-19 20:49:51,708 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-19 20:49:51,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2024-11-19 20:49:52,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-19 20:49:52,010 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-19 20:49:52,063 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 27 treesize of output 15 [2024-11-19 20:49:52,112 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-19 20:49:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:49:52,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:49:52,559 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_594 Int) (v_ArrVal_591 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~last~0#1.base_15| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| .cse1 (store (select |c_#memory_int#1| .cse1) .cse2 v_ArrVal_588)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_591))) (store .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15| (store (select .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15|) (+ (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse2) 8) v_ArrVal_594)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-19 20:49:52,577 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_594 Int) (v_ArrVal_591 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~last~0#1.base_15| Int) (v_ArrVal_585 (Array Int Int))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| .cse1 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_584) .cse1) .cse2 v_ArrVal_588)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_591))) (store .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15| (store (select .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15|) (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_585) .cse1) .cse2)) v_ArrVal_594)))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2024-11-19 20:49:52,607 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 107 treesize of output 79 [2024-11-19 20:49:52,611 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 83 treesize of output 63 [2024-11-19 20:49:52,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_594 Int) (v_ArrVal_591 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int) (v_ArrVal_584 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~last~0#1.base_15| Int) (v_ArrVal_585 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_#res#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_584) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1 v_ArrVal_588)) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_591))) (store .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15| (store (select .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15|) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_585) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse1) 8) v_ArrVal_594)))) |c_ULTIMATE.start_dll_create_#res#1.base|) |c_ULTIMATE.start_dll_create_#res#1.offset|)))) is different from false [2024-11-19 20:49:52,735 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_594 Int) (v_ArrVal_591 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int) (v_ArrVal_584 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~last~0#1.base_15| Int) (v_ArrVal_585 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_584) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_588)) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_591))) (store .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15| (store (select .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15|) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_585) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 8) v_ArrVal_594)))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) is different from false [2024-11-19 20:49:52,757 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_594 Int) (v_ArrVal_591 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_11| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~last~0#1.base_15| Int) (v_ArrVal_585 (Array Int Int))) (or (= (select (select (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_581))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select (store .cse2 |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_584) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_588))) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_591))) (store .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15| (store (select .cse0 |v_ULTIMATE.start_dll_insert_~last~0#1.base_15|) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_582) |v_ULTIMATE.start_node_create_~temp~0#1.base_11| v_ArrVal_585) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 8) v_ArrVal_594)))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_11|) 0)))) is different from false [2024-11-19 20:49:52,804 INFO L349 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2024-11-19 20:49:52,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5302 treesize of output 4460 [2024-11-19 20:49:52,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:49:52,872 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 1368 treesize of output 1352 [2024-11-19 20:49:52,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:49:52,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 774 treesize of output 614 [2024-11-19 20:49:52,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1526 treesize of output 1442 [2024-11-19 20:49:52,986 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 600 treesize of output 588 [2024-11-19 20:49:53,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 588 treesize of output 564 [2024-11-19 20:49:53,023 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 351 treesize of output 343 [2024-11-19 20:49:53,040 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 600 treesize of output 552 [2024-11-19 20:49:53,058 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 648 treesize of output 624 [2024-11-19 20:49:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-19 20:49:54,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305067251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:49:54,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:49:54,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2024-11-19 20:49:54,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077126257] [2024-11-19 20:49:54,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:49:54,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-19 20:49:54,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:54,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-19 20:49:54,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1461, Unknown=37, NotChecked=410, Total=2070 [2024-11-19 20:49:54,076 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 46 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 46 states have internal predecessors, (70), 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-19 20:49:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:55,185 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2024-11-19 20:49:55,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 20:49:55,186 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 46 states have internal predecessors, (70), 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 26 [2024-11-19 20:49:55,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:55,187 INFO L225 Difference]: With dead ends: 60 [2024-11-19 20:49:55,187 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 20:49:55,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=269, Invalid=2164, Unknown=37, NotChecked=500, Total=2970 [2024-11-19 20:49:55,189 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 68 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:55,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 255 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 736 Invalid, 0 Unknown, 339 Unchecked, 0.6s Time] [2024-11-19 20:49:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 20:49:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2024-11-19 20:49:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 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-19 20:49:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-11-19 20:49:55,197 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 26 [2024-11-19 20:49:55,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:55,198 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-11-19 20:49:55,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 46 states have internal predecessors, (70), 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-19 20:49:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-11-19 20:49:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 20:49:55,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:55,199 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:55,210 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-19 20:49:55,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-19 20:49:55,404 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:55,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:55,405 INFO L85 PathProgramCache]: Analyzing trace with hash 201100899, now seen corresponding path program 1 times [2024-11-19 20:49:55,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:55,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8403180] [2024-11-19 20:49:55,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:55,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:49:55,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:55,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8403180] [2024-11-19 20:49:55,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8403180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:49:55,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555764983] [2024-11-19 20:49:55,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:55,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:55,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:49:55,596 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-19 20:49:55,598 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-19 20:49:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:55,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 20:49:55,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:49:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:49:55,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:49:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:49:55,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555764983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:49:55,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:49:55,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-19 20:49:55,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399980851] [2024-11-19 20:49:55,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:49:55,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 20:49:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:55,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 20:49:55,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:49:55,839 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-19 20:49:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:55,938 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-11-19 20:49:55,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 20:49:55,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-19 20:49:55,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:55,939 INFO L225 Difference]: With dead ends: 53 [2024-11-19 20:49:55,940 INFO L226 Difference]: Without dead ends: 42 [2024-11-19 20:49:55,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-19 20:49:55,940 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:55,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 145 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-19 20:49:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-19 20:49:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 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-19 20:49:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-11-19 20:49:55,948 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 27 [2024-11-19 20:49:55,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:55,948 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-11-19 20:49:55,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-19 20:49:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-11-19 20:49:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 20:49:55,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:55,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:55,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 20:49:56,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:56,151 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:56,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:56,151 INFO L85 PathProgramCache]: Analyzing trace with hash 258359201, now seen corresponding path program 1 times [2024-11-19 20:49:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:56,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033899160] [2024-11-19 20:49:56,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:56,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:49:56,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:56,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033899160] [2024-11-19 20:49:56,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033899160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:49:56,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033775080] [2024-11-19 20:49:56,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:56,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:56,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:49:56,344 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:49:56,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 20:49:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:56,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 20:49:56,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:49:56,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 20:49:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:49:56,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:49:56,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:49:56,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033775080] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:49:56,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:49:56,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2024-11-19 20:49:56,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831744367] [2024-11-19 20:49:56,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:49:56,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 20:49:56,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:56,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 20:49:56,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 20:49:56,587 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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-19 20:49:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:56,703 INFO L93 Difference]: Finished difference Result 74 states and 102 transitions. [2024-11-19 20:49:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 20:49:56,704 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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) Word has length 27 [2024-11-19 20:49:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:56,704 INFO L225 Difference]: With dead ends: 74 [2024-11-19 20:49:56,704 INFO L226 Difference]: Without dead ends: 41 [2024-11-19 20:49:56,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-19 20:49:56,705 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:56,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 208 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:49:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-19 20:49:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-19 20:49:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 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-19 20:49:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-19 20:49:56,710 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 27 [2024-11-19 20:49:56,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:56,713 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-19 20:49:56,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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-19 20:49:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-19 20:49:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 20:49:56,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:56,715 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:56,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 20:49:56,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:56,915 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:56,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:56,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1464037342, now seen corresponding path program 1 times [2024-11-19 20:49:56,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:56,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654983672] [2024-11-19 20:49:56,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:56,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:49:57,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:57,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654983672] [2024-11-19 20:49:57,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654983672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:49:57,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:49:57,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 20:49:57,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91158245] [2024-11-19 20:49:57,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:49:57,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 20:49:57,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:57,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 20:49:57,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 20:49:57,210 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-19 20:49:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:57,351 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-19 20:49:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 20:49:57,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-19 20:49:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:57,353 INFO L225 Difference]: With dead ends: 53 [2024-11-19 20:49:57,353 INFO L226 Difference]: Without dead ends: 46 [2024-11-19 20:49:57,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 20:49:57,353 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:57,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 123 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:49:57,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-19 20:49:57,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-11-19 20:49:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 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-19 20:49:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-11-19 20:49:57,364 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 27 [2024-11-19 20:49:57,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:57,364 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-19 20:49:57,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-19 20:49:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-11-19 20:49:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 20:49:57,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:57,365 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:57,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 20:49:57,365 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:57,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:57,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2045561648, now seen corresponding path program 2 times [2024-11-19 20:49:57,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:57,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842938000] [2024-11-19 20:49:57,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:57,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:49:57,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:57,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842938000] [2024-11-19 20:49:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842938000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:49:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360404818] [2024-11-19 20:49:57,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:49:57,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:57,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:49:57,540 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:49:57,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 20:49:57,798 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:49:57,798 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:49:57,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 20:49:57,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:49:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:49:57,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:49:57,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360404818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:49:57,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 20:49:57,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-19 20:49:57,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139205063] [2024-11-19 20:49:57,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:49:57,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:49:57,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:57,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:49:57,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:49:57,826 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-19 20:49:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:57,847 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-11-19 20:49:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:49:57,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-19 20:49:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:57,849 INFO L225 Difference]: With dead ends: 53 [2024-11-19 20:49:57,849 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 20:49:57,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 20:49:57,850 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:57,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 59 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 20:49:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-19 20:49:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 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-19 20:49:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-19 20:49:57,856 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 27 [2024-11-19 20:49:57,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:57,856 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-19 20:49:57,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-19 20:49:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-19 20:49:57,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 20:49:57,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:57,857 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:57,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 20:49:58,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 20:49:58,058 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:58,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1857767657, now seen corresponding path program 1 times [2024-11-19 20:49:58,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:58,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046376745] [2024-11-19 20:49:58,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:58,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:49:58,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:58,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046376745] [2024-11-19 20:49:58,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046376745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:49:58,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672134736] [2024-11-19 20:49:58,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:58,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:58,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:49:58,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:49:58,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 20:49:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:58,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 20:49:58,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:49:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:49:58,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:49:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 20:49:58,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672134736] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:49:58,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:49:58,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-19 20:49:58,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288592181] [2024-11-19 20:49:58,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:49:58,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 20:49:58,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:58,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 20:49:58,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-19 20:49:58,573 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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-19 20:49:58,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:58,649 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-11-19 20:49:58,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 20:49:58,650 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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 28 [2024-11-19 20:49:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:58,651 INFO L225 Difference]: With dead ends: 44 [2024-11-19 20:49:58,651 INFO L226 Difference]: Without dead ends: 35 [2024-11-19 20:49:58,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-19 20:49:58,652 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:58,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 129 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:58,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-19 20:49:58,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-19 20:49:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 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-19 20:49:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-19 20:49:58,660 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2024-11-19 20:49:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:58,661 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-19 20:49:58,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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-19 20:49:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-19 20:49:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 20:49:58,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:58,662 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:58,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 20:49:58,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:58,863 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:58,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:58,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1756277405, now seen corresponding path program 1 times [2024-11-19 20:49:58,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:58,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289579408] [2024-11-19 20:49:58,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:58,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:50:00,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:00,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289579408] [2024-11-19 20:50:00,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289579408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:00,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596887517] [2024-11-19 20:50:00,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:00,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:00,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:00,566 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:50:00,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 20:50:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:00,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-11-19 20:50:00,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:50:00,945 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-19 20:50:01,017 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:50:01,017 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-19 20:50:01,069 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-19 20:50:01,113 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 20:50:01,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 20:50:01,291 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-19 20:50:01,292 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-19 20:50:01,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:50:01,387 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 37 treesize of output 26 [2024-11-19 20:50:01,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:50:01,640 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 40 treesize of output 22 [2024-11-19 20:50:01,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-19 20:50:01,656 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 64 treesize of output 35 [2024-11-19 20:50:01,667 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-19 20:50:01,667 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 1 case distinctions, treesize of input 105 treesize of output 68 [2024-11-19 20:50:01,672 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 36 treesize of output 15 [2024-11-19 20:50:01,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 49 treesize of output 19 [2024-11-19 20:50:01,735 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 52 treesize of output 35 [2024-11-19 20:50:01,742 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-19 20:50:01,749 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-19 20:50:01,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-19 20:50:01,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 20:50:01,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:50:01,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 20:50:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:50:01,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:50:02,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:50:02,098 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 91 treesize of output 92 [2024-11-19 20:50:02,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:50:02,112 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 346 treesize of output 345 [2024-11-19 20:50:02,119 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 322 treesize of output 306 [2024-11-19 20:50:02,134 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 156 treesize of output 148 [2024-11-19 20:50:02,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse7))) (let ((.cse11 (not .cse17)) (.cse4 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse8 (+ .cse20 4)) (.cse0 (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse7))) (let ((.cse12 (not .cse0)) (.cse9 (or .cse17 (and (or .cse0 (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_arrayElimCell_49 Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) .cse7) .cse8)) v_arrayElimCell_49)))) (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_arrayElimCell_49 Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_49)) (= (select .cse25 v_arrayElimCell_51) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (.cse1 (or .cse11 (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= (select (select (store (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) .cse7) .cse8)) v_arrayElimCell_52) |c_ULTIMATE.start_main_~uneq~0#1|)))) (.cse10 (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_arrayElimCell_49 Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 v_arrayElimCell_49)) (= (select .cse21 v_arrayElimCell_52) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (and (or .cse0 (and .cse1 (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse2 (select (store (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse2 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= (select .cse2 v_arrayElimCell_52) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or (and .cse9 (or (and .cse10 (or .cse11 (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_1461)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) .cse7) .cse8)) v_arrayElimCell_52) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse0)) (= |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| .cse7)) (or .cse12 (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= (select (select (store (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) .cse7) .cse8)) v_arrayElimCell_51) |c_ULTIMATE.start_main_~uneq~0#1|))) (or (and (or .cse0 (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) .cse7) .cse8)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) .cse7) .cse8)))) (or (= (select .cse15 v_arrayElimCell_51) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))))) .cse17) (or (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_4) .cse5 v_ArrVal_1461))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1464) .cse7) .cse8)))) (or (= (select .cse18 v_arrayElimCell_51) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse18 v_arrayElimCell_52) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse12) (or (= .cse20 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) (and .cse9 (or (and .cse1 .cse10) .cse0)))))))) is different from false [2024-11-19 20:50:03,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse28 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse29 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse5)) (.cse20 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse28 .cse29))) (let ((.cse8 (= .cse3 .cse5)) (.cse1 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse28 .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse6 (+ .cse20 4)) (.cse0 (not .cse13))) (let ((.cse17 (or (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_4) .cse2 v_ArrVal_1461))) .cse3 v_ArrVal_1463) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) .cse3 v_ArrVal_1464) .cse5) .cse6)) v_arrayElimCell_52))) .cse0)) (.cse7 (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_arrayElimCell_49 Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_4) .cse2 v_ArrVal_1461))) .cse3 v_ArrVal_1463) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) .cse3 v_ArrVal_1464) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_52)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_49)))))) (.cse9 (or .cse13 (and (or (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_arrayElimCell_49 Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_4) .cse2 v_ArrVal_1461))) .cse3 v_ArrVal_1463) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) .cse3 v_ArrVal_1464) .cse5) .cse6)) v_arrayElimCell_49))) .cse8) (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_arrayElimCell_49 Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_4) .cse2 v_ArrVal_1461))) .cse3 v_ArrVal_1463) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) .cse3 v_ArrVal_1464) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 v_arrayElimCell_51)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 v_arrayElimCell_49)))))))) (.cse16 (not .cse8))) (and (or (and (or (and (or .cse0 (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_4) .cse2 v_ArrVal_1461)) .cse3 v_ArrVal_1463) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) .cse3 v_ArrVal_1464) .cse5) .cse6)) v_arrayElimCell_52)))) .cse7) .cse8) .cse9) (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse5)) (or (and (or (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= (select (select (store (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_4) .cse2 v_ArrVal_1461))) .cse3 v_ArrVal_1463) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) .cse3 v_ArrVal_1464) .cse5) .cse6)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse8) (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_4) .cse2 v_ArrVal_1461))) .cse3 v_ArrVal_1463) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) .cse3 v_ArrVal_1464) .cse5) .cse6)))) (or (= (select .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 v_arrayElimCell_51)))))) .cse13) (or (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_4) .cse2 v_ArrVal_1461))) .cse3 v_ArrVal_1463) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) .cse3 v_ArrVal_1464) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 v_arrayElimCell_52)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 v_arrayElimCell_51))))) .cse16) (or .cse8 (and .cse17 (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_4) .cse2 v_ArrVal_1461))) .cse3 v_ArrVal_1463) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) .cse3 v_ArrVal_1464) .cse5) .cse6)))) (or (= (select .cse18 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 v_arrayElimCell_52))))))) (or (= |c_ULTIMATE.start_dll_insert_~last~0#1.offset| .cse20) (and (or (and .cse17 .cse7) .cse8) .cse9)) (or .cse16 (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_4) .cse2 v_ArrVal_1461))) .cse3 v_ArrVal_1463) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1459) .cse3 v_ArrVal_1464) .cse5) .cse6)) v_arrayElimCell_51))))))))) is different from false [2024-11-19 20:50:03,326 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (select |c_#memory_$Pointer$#1.base| .cse4)) (.cse31 (+ .cse10 4))) (let ((.cse5 (select .cse30 .cse31)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse7))) (let ((.cse16 (not .cse20)) (.cse2 (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4)) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse30 .cse31 |c_ULTIMATE.start_node_create_#res#1.base|))) (.cse8 (+ .cse11 4)) (.cse15 (= .cse5 .cse7))) (let ((.cse12 (or (and (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_arrayElimCell_49 Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse28 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse28 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1461))) .cse5 v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1459) .cse5 v_ArrVal_1464) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 v_arrayElimCell_49)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 v_arrayElimCell_51))))) (or (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_arrayElimCell_49 Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse29 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse29 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse29 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1461))) .cse5 v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1459) .cse5 v_ArrVal_1464) .cse7) .cse8)) v_arrayElimCell_49))) .cse15)) .cse20)) (.cse14 (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_arrayElimCell_49 Int) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse26 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse26 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1461))) .cse5 v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1459) .cse5 v_ArrVal_1464) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_52)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 v_arrayElimCell_49)))))) (.cse13 (or .cse16 (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse24 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse24 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse24 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1461))) .cse5 v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1459) .cse5 v_ArrVal_1464) .cse7) .cse8)) v_arrayElimCell_52))))) (.cse9 (not .cse15))) (and (or (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_arrayElimCell_51 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse1 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse1 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1461))) .cse5 v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1459) .cse5 v_ArrVal_1464) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 v_arrayElimCell_52)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 v_arrayElimCell_51))))) .cse9) (or (= .cse10 .cse11) (and .cse12 (or (and .cse13 .cse14) .cse15))) (or (= .cse7 .cse4) (and .cse12 (or (and .cse14 (or (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse4 v_ArrVal_1460) |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1461)) .cse5 v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1459) .cse5 v_ArrVal_1464) .cse7) .cse8)) v_arrayElimCell_52))) .cse16)) .cse15))) (or (and (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse18 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse18 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1461))) .cse5 v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1459) .cse5 v_ArrVal_1464) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 |c_ULTIMATE.start_node_create_#res#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 v_arrayElimCell_51))))) (or (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse19 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse19 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse19 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1461))) .cse5 v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1459) .cse5 v_ArrVal_1464) .cse7) .cse8)) |c_ULTIMATE.start_node_create_#res#1.offset|))) .cse15)) .cse20) (or (and .cse13 (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_52 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse22 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse22 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1461))) .cse5 v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1459) .cse5 v_ArrVal_1464) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 v_arrayElimCell_52)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 |c_ULTIMATE.start_node_create_#res#1.offset|)))))) .cse15) (or (forall ((v_ArrVal_1459 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1461 Int) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1460 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse23 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse23 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse23 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_4) .cse3 v_ArrVal_1461))) .cse5 v_ArrVal_1463) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1459) .cse5 v_ArrVal_1464) .cse7) .cse8)) v_arrayElimCell_51))) .cse9))))))) is different from false [2024-11-19 20:50:03,610 INFO L349 Elim1Store]: treesize reduction 417, result has 63.1 percent of original size [2024-11-19 20:50:03,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 3728 treesize of output 4195 [2024-11-19 20:50:03,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:50:03,661 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 4073 treesize of output 4139 [2024-11-19 20:50:03,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:50:03,699 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 3930 treesize of output 3923 [2024-11-19 20:50:03,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:50:03,755 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 3710 treesize of output 3703 [2024-11-19 20:50:03,797 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 3916 treesize of output 3906 [2024-11-19 20:50:03,858 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 3736 treesize of output 3728 [2024-11-19 20:50:03,983 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 6 treesize of output 4