./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-4f9af40 [2024-11-06 22:28:17,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:28:17,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 22:28:17,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:28:17,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:28:17,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:28:17,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:28:17,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:28:17,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:28:17,820 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:28:17,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:28:17,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:28:17,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:28:17,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:28:17,821 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:28:17,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:28:17,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:28:17,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:28:17,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:28:17,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:28:17,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:28:17,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:28:17,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:28:17,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:28:17,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:28:17,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:28:17,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:28:17,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:28:17,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:28:17,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:28:17,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:28:17,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:28:17,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:28:17,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:28:17,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:28:17,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:28:17,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:28:17,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:28:17,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:28:17,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:28:17,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:28:17,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:28:17,825 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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-06 22:28:18,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:28:18,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:28:18,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:28:18,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:28:18,112 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:28:18,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-06 22:28:19,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:28:19,694 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:28:19,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-06 22:28:19,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9f521dea/ec0f9eed1e9b4760aab698bbcbe2e286/FLAGd3ae734a7 [2024-11-06 22:28:19,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9f521dea/ec0f9eed1e9b4760aab698bbcbe2e286 [2024-11-06 22:28:19,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:28:19,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:28:19,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:28:19,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:28:19,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:28:19,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:19" (1/1) ... [2024-11-06 22:28:19,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7614da4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:19, skipping insertion in model container [2024-11-06 22:28:19,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:28:19" (1/1) ... [2024-11-06 22:28:19,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:28:20,089 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2024-11-06 22:28:20,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:28:20,102 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:28:20,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2024-11-06 22:28:20,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:28:20,187 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:28:20,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20 WrapperNode [2024-11-06 22:28:20,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:28:20,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:28:20,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:28:20,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:28:20,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20" (1/1) ... [2024-11-06 22:28:20,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20" (1/1) ... [2024-11-06 22:28:20,240 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 168 [2024-11-06 22:28:20,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:28:20,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:28:20,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:28:20,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:28:20,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20" (1/1) ... [2024-11-06 22:28:20,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20" (1/1) ... [2024-11-06 22:28:20,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20" (1/1) ... [2024-11-06 22:28:20,287 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 8, 21]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2024-11-06 22:28:20,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20" (1/1) ... [2024-11-06 22:28:20,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20" (1/1) ... [2024-11-06 22:28:20,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20" (1/1) ... [2024-11-06 22:28:20,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20" (1/1) ... [2024-11-06 22:28:20,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20" (1/1) ... [2024-11-06 22:28:20,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20" (1/1) ... [2024-11-06 22:28:20,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:28:20,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:28:20,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:28:20,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:28:20,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20" (1/1) ... [2024-11-06 22:28:20,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:28:20,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:20,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 22:28:20,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 22:28:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-06 22:28:20,379 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-06 22:28:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 22:28:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-06 22:28:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-06 22:28:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-06 22:28:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:28:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 22:28:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-06 22:28:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:28:20,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:28:20,505 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:28:20,506 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:28:20,521 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-06 22:28:20,772 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-06 22:28:20,772 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:28:20,780 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:28:20,781 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-06 22:28:20,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:20 BoogieIcfgContainer [2024-11-06 22:28:20,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:28:20,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:28:20,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:28:20,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:28:20,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:28:19" (1/3) ... [2024-11-06 22:28:20,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3457d445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:20, skipping insertion in model container [2024-11-06 22:28:20,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:28:20" (2/3) ... [2024-11-06 22:28:20,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3457d445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:28:20, skipping insertion in model container [2024-11-06 22:28:20,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:28:20" (3/3) ... [2024-11-06 22:28:20,789 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2024-11-06 22:28:20,805 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:28:20,805 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:28:20,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:28:20,873 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;@4d75fe68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:28:20,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:28:20,877 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-06 22:28:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 22:28:20,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:20,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:28:20,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:20,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:20,887 INFO L85 PathProgramCache]: Analyzing trace with hash -504255867, now seen corresponding path program 1 times [2024-11-06 22:28:20,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:20,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912748862] [2024-11-06 22:28:20,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:20,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:21,064 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-06 22:28:21,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:21,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912748862] [2024-11-06 22:28:21,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912748862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:28:21,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:28:21,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 22:28:21,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159903677] [2024-11-06 22:28:21,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:28:21,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 22:28:21,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:21,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 22:28:21,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 22:28:21,093 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-06 22:28:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:21,109 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2024-11-06 22:28:21,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 22:28:21,111 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-06 22:28:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:21,116 INFO L225 Difference]: With dead ends: 64 [2024-11-06 22:28:21,116 INFO L226 Difference]: Without dead ends: 27 [2024-11-06 22:28:21,119 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-06 22:28:21,123 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-06 22:28:21,126 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-06 22:28:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-06 22:28:21,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-06 22:28:21,143 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-06 22:28:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2024-11-06 22:28:21,149 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 15 [2024-11-06 22:28:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:21,150 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2024-11-06 22:28:21,150 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-06 22:28:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-11-06 22:28:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 22:28:21,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:21,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:28:21,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:28:21,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:21,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash 775433970, now seen corresponding path program 1 times [2024-11-06 22:28:21,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:21,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316887890] [2024-11-06 22:28:21,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:21,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:21,394 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-06 22:28:21,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:21,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316887890] [2024-11-06 22:28:21,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316887890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:28:21,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:28:21,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:28:21,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624752661] [2024-11-06 22:28:21,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:28:21,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:28:21,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:21,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:28:21,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:28:21,397 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-06 22:28:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:21,416 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-06 22:28:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:28:21,417 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-06 22:28:21,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:21,418 INFO L225 Difference]: With dead ends: 52 [2024-11-06 22:28:21,418 INFO L226 Difference]: Without dead ends: 32 [2024-11-06 22:28:21,418 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-06 22:28:21,419 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-06 22:28:21,419 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-06 22:28:21,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-06 22:28:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-06 22:28:21,426 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-06 22:28:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-11-06 22:28:21,428 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2024-11-06 22:28:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:21,428 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-11-06 22:28:21,428 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-06 22:28:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-11-06 22:28:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-06 22:28:21,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:21,430 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-06 22:28:21,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:28:21,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:21,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1038406110, now seen corresponding path program 1 times [2024-11-06 22:28:21,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:21,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74292657] [2024-11-06 22:28:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:21,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:21,576 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-06 22:28:21,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:21,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74292657] [2024-11-06 22:28:21,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74292657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:28:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:28:21,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:28:21,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365594428] [2024-11-06 22:28:21,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:28:21,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:28:21,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:21,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:28:21,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:28:21,581 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-06 22:28:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:21,608 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-11-06 22:28:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:28:21,609 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-06 22:28:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:21,609 INFO L225 Difference]: With dead ends: 56 [2024-11-06 22:28:21,609 INFO L226 Difference]: Without dead ends: 31 [2024-11-06 22:28:21,610 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-06 22:28:21,610 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-06 22:28:21,611 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-06 22:28:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-06 22:28:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-06 22:28:21,616 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-06 22:28:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-11-06 22:28:21,617 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2024-11-06 22:28:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:21,617 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-06 22:28:21,617 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-06 22:28:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-06 22:28:21,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-06 22:28:21,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:21,618 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-06 22:28:21,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 22:28:21,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:21,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:21,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1976697508, now seen corresponding path program 1 times [2024-11-06 22:28:21,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:21,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134977409] [2024-11-06 22:28:21,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:21,802 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-06 22:28:21,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:21,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134977409] [2024-11-06 22:28:21,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134977409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:21,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364096711] [2024-11-06 22:28:21,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:21,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:21,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:21,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:28:21,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 22:28:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:21,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 22:28:21,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:28:22,035 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-06 22:28:22,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:28:22,074 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-06 22:28:22,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364096711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:28:22,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:28:22,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-06 22:28:22,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122273366] [2024-11-06 22:28:22,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:28:22,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:28:22,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:22,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:28:22,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:28:22,079 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-06 22:28:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:22,108 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-11-06 22:28:22,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:28:22,109 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-06 22:28:22,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:22,110 INFO L225 Difference]: With dead ends: 53 [2024-11-06 22:28:22,110 INFO L226 Difference]: Without dead ends: 33 [2024-11-06 22:28:22,111 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-06 22:28:22,111 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-06 22:28:22,112 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-06 22:28:22,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-06 22:28:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-06 22:28:22,114 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-06 22:28:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-06 22:28:22,115 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2024-11-06 22:28:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:22,115 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-06 22:28:22,115 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-06 22:28:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-06 22:28:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 22:28:22,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:22,116 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:28:22,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 22:28:22,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:22,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:22,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:22,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1871980112, now seen corresponding path program 1 times [2024-11-06 22:28:22,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:22,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262925420] [2024-11-06 22:28:22,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:22,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:22,449 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-06 22:28:22,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:22,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262925420] [2024-11-06 22:28:22,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262925420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:28:22,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:28:22,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 22:28:22,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279912470] [2024-11-06 22:28:22,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:28:22,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 22:28:22,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:22,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 22:28:22,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 22:28:22,452 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-06 22:28:22,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:22,474 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2024-11-06 22:28:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 22:28:22,477 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-06 22:28:22,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:22,477 INFO L225 Difference]: With dead ends: 46 [2024-11-06 22:28:22,478 INFO L226 Difference]: Without dead ends: 35 [2024-11-06 22:28:22,478 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-06 22:28:22,478 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-06 22:28:22,479 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-06 22:28:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-06 22:28:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-06 22:28:22,485 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-06 22:28:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-06 22:28:22,486 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 25 [2024-11-06 22:28:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:22,486 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-06 22:28:22,486 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-06 22:28:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-06 22:28:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 22:28:22,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:22,487 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-06 22:28:22,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 22:28:22,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:22,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash 835167343, now seen corresponding path program 1 times [2024-11-06 22:28:22,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:22,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138446754] [2024-11-06 22:28:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:22,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:22,707 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-06 22:28:22,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:22,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138446754] [2024-11-06 22:28:22,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138446754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:28:22,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:28:22,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 22:28:22,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814155626] [2024-11-06 22:28:22,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:28:22,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 22:28:22,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:22,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 22:28:22,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 22:28:22,709 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-06 22:28:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:22,735 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-11-06 22:28:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 22:28:22,738 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-06 22:28:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:22,738 INFO L225 Difference]: With dead ends: 49 [2024-11-06 22:28:22,738 INFO L226 Difference]: Without dead ends: 36 [2024-11-06 22:28:22,738 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-06 22:28:22,739 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-06 22:28:22,739 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-06 22:28:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-06 22:28:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-06 22:28:22,745 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-06 22:28:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-06 22:28:22,747 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 26 [2024-11-06 22:28:22,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:22,747 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-06 22:28:22,747 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-06 22:28:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-06 22:28:22,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 22:28:22,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:22,747 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-06 22:28:22,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 22:28:22,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:22,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:22,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339204, now seen corresponding path program 1 times [2024-11-06 22:28:22,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:22,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75716961] [2024-11-06 22:28:22,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:22,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:24,643 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-06 22:28:24,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:24,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75716961] [2024-11-06 22:28:24,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75716961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:24,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689352909] [2024-11-06 22:28:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:24,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:24,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:24,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:28:24,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 22:28:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:25,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-06 22:28:25,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:28:25,117 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-06 22:28:25,257 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-06 22:28:25,258 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-06 22:28:25,379 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-06 22:28:25,401 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-06 22:28:25,493 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-06 22:28:25,494 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 57 treesize of output 50 [2024-11-06 22:28:25,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-06 22:28:25,734 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-06 22:28:25,734 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-06 22:28:25,878 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 48 treesize of output 31 [2024-11-06 22:28:25,900 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-06 22:28:26,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2024-11-06 22:28:26,211 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-06 22:28:26,219 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 20 treesize of output 15 [2024-11-06 22:28:26,287 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-06 22:28:26,342 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-06 22:28:26,420 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-06 22:28:26,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:28:27,034 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 72 treesize of output 52 [2024-11-06 22:28:27,039 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 56 treesize of output 40 [2024-11-06 22:28:28,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:28,637 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 3 case distinctions, treesize of input 324 treesize of output 316 [2024-11-06 22:28:28,648 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 108 treesize of output 100 [2024-11-06 22:28:28,659 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 65 treesize of output 63 [2024-11-06 22:28:28,665 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 63 treesize of output 61 [2024-11-06 22:28:28,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:28,675 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 2 case distinctions, treesize of input 113 treesize of output 103 [2024-11-06 22:28:28,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:28,684 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 339 treesize of output 303 [2024-11-06 22:28:28,697 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 143 treesize of output 127 [2024-11-06 22:28:28,716 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 127 treesize of output 119 [2024-11-06 22:28:28,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2024-11-06 22:28:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:28:29,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689352909] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:28:29,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:28:29,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2024-11-06 22:28:29,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515973107] [2024-11-06 22:28:29,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:28:29,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-06 22:28:29,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:29,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-06 22:28:29,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1854, Unknown=65, NotChecked=0, Total=2070 [2024-11-06 22:28:29,072 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-06 22:28:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:30,618 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2024-11-06 22:28:30,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-06 22:28:30,618 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-06 22:28:30,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:30,619 INFO L225 Difference]: With dead ends: 60 [2024-11-06 22:28:30,619 INFO L226 Difference]: Without dead ends: 58 [2024-11-06 22:28:30,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=316, Invalid=3157, Unknown=67, NotChecked=0, Total=3540 [2024-11-06 22:28:30,622 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 74 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 22:28:30,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 277 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 22:28:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-06 22:28:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2024-11-06 22:28:30,626 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-06 22:28:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-11-06 22:28:30,627 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 26 [2024-11-06 22:28:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:30,627 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-11-06 22:28:30,628 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-06 22:28:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-11-06 22:28:30,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-06 22:28:30,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:30,629 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-06 22:28:30,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 22:28:30,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:30,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:30,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:30,830 INFO L85 PathProgramCache]: Analyzing trace with hash 201100899, now seen corresponding path program 1 times [2024-11-06 22:28:30,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:30,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968402046] [2024-11-06 22:28:30,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:30,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:30,968 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-06 22:28:30,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:30,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968402046] [2024-11-06 22:28:30,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968402046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:30,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885767684] [2024-11-06 22:28:30,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:30,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:30,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:30,971 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:28:30,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 22:28:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:31,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-06 22:28:31,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:28:31,156 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-06 22:28:31,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:28:31,228 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-06 22:28:31,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885767684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:28:31,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:28:31,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-06 22:28:31,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975144068] [2024-11-06 22:28:31,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:28:31,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 22:28:31,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:31,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 22:28:31,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 22:28:31,231 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-06 22:28:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:31,319 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-11-06 22:28:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:28:31,322 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-06 22:28:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:31,322 INFO L225 Difference]: With dead ends: 53 [2024-11-06 22:28:31,322 INFO L226 Difference]: Without dead ends: 42 [2024-11-06 22:28:31,323 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-06 22:28:31,323 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:28:31,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:28:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-06 22:28:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-06 22:28:31,329 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-06 22:28:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-11-06 22:28:31,329 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 27 [2024-11-06 22:28:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:31,329 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-11-06 22:28:31,329 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-06 22:28:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-11-06 22:28:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-06 22:28:31,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:31,330 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-06 22:28:31,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 22:28:31,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:31,533 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:31,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:31,533 INFO L85 PathProgramCache]: Analyzing trace with hash 258359201, now seen corresponding path program 1 times [2024-11-06 22:28:31,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:31,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531935532] [2024-11-06 22:28:31,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:31,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:31,760 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-06 22:28:31,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:31,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531935532] [2024-11-06 22:28:31,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531935532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:31,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034416842] [2024-11-06 22:28:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:31,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:31,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:31,764 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:28:31,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 22:28:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:31,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-06 22:28:31,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:28:31,957 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-06 22:28:31,977 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-06 22:28:31,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:28:31,998 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-06 22:28:31,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034416842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:28:31,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:28:31,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2024-11-06 22:28:31,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932724562] [2024-11-06 22:28:31,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:28:31,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 22:28:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:31,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 22:28:31,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-06 22:28:31,999 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-06 22:28:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:32,145 INFO L93 Difference]: Finished difference Result 74 states and 102 transitions. [2024-11-06 22:28:32,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 22:28:32,145 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-06 22:28:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:32,146 INFO L225 Difference]: With dead ends: 74 [2024-11-06 22:28:32,146 INFO L226 Difference]: Without dead ends: 41 [2024-11-06 22:28:32,147 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-06 22:28:32,148 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:28:32,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 204 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:28:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-06 22:28:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-06 22:28:32,155 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-06 22:28:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-06 22:28:32,155 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 27 [2024-11-06 22:28:32,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:32,156 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-06 22:28:32,156 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-06 22:28:32,157 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-06 22:28:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-06 22:28:32,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:32,157 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-06 22:28:32,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 22:28:32,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-06 22:28:32,358 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:32,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1464037342, now seen corresponding path program 1 times [2024-11-06 22:28:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:32,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617864336] [2024-11-06 22:28:32,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:32,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:32,627 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-06 22:28:32,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:32,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617864336] [2024-11-06 22:28:32,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617864336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:28:32,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:28:32,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 22:28:32,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290943097] [2024-11-06 22:28:32,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:28:32,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 22:28:32,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:32,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 22:28:32,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-06 22:28:32,628 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-06 22:28:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:32,768 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-06 22:28:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 22:28:32,768 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-06 22:28:32,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:32,769 INFO L225 Difference]: With dead ends: 53 [2024-11-06 22:28:32,769 INFO L226 Difference]: Without dead ends: 46 [2024-11-06 22:28:32,769 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-06 22:28:32,769 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:28:32,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 139 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:28:32,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-06 22:28:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-11-06 22:28:32,774 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-06 22:28:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-11-06 22:28:32,785 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 27 [2024-11-06 22:28:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:32,785 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-06 22:28:32,785 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-06 22:28:32,785 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-11-06 22:28:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-06 22:28:32,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:32,786 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-06 22:28:32,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 22:28:32,786 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:32,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2045561648, now seen corresponding path program 2 times [2024-11-06 22:28:32,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:32,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367192139] [2024-11-06 22:28:32,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:32,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:32,945 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-06 22:28:32,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:32,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367192139] [2024-11-06 22:28:32,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367192139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:32,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909904732] [2024-11-06 22:28:32,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:28:32,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:32,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:32,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:28:32,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 22:28:33,133 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:28:33,134 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:28:33,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 22:28:33,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:28:33,165 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-06 22:28:33,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 22:28:33,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909904732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:28:33,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 22:28:33,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-06 22:28:33,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819817502] [2024-11-06 22:28:33,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:28:33,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:28:33,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:33,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:28:33,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 22:28:33,167 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-06 22:28:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:33,192 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-11-06 22:28:33,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:28:33,193 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-06 22:28:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:33,194 INFO L225 Difference]: With dead ends: 53 [2024-11-06 22:28:33,194 INFO L226 Difference]: Without dead ends: 36 [2024-11-06 22:28:33,194 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-06 22:28:33,194 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:28:33,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:28:33,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-06 22:28:33,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-06 22:28:33,202 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-06 22:28:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-06 22:28:33,204 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 27 [2024-11-06 22:28:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:33,205 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-06 22:28:33,205 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-06 22:28:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-06 22:28:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-06 22:28:33,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:33,206 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-06 22:28:33,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 22:28:33,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-06 22:28:33,406 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:33,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1857767657, now seen corresponding path program 1 times [2024-11-06 22:28:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:33,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818339416] [2024-11-06 22:28:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:33,617 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-06 22:28:33,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:33,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818339416] [2024-11-06 22:28:33,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818339416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:33,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356619764] [2024-11-06 22:28:33,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:33,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:33,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:33,619 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:28:33,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 22:28:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:33,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-06 22:28:33,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:28:33,834 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-06 22:28:33,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:28:33,896 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-06 22:28:33,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356619764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:28:33,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:28:33,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-06 22:28:33,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720356678] [2024-11-06 22:28:33,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:28:33,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 22:28:33,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:33,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 22:28:33,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-06 22:28:33,899 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-06 22:28:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:33,986 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-11-06 22:28:33,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 22:28:33,987 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-06 22:28:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:33,987 INFO L225 Difference]: With dead ends: 44 [2024-11-06 22:28:33,987 INFO L226 Difference]: Without dead ends: 35 [2024-11-06 22:28:33,988 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-06 22:28:33,988 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:28:33,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 135 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:28:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-06 22:28:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-06 22:28:33,992 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-06 22:28:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-06 22:28:33,993 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2024-11-06 22:28:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:33,993 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-06 22:28:33,993 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-06 22:28:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-06 22:28:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-06 22:28:33,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:33,993 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-06 22:28:34,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-06 22:28:34,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-06 22:28:34,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:34,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1756277405, now seen corresponding path program 1 times [2024-11-06 22:28:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:34,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161371876] [2024-11-06 22:28:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:34,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:35,505 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-06 22:28:35,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:35,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161371876] [2024-11-06 22:28:35,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161371876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:35,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465116089] [2024-11-06 22:28:35,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:35,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:35,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:35,508 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:28:35,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 22:28:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:35,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-06 22:28:35,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:28:35,881 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-06 22:28:35,988 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-06 22:28:35,988 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-06 22:28:36,055 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-06 22:28:36,064 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-06 22:28:36,139 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-06 22:28:36,139 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 57 treesize of output 50 [2024-11-06 22:28:36,150 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 16 [2024-11-06 22:28:36,333 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-06 22:28:36,333 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-06 22:28:36,446 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-06 22:28:36,453 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-06 22:28:36,462 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 48 treesize of output 31 [2024-11-06 22:28:36,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:36,705 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 34 [2024-11-06 22:28:36,709 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 25 treesize of output 11 [2024-11-06 22:28:36,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2024-11-06 22:28:36,719 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-06 22:28:36,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2024-11-06 22:28:36,736 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 31 treesize of output 20 [2024-11-06 22:28:36,813 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 63 treesize of output 40 [2024-11-06 22:28:36,822 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-06 22:28:36,826 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 31 treesize of output 20 [2024-11-06 22:28:36,892 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 72 treesize of output 44 [2024-11-06 22:28:36,937 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 34 treesize of output 18 [2024-11-06 22:28:36,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-06 22:28:37,001 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-06 22:28:37,003 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-06 22:28:37,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:28:37,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1469) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1468) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1470) .cse0) .cse1))))) is different from false [2024-11-06 22:28:37,114 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (or (not (= v_ArrVal_1461 (let ((.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (store (let ((.cse1 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8))) (store (select .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1461 .cse1))) .cse2 (select v_ArrVal_1461 .cse2))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse3 (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1461) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1469) (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1468) .cse4) .cse5)) (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1467) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1470) .cse4) .cse5))))))) is different from false [2024-11-06 22:28:37,146 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse1 (select .cse2 .cse3)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1461) .cse1 v_ArrVal_1469) (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse2 .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1462) .cse1 v_ArrVal_1468) .cse4) .cse5)) (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1467) .cse1 v_ArrVal_1470) .cse4) .cse5))))) (not (= v_ArrVal_1461 (let ((.cse7 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (store (let ((.cse6 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8))) (store (select .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse6 (select v_ArrVal_1461 .cse6))) .cse7 (select v_ArrVal_1461 .cse7)))))))) is different from false [2024-11-06 22:28:37,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse0 (store |c_#memory_int#2| .cse2 v_ArrVal_1460))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse1 (select .cse3 .cse4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store .cse0 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1461) .cse1 v_ArrVal_1469) (select (select (store (store (store |c_#memory_$Pointer$#2.base| .cse2 (store .cse3 .cse4 |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1462) .cse1 v_ArrVal_1468) .cse5) .cse6)) (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store (select |c_#memory_$Pointer$#2.offset| .cse2) .cse4 |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1467) .cse1 v_ArrVal_1470) .cse5) .cse6))))) (not (= (let ((.cse8 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (store (let ((.cse7 (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|))) (store (select .cse0 |c_ULTIMATE.start_node_create_#res#1.base|) .cse7 (select v_ArrVal_1461 .cse7))) .cse8 (select v_ArrVal_1461 .cse8))) v_ArrVal_1461)))))) is different from false [2024-11-06 22:28:37,225 INFO L349 Elim1Store]: treesize reduction 263, result has 51.1 percent of original size [2024-11-06 22:28:37,226 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 2 case distinctions, treesize of input 3553 treesize of output 3563 [2024-11-06 22:28:37,239 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 1562 treesize of output 1306 [2024-11-06 22:28:37,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:37,265 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 339 treesize of output 341 [2024-11-06 22:28:37,315 INFO L349 Elim1Store]: treesize reduction 348, result has 39.8 percent of original size [2024-11-06 22:28:37,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 684 treesize of output 831 [2024-11-06 22:28:37,366 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 68 treesize of output 4 [2024-11-06 22:28:37,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:37,859 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 1699 treesize of output 1707 [2024-11-06 22:28:38,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:38,142 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 1107 treesize of output 1117 [2024-11-06 22:28:38,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2024-11-06 22:28:38,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:38,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 366 treesize of output 505 [2024-11-06 22:28:40,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse4 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse2 (store |c_#memory_$Pointer$#2.offset| .cse3 (store (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (.cse7 (store |c_#memory_$Pointer$#2.base| .cse3 (store .cse11 .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (.cse8 (select .cse11 .cse4))) (and (forall ((v_ArrVal_1467 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_ArrVal_1470 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_4) .cse3) .cse4) v_prenex_6) .cse5) .cse6)) (.cse0 (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1467) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_1) .cse3) .cse4) v_ArrVal_1470) .cse5) .cse6))) (or (= .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (or (forall ((v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_3) .cse8 v_prenex_2) .cse5) .cse6) .cse3)) (forall ((v_ArrVal_1467 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_ArrVal_1470 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse9 (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1467) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_1) .cse3) .cse4) v_ArrVal_1470) .cse5) .cse6))) (or (= .cse9 (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_4) .cse3) .cse4) v_prenex_6) .cse5) .cse6)) (= .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))))) (forall ((v_ArrVal_1467 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_ArrVal_1470 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse10 (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_4) .cse3) .cse4) v_prenex_6) .cse5) .cse6))) (or (= (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1467) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_1) .cse3) .cse4) v_ArrVal_1470) .cse5) .cse6) .cse10) (= .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse3)) (or (forall ((v_ArrVal_1467 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1467) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_1) .cse3) .cse4) v_ArrVal_1470) .cse5) .cse6) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (forall ((v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_4) .cse3) .cse4) v_prenex_6) .cse5) .cse6) |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1462 (Array Int Int))) (= (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1462) .cse8 v_ArrVal_1468) .cse5) .cse6) |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int))) (not (= (select (select (store (store .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base| v_prenex_9) .cse8 v_prenex_8) .cse5) .cse6) .cse8))) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_node_create_~data#1|))))) is different from false [2024-11-06 22:28:40,078 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 953 treesize of output 697 [2024-11-06 22:28:40,085 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 701 treesize of output 513 [2024-11-06 22:28:41,451 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:41,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:41,460 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 2 case distinctions, treesize of input 118 treesize of output 79 [2024-11-06 22:28:41,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:41,467 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 141 treesize of output 105 [2024-11-06 22:28:41,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-11-06 22:28:41,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2024-11-06 22:28:41,491 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:41,497 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:41,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:41,507 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 141 treesize of output 101 [2024-11-06 22:28:41,511 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:41,513 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 152 treesize of output 116 [2024-11-06 22:28:41,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-06 22:28:41,525 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 11 treesize of output 7 [2024-11-06 22:28:41,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-06 22:28:41,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-06 22:28:41,534 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:41,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:41,548 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 74 treesize of output 64 [2024-11-06 22:28:41,553 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:41,555 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 87 treesize of output 63 [2024-11-06 22:28:41,558 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 19 treesize of output 11 [2024-11-06 22:28:41,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-06 22:28:41,568 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:41,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-06 22:28:41,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:41,582 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 2 case distinctions, treesize of input 63 treesize of output 53 [2024-11-06 22:28:41,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:41,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:41,590 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 49 treesize of output 31 [2024-11-06 22:28:41,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-06 22:28:41,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-06 22:28:41,604 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:41,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:41,612 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 2 case distinctions, treesize of input 64 treesize of output 54 [2024-11-06 22:28:41,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-06 22:28:41,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:41,623 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 49 treesize of output 31 [2024-11-06 22:28:41,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-06 22:28:41,631 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:41,636 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 19 treesize of output 11 [2024-11-06 22:28:41,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-06 22:28:41,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:41,649 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 2 case distinctions, treesize of input 63 treesize of output 53 [2024-11-06 22:28:41,652 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:41,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:41,656 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 49 treesize of output 31 [2024-11-06 22:28:41,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-06 22:28:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-06 22:28:42,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465116089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:28:42,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:28:42,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 52 [2024-11-06 22:28:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720428075] [2024-11-06 22:28:42,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:28:42,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-06 22:28:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-06 22:28:42,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1966, Unknown=20, NotChecked=470, Total=2652 [2024-11-06 22:28:42,005 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 52 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 52 states have internal predecessors, (77), 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-06 22:28:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:43,704 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-06 22:28:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-06 22:28:43,704 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 52 states have internal predecessors, (77), 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 29 [2024-11-06 22:28:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:43,705 INFO L225 Difference]: With dead ends: 38 [2024-11-06 22:28:43,705 INFO L226 Difference]: Without dead ends: 36 [2024-11-06 22:28:43,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=287, Invalid=2575, Unknown=20, NotChecked=540, Total=3422 [2024-11-06 22:28:43,707 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:28:43,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 277 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 847 Invalid, 0 Unknown, 184 Unchecked, 1.2s Time] [2024-11-06 22:28:43,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-06 22:28:43,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2024-11-06 22:28:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:28:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-06 22:28:43,715 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2024-11-06 22:28:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:43,715 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-06 22:28:43,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 52 states have internal predecessors, (77), 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-06 22:28:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-06 22:28:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 22:28:43,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:43,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, 1, 1, 1, 1] [2024-11-06 22:28:43,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-06 22:28:43,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:43,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:43,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash 139595796, now seen corresponding path program 1 times [2024-11-06 22:28:43,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:43,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010689584] [2024-11-06 22:28:43,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:43,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:28:45,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:45,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010689584] [2024-11-06 22:28:45,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010689584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:45,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569082837] [2024-11-06 22:28:45,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:45,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:45,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:45,470 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:28:45,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-06 22:28:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:45,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-06 22:28:45,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:28:45,791 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-06 22:28:45,855 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-06 22:28:45,855 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-06 22:28:45,898 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 24 treesize of output 9 [2024-11-06 22:28:45,937 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-06 22:28:45,938 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 52 treesize of output 49 [2024-11-06 22:28:46,072 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-06 22:28:46,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-06 22:28:46,135 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 67 treesize of output 50 [2024-11-06 22:28:46,324 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 222 treesize of output 55 [2024-11-06 22:28:46,334 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 58 treesize of output 54 [2024-11-06 22:28:46,336 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 54 treesize of output 21 [2024-11-06 22:28:46,408 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-11-06 22:28:46,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 98 [2024-11-06 22:28:46,412 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 62 treesize of output 21 [2024-11-06 22:28:46,464 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 131 treesize of output 95 [2024-11-06 22:28:46,467 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 99 treesize of output 71 [2024-11-06 22:28:46,509 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 9 treesize of output 3 [2024-11-06 22:28:46,634 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-06 22:28:46,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 23 [2024-11-06 22:28:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:28:46,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:28:46,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:46,840 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 130 treesize of output 131 [2024-11-06 22:28:46,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:46,850 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 503 treesize of output 502 [2024-11-06 22:28:46,854 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 478 treesize of output 462 [2024-11-06 22:28:46,856 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 462 treesize of output 454 [2024-11-06 22:28:46,941 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.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|))) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ .cse2 4)) (.cse8 (select .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse10 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse3 (= .cse5 |c_ULTIMATE.start_dll_insert_~last~0#1.base|))) (let ((.cse11 (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_118 Int)) (not (= (select (let ((.cse14 (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse8 .cse9 v_ArrVal_1642) .cse10 |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1646))) (select .cse14 (select (select .cse14 .cse5) .cse6))) (+ v_arrayElimCell_118 4)) 0))) (not .cse3)))) (let ((.cse0 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse5)) (.cse1 (and (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_116 Int)) (not (= (select (let ((.cse13 (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse8 .cse9 v_ArrVal_1642) .cse10 |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1646))) (select .cse13 (select (select .cse13 .cse5) .cse6))) (+ v_arrayElimCell_116 4)) 0))) .cse3) .cse11))) (and (or .cse0 .cse1 (= .cse2 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|)) (or (not .cse0) (and (or .cse3 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_119 Int)) (not (= (select (let ((.cse4 (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse8 .cse9 v_ArrVal_1642) .cse10 |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1646))) (select .cse4 (select (select .cse4 .cse5) .cse6))) (+ v_arrayElimCell_119 4)) 0)))) .cse11)) (or (and .cse11 (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int)) (not (= (select (let ((.cse12 (store (store .cse7 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse8 .cse9 v_ArrVal_1642) .cse10 |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1646))) (select .cse12 (select (select .cse12 .cse5) .cse6))) .cse10) 0))) .cse3)) .cse0) (or .cse0 .cse1 (= .cse5 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|))))))) is different from false [2024-11-06 22:28:47,061 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse17 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse16 .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse13 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select .cse16 .cse17)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (= .cse8 .cse2)) (.cse3 (+ .cse13 4)) (.cse5 (select .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (let ((.cse10 (or (not .cse9) (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_118 Int)) (not (= (select (let ((.cse15 (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1642) .cse7 .cse8)) .cse8 v_ArrVal_1646))) (select .cse15 (select (select .cse15 .cse2) .cse3))) (+ v_arrayElimCell_118 4)) 0)))))) (let ((.cse0 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse2)) (.cse12 (and (or .cse9 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_116 Int)) (not (= (select (let ((.cse14 (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1642) .cse7 .cse8)) .cse8 v_ArrVal_1646))) (select .cse14 (select (select .cse14 .cse2) .cse3))) (+ v_arrayElimCell_116 4)) 0)))) .cse10))) (and (or .cse0 (and (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int)) (not (= (select (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1642) .cse7 .cse8)) .cse8 v_ArrVal_1646))) (select .cse1 (select (select .cse1 .cse2) .cse3))) .cse7) 0))) .cse9) .cse10)) (or (not .cse0) (and (or .cse9 (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_119 Int)) (not (= (select (let ((.cse11 (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse5 .cse6 v_ArrVal_1642) .cse7 .cse8)) .cse8 v_ArrVal_1646))) (select .cse11 (select (select .cse11 .cse2) .cse3))) (+ v_arrayElimCell_119 4)) 0)))) .cse10)) (or .cse0 (= .cse2 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse12) (or .cse0 .cse12 (= .cse13 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|)))))))) is different from false [2024-11-06 22:28:47,416 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ .cse2 4)) (.cse10 (+ 8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse11 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (+ .cse3 4)) (.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse15 (forall ((v_ArrVal_1638 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1638))) (let ((.cse30 (select .cse28 .cse7))) (let ((.cse29 (select .cse30 .cse14))) (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_118 Int)) (not (= (select (let ((.cse26 (store (let ((.cse27 (store .cse30 .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (store (store |c_#memory_$Pointer$#2.base| .cse7 .cse27) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse28 .cse7 .cse27) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 v_ArrVal_1642) .cse11 .cse29))) .cse29 v_ArrVal_1646))) (select .cse26 (select (select .cse26 .cse5) .cse6))) (+ v_arrayElimCell_118 4)) 0))) (not (= .cse29 .cse5))))))))) (let ((.cse0 (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse5)) (.cse1 (and (forall ((v_ArrVal_1638 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1638))) (let ((.cse25 (select .cse23 .cse7))) (let ((.cse24 (select .cse25 .cse14))) (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_116 Int)) (not (= 0 (select (let ((.cse21 (store (let ((.cse22 (store .cse25 .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (store (store |c_#memory_$Pointer$#2.base| .cse7 .cse22) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse23 .cse7 .cse22) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 v_ArrVal_1642) .cse11 .cse24))) .cse24 v_ArrVal_1646))) (select .cse21 (select (select .cse21 .cse5) .cse6))) (+ v_arrayElimCell_116 4))))) (= .cse24 .cse5)))))) .cse15))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or (and (forall ((v_ArrVal_1638 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1638))) (let ((.cse13 (select .cse9 .cse7))) (let ((.cse12 (select .cse13 .cse14))) (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int) (v_arrayElimCell_119 Int)) (not (= (select (let ((.cse4 (store (let ((.cse8 (store .cse13 .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (store (store |c_#memory_$Pointer$#2.base| .cse7 .cse8) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse9 .cse7 .cse8) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 v_ArrVal_1642) .cse11 .cse12))) .cse12 v_ArrVal_1646))) (select .cse4 (select (select .cse4 .cse5) .cse6))) (+ v_arrayElimCell_119 4)) 0))) (= .cse12 .cse5)))))) .cse15) (not .cse0)) (or .cse0 (and (forall ((v_ArrVal_1638 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1638))) (let ((.cse20 (select .cse18 .cse7))) (let ((.cse19 (select .cse20 .cse14))) (or (forall ((v_ArrVal_1646 (Array Int Int)) (v_ArrVal_1642 Int)) (not (= (select (let ((.cse16 (store (let ((.cse17 (store .cse20 .cse14 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (store (store |c_#memory_$Pointer$#2.base| .cse7 .cse17) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse18 .cse7 .cse17) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse10 v_ArrVal_1642) .cse11 .cse19))) .cse19 v_ArrVal_1646))) (select .cse16 (select (select .cse16 .cse5) .cse6))) .cse11) 0))) (= .cse19 .cse5)))))) .cse15)) (or .cse0 .cse1 (= .cse5 .cse7))))))) is different from false [2024-11-06 22:28:47,569 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 1033 treesize of output 781 [2024-11-06 22:28:47,573 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 785 treesize of output 621 [2024-11-06 22:28:47,639 INFO L349 Elim1Store]: treesize reduction 28, result has 51.7 percent of original size [2024-11-06 22:28:47,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 61 [2024-11-06 22:28:47,689 INFO L349 Elim1Store]: treesize reduction 32, result has 44.8 percent of original size [2024-11-06 22:28:47,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 58 [2024-11-06 22:28:48,987 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:49,050 INFO L349 Elim1Store]: treesize reduction 75, result has 48.3 percent of original size [2024-11-06 22:28:49,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 89565 treesize of output 49395 [2024-11-06 22:28:49,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:49,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:49,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 5992 treesize of output 5730 [2024-11-06 22:28:49,423 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 572 treesize of output 500 [2024-11-06 22:28:49,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:49,441 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 548 treesize of output 502 [2024-11-06 22:28:49,609 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 42 treesize of output 26 [2024-11-06 22:28:49,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:49,636 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 1502 treesize of output 1438 [2024-11-06 22:28:49,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:49,645 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 162 treesize of output 127 [2024-11-06 22:28:49,649 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 118 treesize of output 114 [2024-11-06 22:28:49,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:49,657 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 121 treesize of output 115 [2024-11-06 22:28:49,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:49,673 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:49,712 INFO L349 Elim1Store]: treesize reduction 79, result has 48.4 percent of original size [2024-11-06 22:28:49,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 12164 treesize of output 6578 [2024-11-06 22:28:49,784 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:28:49,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:49,793 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 1 case distinctions, treesize of input 4688 treesize of output 4442 [2024-11-06 22:28:49,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5159 treesize of output 5015 [2024-11-06 22:28:50,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:50,084 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 3860 treesize of output 3484 [2024-11-06 22:28:50,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:50,123 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 3503 treesize of output 3067 [2024-11-06 22:28:50,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-06 22:28:50,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:28:50,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 70 [2024-11-06 22:28:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-06 22:28:51,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569082837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:28:51,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:28:51,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 52 [2024-11-06 22:28:51,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459911255] [2024-11-06 22:28:51,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:28:51,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-06 22:28:51,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:28:51,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-06 22:28:51,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2169, Unknown=32, NotChecked=288, Total=2652 [2024-11-06 22:28:51,070 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 52 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 52 states have internal predecessors, (84), 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-06 22:28:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:28:54,261 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-11-06 22:28:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-06 22:28:54,261 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 52 states have internal predecessors, (84), 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 31 [2024-11-06 22:28:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:28:54,262 INFO L225 Difference]: With dead ends: 48 [2024-11-06 22:28:54,262 INFO L226 Difference]: Without dead ends: 37 [2024-11-06 22:28:54,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=394, Invalid=4548, Unknown=40, NotChecked=420, Total=5402 [2024-11-06 22:28:54,263 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 22:28:54,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 206 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 798 Invalid, 0 Unknown, 109 Unchecked, 1.4s Time] [2024-11-06 22:28:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-06 22:28:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-11-06 22:28:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:28:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2024-11-06 22:28:54,269 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2024-11-06 22:28:54,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:28:54,269 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2024-11-06 22:28:54,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 52 states have internal predecessors, (84), 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-06 22:28:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-11-06 22:28:54,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 22:28:54,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:28:54,270 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, 1, 1] [2024-11-06 22:28:54,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-06 22:28:54,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:54,470 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:28:54,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:28:54,471 INFO L85 PathProgramCache]: Analyzing trace with hash 139597470, now seen corresponding path program 1 times [2024-11-06 22:28:54,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:28:54,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543258349] [2024-11-06 22:28:54,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:54,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:28:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:28:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:28:56,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543258349] [2024-11-06 22:28:56,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543258349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:28:56,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767244611] [2024-11-06 22:28:56,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:28:56,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:28:56,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:28:56,514 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:28:56,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-06 22:28:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:28:56,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-11-06 22:28:56,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:28:56,986 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-06 22:28:57,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-06 22:28:57,133 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-06 22:28:57,133 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-06 22:28:57,196 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-06 22:28:57,201 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-06 22:28:57,207 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-06 22:28:57,268 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-06 22:28:57,268 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 88 treesize of output 75 [2024-11-06 22:28:57,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-06 22:28:57,281 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 16 [2024-11-06 22:28:57,478 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-06 22:28:57,478 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-06 22:28:57,583 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-06 22:28:57,586 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-06 22:28:57,594 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 31 treesize of output 20 [2024-11-06 22:28:57,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 43 [2024-11-06 22:28:57,871 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 105 treesize of output 41 [2024-11-06 22:28:57,883 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 29 treesize of output 11 [2024-11-06 22:28:58,019 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2024-11-06 22:28:58,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 209 treesize of output 112 [2024-11-06 22:28:58,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:28:58,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 43 [2024-11-06 22:28:58,035 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 71 treesize of output 23 [2024-11-06 22:28:58,095 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 123 treesize of output 83 [2024-11-06 22:28:58,343 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-06 22:28:58,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2024-11-06 22:28:58,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-06 22:28:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:28:58,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:28:58,561 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1841)) (.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1843)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1840) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) (not (= v_ArrVal_1840 (let ((.cse6 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse6 (select v_ArrVal_1840 .cse6))))))) is different from false [2024-11-06 22:28:58,577 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1832 Int)) (let ((.cse0 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1830))) (or (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (store (select .cse0 |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse1 (select v_ArrVal_1840 .cse1))) v_ArrVal_1840)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse10 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse11 (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse5 (store (let ((.cse12 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (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|) .cse9 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) .cse10 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1841)) (.cse2 (store (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)))) (store .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse9 v_ArrVal_1832) .cse10 |c_ULTIMATE.start_dll_insert_~last~0#1.base|))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1843)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (store .cse0 |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1840) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))))) is different from false [2024-11-06 22:28:58,605 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1832 Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse11 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse12 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1830)) (.cse1 (select .cse11 .cse12)) (.cse14 (select .cse15 .cse12))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse10 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4))) (let ((.cse5 (store (let ((.cse13 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse15 .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)))) (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|) .cse9 |c_ULTIMATE.start_dll_insert_~last~0#1.offset|) .cse10 .cse14))) .cse1 v_ArrVal_1841)) (.cse2 (store (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse11 .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)))) (store .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse9 v_ArrVal_1832) .cse10 .cse1))) .cse1 v_ArrVal_1843)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ 4 (select (select .cse5 .cse6) .cse7)))) (select (select (store .cse0 .cse1 v_ArrVal_1840) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))) (not (= (let ((.cse16 (+ .cse14 8))) (store (select .cse0 .cse1) .cse16 (select v_ArrVal_1840 .cse16))) v_ArrVal_1840)))))) is different from false [2024-11-06 22:28:58,625 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1832 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.offset| .cse11)) (.cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ .cse15 4))) (let ((.cse0 (store (store |c_#memory_int#2| .cse11 v_ArrVal_1835) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1830)) (.cse1 (select .cse12 .cse13)) (.cse16 (select .cse17 .cse13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|)) (.cse10 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse5 (store (let ((.cse14 (store |c_#memory_$Pointer$#2.offset| .cse11 (store .cse17 .cse13 |c_ULTIMATE.start_node_create_#res#1.offset|)))) (store .cse14 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse14 |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 .cse15) .cse10 .cse16))) .cse1 v_ArrVal_1841)) (.cse2 (store (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse11 (store .cse12 .cse13 |c_ULTIMATE.start_node_create_#res#1.base|)))) (store .cse8 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse8 |c_ULTIMATE.start_node_create_#res#1.base|) .cse9 v_ArrVal_1832) .cse10 .cse1))) .cse1 v_ArrVal_1843)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (select (select (store .cse0 .cse1 v_ArrVal_1840) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))) (not (= v_ArrVal_1840 (let ((.cse18 (+ .cse16 8))) (store (select .cse0 .cse1) .cse18 (select v_ArrVal_1840 .cse18)))))))))) is different from false [2024-11-06 22:28:58,656 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1829 (Array Int Int)) (v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1832 Int)) (let ((.cse19 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse18 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1827)) (.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1829)) (.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse15 (select .cse12 .cse10)) (.cse20 (select .cse18 .cse10)) (.cse16 (+ .cse19 4))) (let ((.cse0 (store (store |c_#memory_int#2| .cse10 v_ArrVal_1835) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1830)) (.cse3 (select .cse20 .cse16)) (.cse1 (select .cse15 .cse16))) (or (not (= (let ((.cse2 (+ .cse3 8))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1840 .cse2))) v_ArrVal_1840)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse13 (+ 8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (.cse14 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse7 (store (let ((.cse17 (store .cse20 .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (store (store |c_#memory_$Pointer$#2.offset| .cse10 .cse17) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse18 .cse10 .cse17) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse13 .cse19) .cse14 .cse3))) .cse1 v_ArrVal_1841)) (.cse4 (store (let ((.cse11 (store .cse15 .cse16 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) (store (store |c_#memory_$Pointer$#2.base| .cse10 .cse11) |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select (store .cse12 .cse10 .cse11) |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse13 v_ArrVal_1832) .cse14 .cse1))) .cse1 v_ArrVal_1843)) (.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse5 (select (select .cse4 .cse8) .cse9)) (.cse6 (+ 4 (select (select .cse7 .cse8) .cse9)))) (select (select (store .cse0 .cse1 v_ArrVal_1840) (select (select .cse4 .cse5) .cse6)) (select (select .cse7 .cse5) .cse6))))))))))) is different from false [2024-11-06 22:28:58,692 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 808 treesize of output 620 [2024-11-06 22:28:58,695 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 624 treesize of output 480 [2024-11-06 22:29:06,720 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_25| Int) (v_ArrVal_1822 (Array Int Int)) (v_ArrVal_1843 (Array Int Int)) (v_ArrVal_1820 (Array Int Int)) (v_ArrVal_1830 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1829 (Array Int Int)) (v_ArrVal_1827 (Array Int Int)) (v_ArrVal_1832 Int) (v_ArrVal_1823 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1822)) (.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1820))) (let ((.cse9 (store .cse7 |v_ULTIMATE.start_node_create_~temp~0#1.base_25| v_ArrVal_1829)) (.cse13 (store .cse11 |v_ULTIMATE.start_node_create_~temp~0#1.base_25| v_ArrVal_1827))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8) v_ArrVal_1823)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1835) |v_ULTIMATE.start_node_create_~temp~0#1.base_25| v_ArrVal_1830)) (.cse1 (select .cse10 .cse6)) (.cse14 (select .cse15 .cse6))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store (let ((.cse12 (store .cse15 .cse6 0))) (store (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse12) |v_ULTIMATE.start_node_create_~temp~0#1.base_25| (store (store (select (store .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse12) |v_ULTIMATE.start_node_create_~temp~0#1.base_25|) 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 4 .cse14))) .cse1 v_ArrVal_1841)) (.cse2 (store (let ((.cse8 (store .cse10 .cse6 |v_ULTIMATE.start_node_create_~temp~0#1.base_25|))) (store (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8) |v_ULTIMATE.start_node_create_~temp~0#1.base_25| (store (store (select (store .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse8) |v_ULTIMATE.start_node_create_~temp~0#1.base_25|) 8 v_ArrVal_1832) 4 .cse1))) .cse1 v_ArrVal_1843))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)) (.cse4 (+ 4 (select (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6)))) (select (select (store .cse0 .cse1 v_ArrVal_1840) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (not (= (let ((.cse16 (+ .cse14 8))) (store (select .cse0 .cse1) .cse16 (select v_ArrVal_1840 .cse16))) v_ArrVal_1840)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_25|) 0)))))))) is different from false [2024-11-06 22:29:09,806 INFO L349 Elim1Store]: treesize reduction 155, result has 50.5 percent of original size [2024-11-06 22:29:09,807 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 7 new quantified variables, introduced 8 case distinctions, treesize of input 179103 treesize of output 145555 [2024-11-06 22:29:13,349 INFO L349 Elim1Store]: treesize reduction 374, result has 47.7 percent of original size [2024-11-06 22:29:13,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 95353 treesize of output 94842 [2024-11-06 22:29:25,213 WARN L286 SmtUtils]: Spent 10.53s on a formula simplification. DAG size of input: 249 DAG size of output: 132 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-06 22:29:25,214 INFO L349 Elim1Store]: treesize reduction 1506, result has 28.9 percent of original size [2024-11-06 22:29:25,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 38 case distinctions, treesize of input 14628404 treesize of output 11900516 [2024-11-06 22:29:30,472 INFO L224 Elim1Store]: Index analysis took 161 ms [2024-11-06 22:29:31,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:29:31,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 795569 treesize of output 731656 [2024-11-06 22:29:42,964 WARN L286 SmtUtils]: Spent 11.85s on a formula simplification. DAG size of input: 2284 DAG size of output: 1880 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 22:29:43,454 INFO L224 Elim1Store]: Index analysis took 271 ms [2024-11-06 22:29:44,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:29:44,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 799607 treesize of output 783053