./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/forester-heap/sll-circular-1.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38'] 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-circular-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:42:09,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:42:09,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 16:42:09,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:42:09,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:42:09,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:42:09,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:42:09,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:42:09,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:42:09,240 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:42:09,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:42:09,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:42:09,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:42:09,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:42:09,241 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:42:09,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:42:09,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:42:09,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:42:09,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:42:09,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:42:09,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:42:09,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:42:09,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:42:09,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:42:09,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:42:09,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:42:09,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:42:09,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:42:09,243 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 [2024-11-07 16:42:09,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:42:09,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:42:09,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:42:09,520 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:42:09,521 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:42:09,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-1.i [2024-11-07 16:42:10,678 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:42:10,949 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:42:10,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2024-11-07 16:42:10,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0048bd761/329060bb6a604f0b94c233eb071c161d/FLAGae6275f65 [2024-11-07 16:42:11,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0048bd761/329060bb6a604f0b94c233eb071c161d [2024-11-07 16:42:11,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:42:11,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:42:11,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:42:11,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:42:11,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:42:11,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ecb61cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11, skipping insertion in model container [2024-11-07 16:42:11,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:42:11,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:42:11,525 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:42:11,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:42:11,604 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:42:11,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11 WrapperNode [2024-11-07 16:42:11,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:42:11,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:42:11,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:42:11,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:42:11,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,644 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 120 [2024-11-07 16:42:11,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:42:11,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:42:11,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:42:11,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:42:11,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,679 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-11-07 16:42:11,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:42:11,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:42:11,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:42:11,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:42:11,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11" (1/1) ... [2024-11-07 16:42:11,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:42:11,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:42:11,733 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-07 16:42:11,738 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-07 16:42:11,760 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-07 16:42:11,760 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-07 16:42:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 16:42:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 16:42:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:42:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:42:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:42:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:42:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:42:11,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:42:11,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:42:11,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:42:11,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:42:11,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:42:11,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:42:11,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:42:11,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:42:11,849 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:42:11,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:42:12,102 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-11-07 16:42:12,102 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:42:12,111 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:42:12,113 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-07 16:42:12,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:12 BoogieIcfgContainer [2024-11-07 16:42:12,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:42:12,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:42:12,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:42:12,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:42:12,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:42:11" (1/3) ... [2024-11-07 16:42:12,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e81463e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:12, skipping insertion in model container [2024-11-07 16:42:12,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:11" (2/3) ... [2024-11-07 16:42:12,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e81463e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:12, skipping insertion in model container [2024-11-07 16:42:12,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:12" (3/3) ... [2024-11-07 16:42:12,123 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2024-11-07 16:42:12,137 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:42:12,138 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-07 16:42:12,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:42:12,205 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=None, 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;@5f50e72e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:42:12,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-07 16:42:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 58 states have (on average 2.103448275862069) internal successors, (122), 102 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:42:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:42:12,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:12,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:42:12,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:12,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:12,221 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-07 16:42:12,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:12,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539951000] [2024-11-07 16:42:12,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:12,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:12,364 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-07 16:42:12,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:12,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539951000] [2024-11-07 16:42:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539951000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:12,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:12,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:42:12,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109800241] [2024-11-07 16:42:12,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:12,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:42:12,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:42:12,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:42:12,391 INFO L87 Difference]: Start difference. First operand has 107 states, 58 states have (on average 2.103448275862069) internal successors, (122), 102 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-07 16:42:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:12,490 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2024-11-07 16:42:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:42:12,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-07 16:42:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:12,496 INFO L225 Difference]: With dead ends: 98 [2024-11-07 16:42:12,496 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 16:42:12,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07 16:42:12,499 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 68 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:12,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 86 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:12,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 16:42:12,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-07 16:42:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2024-11-07 16:42:12,532 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 3 [2024-11-07 16:42:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:12,533 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2024-11-07 16:42:12,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-07 16:42:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2024-11-07 16:42:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:42:12,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:12,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:42:12,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:42:12,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:12,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:12,535 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-07 16:42:12,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:12,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769474239] [2024-11-07 16:42:12,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:12,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:12,625 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-07 16:42:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:12,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769474239] [2024-11-07 16:42:12,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769474239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:12,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:12,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:42:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914849675] [2024-11-07 16:42:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:12,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:42:12,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:12,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:42:12,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:42:12,630 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-07 16:42:12,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:12,716 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2024-11-07 16:42:12,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:42:12,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-07 16:42:12,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:12,718 INFO L225 Difference]: With dead ends: 92 [2024-11-07 16:42:12,718 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 16:42:12,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07 16:42:12,719 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 68 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:12,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 16:42:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 16:42:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.830188679245283) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2024-11-07 16:42:12,727 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 3 [2024-11-07 16:42:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:12,727 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2024-11-07 16:42:12,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-07 16:42:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2024-11-07 16:42:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 16:42:12,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:12,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:12,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:42:12,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:12,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1771462876, now seen corresponding path program 1 times [2024-11-07 16:42:12,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:12,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788274724] [2024-11-07 16:42:12,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:12,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:12,811 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-07 16:42:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:12,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788274724] [2024-11-07 16:42:12,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788274724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:12,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:12,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:42:12,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502101365] [2024-11-07 16:42:12,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:12,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:42:12,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:12,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:42:12,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:42:12,812 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-07 16:42:12,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:12,928 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2024-11-07 16:42:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:42:12,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-11-07 16:42:12,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:12,929 INFO L225 Difference]: With dead ends: 81 [2024-11-07 16:42:12,929 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 16:42:12,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-07 16:42:12,930 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 101 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:12,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 60 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 16:42:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 16:42:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 79 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2024-11-07 16:42:12,934 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 8 [2024-11-07 16:42:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:12,934 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2024-11-07 16:42:12,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-07 16:42:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2024-11-07 16:42:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 16:42:12,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:12,935 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:12,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:42:12,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:12,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1771462875, now seen corresponding path program 1 times [2024-11-07 16:42:12,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:12,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42428641] [2024-11-07 16:42:12,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:12,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:13,115 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-07 16:42:13,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:13,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42428641] [2024-11-07 16:42:13,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42428641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:13,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:13,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:42:13,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040345544] [2024-11-07 16:42:13,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:13,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:42:13,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:13,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:42:13,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:42:13,116 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-07 16:42:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:13,251 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-11-07 16:42:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:42:13,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-11-07 16:42:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:13,252 INFO L225 Difference]: With dead ends: 87 [2024-11-07 16:42:13,252 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 16:42:13,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-07 16:42:13,253 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:13,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 103 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 16:42:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-07 16:42:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.576271186440678) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-07 16:42:13,263 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 8 [2024-11-07 16:42:13,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:13,264 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-07 16:42:13,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-07 16:42:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-07 16:42:13,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:42:13,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:13,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:13,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:42:13,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:13,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:13,266 INFO L85 PathProgramCache]: Analyzing trace with hash -50514577, now seen corresponding path program 1 times [2024-11-07 16:42:13,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:13,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282411852] [2024-11-07 16:42:13,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:13,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:13,407 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-07 16:42:13,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:13,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282411852] [2024-11-07 16:42:13,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282411852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:13,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:13,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:42:13,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831622595] [2024-11-07 16:42:13,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:13,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:42:13,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:13,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:42:13,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:42:13,409 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-07 16:42:13,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:13,551 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-07 16:42:13,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:42:13,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2024-11-07 16:42:13,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:13,552 INFO L225 Difference]: With dead ends: 86 [2024-11-07 16:42:13,552 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 16:42:13,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:42:13,554 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 40 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:13,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 188 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 16:42:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 16:42:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-11-07 16:42:13,562 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 12 [2024-11-07 16:42:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:13,565 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-11-07 16:42:13,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-07 16:42:13,565 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-11-07 16:42:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:42:13,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:13,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:13,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:42:13,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:13,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:13,566 INFO L85 PathProgramCache]: Analyzing trace with hash -50514576, now seen corresponding path program 1 times [2024-11-07 16:42:13,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:13,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403668787] [2024-11-07 16:42:13,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:13,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:13,746 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-07 16:42:13,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:13,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403668787] [2024-11-07 16:42:13,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403668787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:13,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:13,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:42:13,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700546880] [2024-11-07 16:42:13,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:13,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:42:13,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:13,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:42:13,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:42:13,748 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-07 16:42:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:13,890 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2024-11-07 16:42:13,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:42:13,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2024-11-07 16:42:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:13,897 INFO L225 Difference]: With dead ends: 81 [2024-11-07 16:42:13,897 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 16:42:13,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:42:13,898 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 16 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:13,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 242 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 16:42:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2024-11-07 16:42:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.509433962264151) internal successors, (80), 73 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2024-11-07 16:42:13,901 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 12 [2024-11-07 16:42:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:13,902 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2024-11-07 16:42:13,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-07 16:42:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-11-07 16:42:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:42:13,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:13,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:13,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:42:13,903 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:13,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:13,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1772967450, now seen corresponding path program 1 times [2024-11-07 16:42:13,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:13,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648170134] [2024-11-07 16:42:13,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:13,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:14,231 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-07 16:42:14,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:14,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648170134] [2024-11-07 16:42:14,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648170134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:14,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:14,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:42:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476347078] [2024-11-07 16:42:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:14,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:42:14,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:14,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:42:14,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:42:14,232 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 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-07 16:42:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:14,481 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2024-11-07 16:42:14,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:42:14,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 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 13 [2024-11-07 16:42:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:14,482 INFO L225 Difference]: With dead ends: 132 [2024-11-07 16:42:14,482 INFO L226 Difference]: Without dead ends: 132 [2024-11-07 16:42:14,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:42:14,483 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 219 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:14,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 224 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:42:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-07 16:42:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2024-11-07 16:42:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.5068493150684932) internal successors, (110), 93 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2024-11-07 16:42:14,487 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 13 [2024-11-07 16:42:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:14,487 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2024-11-07 16:42:14,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 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-07 16:42:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2024-11-07 16:42:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:42:14,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:14,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:14,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:42:14,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:14,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1772967451, now seen corresponding path program 1 times [2024-11-07 16:42:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:14,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21030808] [2024-11-07 16:42:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:14,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:14,650 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-07 16:42:14,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:14,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21030808] [2024-11-07 16:42:14,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21030808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:14,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:14,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:42:14,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554562780] [2024-11-07 16:42:14,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:14,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:42:14,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:14,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:42:14,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:42:14,653 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 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-07 16:42:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:14,863 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2024-11-07 16:42:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:42:14,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 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 13 [2024-11-07 16:42:14,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:14,864 INFO L225 Difference]: With dead ends: 123 [2024-11-07 16:42:14,864 INFO L226 Difference]: Without dead ends: 123 [2024-11-07 16:42:14,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:42:14,864 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 221 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:14,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 210 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-07 16:42:14,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 95. [2024-11-07 16:42:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 93 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2024-11-07 16:42:14,873 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 13 [2024-11-07 16:42:14,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:14,874 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2024-11-07 16:42:14,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 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-07 16:42:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2024-11-07 16:42:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 16:42:14,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:14,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:14,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:42:14,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:14,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash 872562296, now seen corresponding path program 1 times [2024-11-07 16:42:14,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:14,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902491190] [2024-11-07 16:42:14,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:14,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:15,023 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-07 16:42:15,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:15,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902491190] [2024-11-07 16:42:15,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902491190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:15,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:15,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:42:15,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976917365] [2024-11-07 16:42:15,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:15,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:42:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:15,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:42:15,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:42:15,024 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:15,211 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2024-11-07 16:42:15,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:42:15,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-07 16:42:15,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:15,212 INFO L225 Difference]: With dead ends: 131 [2024-11-07 16:42:15,212 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 16:42:15,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:42:15,213 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 221 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:15,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 319 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 16:42:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 95. [2024-11-07 16:42:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 93 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2024-11-07 16:42:15,217 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 14 [2024-11-07 16:42:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:15,217 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2024-11-07 16:42:15,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2024-11-07 16:42:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 16:42:15,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:15,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:15,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:42:15,218 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:15,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1034559989, now seen corresponding path program 1 times [2024-11-07 16:42:15,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:15,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960917448] [2024-11-07 16:42:15,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:15,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:15,426 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-07 16:42:15,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:15,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960917448] [2024-11-07 16:42:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960917448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:15,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:15,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:42:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438699866] [2024-11-07 16:42:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:15,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:42:15,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:15,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:42:15,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:42:15,427 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-07 16:42:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:15,665 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2024-11-07 16:42:15,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:42:15,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2024-11-07 16:42:15,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:15,666 INFO L225 Difference]: With dead ends: 128 [2024-11-07 16:42:15,666 INFO L226 Difference]: Without dead ends: 128 [2024-11-07 16:42:15,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:42:15,667 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 209 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:15,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 364 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:42:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-07 16:42:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2024-11-07 16:42:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 93 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2024-11-07 16:42:15,673 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 16 [2024-11-07 16:42:15,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:15,673 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-11-07 16:42:15,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-07 16:42:15,674 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2024-11-07 16:42:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 16:42:15,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:15,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:15,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:42:15,675 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:15,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1034559990, now seen corresponding path program 1 times [2024-11-07 16:42:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:15,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891880223] [2024-11-07 16:42:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:15,985 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-07 16:42:15,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:15,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891880223] [2024-11-07 16:42:15,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891880223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:15,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:15,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:42:15,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893662660] [2024-11-07 16:42:15,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:15,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:42:15,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:15,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:42:15,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:42:15,986 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-07 16:42:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:16,230 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2024-11-07 16:42:16,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:42:16,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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 16 [2024-11-07 16:42:16,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:16,231 INFO L225 Difference]: With dead ends: 127 [2024-11-07 16:42:16,231 INFO L226 Difference]: Without dead ends: 127 [2024-11-07 16:42:16,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:42:16,233 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 154 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:16,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 232 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:42:16,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-07 16:42:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 95. [2024-11-07 16:42:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.452054794520548) internal successors, (106), 93 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-11-07 16:42:16,240 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 16 [2024-11-07 16:42:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:16,240 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-11-07 16:42:16,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-07 16:42:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-11-07 16:42:16,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:42:16,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:16,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:16,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 16:42:16,241 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:16,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:16,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2006573790, now seen corresponding path program 1 times [2024-11-07 16:42:16,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:16,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193581867] [2024-11-07 16:42:16,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:16,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:16,509 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-07 16:42:16,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:16,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193581867] [2024-11-07 16:42:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193581867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:16,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:16,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:42:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434396005] [2024-11-07 16:42:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:16,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:42:16,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:16,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:42:16,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:42:16,511 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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-07 16:42:16,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:16,751 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2024-11-07 16:42:16,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:42:16,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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 17 [2024-11-07 16:42:16,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:16,752 INFO L225 Difference]: With dead ends: 131 [2024-11-07 16:42:16,752 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 16:42:16,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:42:16,752 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 97 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:16,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 248 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:42:16,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 16:42:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 117. [2024-11-07 16:42:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.5052631578947369) internal successors, (143), 115 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2024-11-07 16:42:16,755 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 17 [2024-11-07 16:42:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:16,755 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2024-11-07 16:42:16,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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-07 16:42:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2024-11-07 16:42:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:42:16,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:16,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:16,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 16:42:16,759 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:16,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:16,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2006573789, now seen corresponding path program 1 times [2024-11-07 16:42:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:16,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656857202] [2024-11-07 16:42:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:16,898 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-07 16:42:16,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:16,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656857202] [2024-11-07 16:42:16,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656857202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:16,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:16,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:42:16,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751725196] [2024-11-07 16:42:16,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:16,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:42:16,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:16,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:42:16,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:42:16,900 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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-07 16:42:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:17,102 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2024-11-07 16:42:17,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:42:17,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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 17 [2024-11-07 16:42:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:17,105 INFO L225 Difference]: With dead ends: 129 [2024-11-07 16:42:17,105 INFO L226 Difference]: Without dead ends: 129 [2024-11-07 16:42:17,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:42:17,105 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 205 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:17,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 217 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-07 16:42:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2024-11-07 16:42:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 115 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2024-11-07 16:42:17,110 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 17 [2024-11-07 16:42:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:17,110 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2024-11-07 16:42:17,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 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-07 16:42:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2024-11-07 16:42:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 16:42:17,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:17,111 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:17,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 16:42:17,111 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:17,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:17,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1001820792, now seen corresponding path program 1 times [2024-11-07 16:42:17,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:17,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193295136] [2024-11-07 16:42:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:17,163 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-07 16:42:17,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:17,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193295136] [2024-11-07 16:42:17,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193295136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:17,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:17,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:42:17,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646383268] [2024-11-07 16:42:17,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:17,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:42:17,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:17,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:42:17,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:42:17,165 INFO L87 Difference]: Start difference. First operand 117 states and 145 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:17,241 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2024-11-07 16:42:17,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:42:17,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-07 16:42:17,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:17,242 INFO L225 Difference]: With dead ends: 119 [2024-11-07 16:42:17,242 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 16:42:17,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:42:17,243 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 12 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:17,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 311 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:17,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 16:42:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2024-11-07 16:42:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 114 states have internal predecessors, (141), 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-07 16:42:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2024-11-07 16:42:17,246 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 19 [2024-11-07 16:42:17,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:17,246 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2024-11-07 16:42:17,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:17,247 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2024-11-07 16:42:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-07 16:42:17,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:17,247 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-07 16:42:17,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 16:42:17,247 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:17,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash 485070872, now seen corresponding path program 1 times [2024-11-07 16:42:17,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:17,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431331872] [2024-11-07 16:42:17,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:17,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:17,375 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-07 16:42:17,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431331872] [2024-11-07 16:42:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431331872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:17,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:17,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 16:42:17,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100171185] [2024-11-07 16:42:17,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:17,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:42:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:17,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:42:17,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:42:17,377 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-07 16:42:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:17,491 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2024-11-07 16:42:17,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:42:17,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-07 16:42:17,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:17,492 INFO L225 Difference]: With dead ends: 131 [2024-11-07 16:42:17,492 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 16:42:17,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:42:17,493 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 121 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:17,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 232 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:17,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 16:42:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 117. [2024-11-07 16:42:17,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 115 states have internal predecessors, (142), 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-07 16:42:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2024-11-07 16:42:17,495 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 20 [2024-11-07 16:42:17,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:17,496 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2024-11-07 16:42:17,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-07 16:42:17,496 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2024-11-07 16:42:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:42:17,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:17,497 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, 1, 1] [2024-11-07 16:42:17,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 16:42:17,497 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:17,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash -815615849, now seen corresponding path program 1 times [2024-11-07 16:42:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:17,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841416444] [2024-11-07 16:42:17,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:17,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:17,523 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-07 16:42:17,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:17,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841416444] [2024-11-07 16:42:17,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841416444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:17,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:17,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:42:17,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949656336] [2024-11-07 16:42:17,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:17,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:42:17,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:17,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:42:17,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:42:17,524 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:17,533 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2024-11-07 16:42:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:42:17,534 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-07 16:42:17,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:17,534 INFO L225 Difference]: With dead ends: 120 [2024-11-07 16:42:17,535 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 16:42:17,535 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-07 16:42:17,535 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:17,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:42:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 16:42:17,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 16:42:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 118 states have internal predecessors, (145), 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-07 16:42:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2024-11-07 16:42:17,541 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 22 [2024-11-07 16:42:17,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:17,541 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2024-11-07 16:42:17,541 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2024-11-07 16:42:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 16:42:17,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:17,542 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, 1] [2024-11-07 16:42:17,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 16:42:17,542 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:17,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1273191216, now seen corresponding path program 1 times [2024-11-07 16:42:17,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:17,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510286735] [2024-11-07 16:42:17,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:17,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:17,586 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-07 16:42:17,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:17,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510286735] [2024-11-07 16:42:17,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510286735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:17,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:17,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:42:17,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529603242] [2024-11-07 16:42:17,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:17,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:42:17,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:17,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:42:17,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:42:17,588 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-07 16:42:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:17,671 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2024-11-07 16:42:17,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:42:17,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-07 16:42:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:17,672 INFO L225 Difference]: With dead ends: 119 [2024-11-07 16:42:17,672 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 16:42:17,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:42:17,672 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:17,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 167 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:17,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 16:42:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-07 16:42:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 117 states have internal predecessors, (142), 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-07 16:42:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 144 transitions. [2024-11-07 16:42:17,677 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 144 transitions. Word has length 21 [2024-11-07 16:42:17,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:17,677 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 144 transitions. [2024-11-07 16:42:17,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-07 16:42:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2024-11-07 16:42:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 16:42:17,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:17,679 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, 1] [2024-11-07 16:42:17,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 16:42:17,679 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:17,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:17,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1273191215, now seen corresponding path program 1 times [2024-11-07 16:42:17,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:17,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959912993] [2024-11-07 16:42:17,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:17,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:17,897 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-07 16:42:17,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:17,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959912993] [2024-11-07 16:42:17,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959912993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:17,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:17,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 16:42:17,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784882650] [2024-11-07 16:42:17,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:17,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 16:42:17,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:17,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 16:42:17,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:42:17,899 INFO L87 Difference]: Start difference. First operand 119 states and 144 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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-07 16:42:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:18,147 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2024-11-07 16:42:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 16:42:18,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-07 16:42:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:18,148 INFO L225 Difference]: With dead ends: 133 [2024-11-07 16:42:18,149 INFO L226 Difference]: Without dead ends: 133 [2024-11-07 16:42:18,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-07 16:42:18,149 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 155 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:18,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 385 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:42:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-07 16:42:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2024-11-07 16:42:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 117 states have internal predecessors, (141), 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-07 16:42:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 143 transitions. [2024-11-07 16:42:18,152 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 143 transitions. Word has length 21 [2024-11-07 16:42:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:18,153 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 143 transitions. [2024-11-07 16:42:18,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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-07 16:42:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2024-11-07 16:42:18,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:42:18,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:18,153 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, 1, 1] [2024-11-07 16:42:18,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 16:42:18,153 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:18,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:18,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1998319909, now seen corresponding path program 1 times [2024-11-07 16:42:18,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:18,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193805806] [2024-11-07 16:42:18,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:18,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:18,314 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-07 16:42:18,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:18,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193805806] [2024-11-07 16:42:18,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193805806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:18,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:18,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:42:18,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917981842] [2024-11-07 16:42:18,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:18,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:42:18,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:18,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:42:18,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:42:18,315 INFO L87 Difference]: Start difference. First operand 119 states and 143 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 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-07 16:42:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:18,461 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2024-11-07 16:42:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:42:18,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 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 22 [2024-11-07 16:42:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:18,463 INFO L225 Difference]: With dead ends: 131 [2024-11-07 16:42:18,463 INFO L226 Difference]: Without dead ends: 127 [2024-11-07 16:42:18,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:42:18,463 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 92 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:18,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 312 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-07 16:42:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2024-11-07 16:42:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.422680412371134) internal successors, (138), 115 states have internal predecessors, (138), 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-07 16:42:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2024-11-07 16:42:18,466 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 140 transitions. Word has length 22 [2024-11-07 16:42:18,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:18,466 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 140 transitions. [2024-11-07 16:42:18,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 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-07 16:42:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 140 transitions. [2024-11-07 16:42:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:42:18,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:18,466 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, 1, 1] [2024-11-07 16:42:18,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 16:42:18,466 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:18,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:18,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1996902851, now seen corresponding path program 1 times [2024-11-07 16:42:18,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:18,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118956591] [2024-11-07 16:42:18,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:18,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:18,621 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-07 16:42:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:18,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118956591] [2024-11-07 16:42:18,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118956591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:18,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:18,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 16:42:18,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999313458] [2024-11-07 16:42:18,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:18,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:42:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:18,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:42:18,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:42:18,623 INFO L87 Difference]: Start difference. First operand 117 states and 140 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 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-07 16:42:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:18,763 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2024-11-07 16:42:18,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:42:18,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 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 22 [2024-11-07 16:42:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:18,764 INFO L225 Difference]: With dead ends: 131 [2024-11-07 16:42:18,764 INFO L226 Difference]: Without dead ends: 131 [2024-11-07 16:42:18,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:42:18,765 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 161 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:18,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 293 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:18,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-07 16:42:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2024-11-07 16:42:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 116 states have internal predecessors, (139), 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-07 16:42:18,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2024-11-07 16:42:18,768 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 22 [2024-11-07 16:42:18,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:18,768 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2024-11-07 16:42:18,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 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-07 16:42:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2024-11-07 16:42:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-07 16:42:18,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:18,768 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, 1, 1] [2024-11-07 16:42:18,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 16:42:18,769 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:18,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash 161706573, now seen corresponding path program 1 times [2024-11-07 16:42:18,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:18,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662881440] [2024-11-07 16:42:18,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:18,790 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-07 16:42:18,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:18,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662881440] [2024-11-07 16:42:18,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662881440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:18,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:18,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:42:18,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52030849] [2024-11-07 16:42:18,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:18,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:42:18,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:18,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:42:18,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:42:18,792 INFO L87 Difference]: Start difference. First operand 118 states and 141 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-07 16:42:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:18,802 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2024-11-07 16:42:18,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:42:18,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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 22 [2024-11-07 16:42:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:18,804 INFO L225 Difference]: With dead ends: 132 [2024-11-07 16:42:18,804 INFO L226 Difference]: Without dead ends: 132 [2024-11-07 16:42:18,804 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-07 16:42:18,805 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:18,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:42:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-07 16:42:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2024-11-07 16:42:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 129 states have internal predecessors, (154), 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-07 16:42:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2024-11-07 16:42:18,808 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 22 [2024-11-07 16:42:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:18,808 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2024-11-07 16:42:18,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-07 16:42:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2024-11-07 16:42:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:42:18,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:18,808 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, 1, 1, 1] [2024-11-07 16:42:18,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 16:42:18,809 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:18,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:18,809 INFO L85 PathProgramCache]: Analyzing trace with hash 487921970, now seen corresponding path program 1 times [2024-11-07 16:42:18,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:18,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835333809] [2024-11-07 16:42:18,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:18,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:19,079 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-07 16:42:19,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:19,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835333809] [2024-11-07 16:42:19,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835333809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:42:19,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030283219] [2024-11-07 16:42:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:19,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:42:19,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:42:19,082 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-07 16:42:19,083 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-07 16:42:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:19,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-07 16:42:19,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:42:19,201 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 8 treesize of output 1 [2024-11-07 16:42:19,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:42:19,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:42:19,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 16:42:19,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 16:42:19,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:19,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 16:42:19,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:19,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 16:42:19,661 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:42:19,661 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 30 treesize of output 20 [2024-11-07 16:42:19,668 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 7 treesize of output 3 [2024-11-07 16:42:19,701 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-07 16:42:19,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:42:20,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_452 (Array Int Int))) (or (not (= v_ArrVal_452 (store .cse0 .cse1 (select v_ArrVal_452 .cse1)))) (forall ((v_ArrVal_451 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_44| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 .cse1 v_ArrVal_451)))) (or (< 0 (+ 5 (select (select .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_452) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) |v_ULTIMATE.start_main_~x~0#1.offset_44|))) (< (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_44|) (< |v_ULTIMATE.start_main_~x~0#1.offset_44| 0)))))) (forall ((v_ArrVal_452 (Array Int Int))) (or (not (= v_ArrVal_452 (store .cse0 .cse1 (select v_ArrVal_452 .cse1)))) (forall ((v_ArrVal_451 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_44| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 .cse1 v_ArrVal_451)))) (or (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_452))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (< (+ 7 (select (select .cse4 .cse5) |v_ULTIMATE.start_main_~x~0#1.offset_44|)) (select |c_#length| (select (select .cse6 .cse5) |v_ULTIMATE.start_main_~x~0#1.offset_44|))))) (< (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_44|) (< |v_ULTIMATE.start_main_~x~0#1.offset_44| 0)))))))) is different from false [2024-11-07 16:42:20,445 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse4 (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_451 Int) (v_DerPreprocessor_3 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_44| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_45| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_45| |c_ULTIMATE.start_main_~head~0#1.offset|) (< 0 (+ (select (let ((.cse2 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_45|))) (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse0 .cse1 v_DerPreprocessor_2) .cse2 v_ArrVal_451)) (select (store (store .cse3 .cse1 v_DerPreprocessor_3) .cse2 v_DerPreprocessor_1) |c_ULTIMATE.start_main_~head~0#1.offset|))) |v_ULTIMATE.start_main_~x~0#1.offset_44|) 5)) (< .cse4 |v_ULTIMATE.start_main_~x~0#1.offset_44|) (< |v_ULTIMATE.start_main_~x~0#1.offset_44| 0))) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_ArrVal_452 (Array Int Int)) (v_DerPreprocessor_2 Int)) (let ((.cse5 (+ v_prenex_6 4))) (or (< .cse4 v_prenex_5) (= |c_ULTIMATE.start_main_~head~0#1.offset| v_prenex_6) (< v_prenex_5 0) (let ((.cse6 (select v_ArrVal_452 |c_ULTIMATE.start_main_~head~0#1.offset|))) (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (store .cse0 .cse1 v_DerPreprocessor_2) .cse5 v_prenex_4)) .cse6) v_prenex_5)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_452) .cse6) v_prenex_5)))) (not (= v_ArrVal_452 (store (store .cse3 .cse1 (select v_ArrVal_452 .cse1)) .cse5 (select v_ArrVal_452 .cse5)))) (< v_prenex_6 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_prenex_4 Int) (v_prenex_5 Int) (v_ArrVal_452 (Array Int Int))) (or (< .cse4 v_prenex_5) (let ((.cse7 (select v_ArrVal_452 |c_ULTIMATE.start_main_~head~0#1.offset|))) (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse0 .cse1 v_prenex_4)) .cse7) v_prenex_5)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_452) .cse7) v_prenex_5)))) (not (= v_ArrVal_452 (store .cse3 .cse1 (select v_ArrVal_452 .cse1)))) (< v_prenex_5 0)))))) is different from false [2024-11-07 16:42:20,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:20,474 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:20,479 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 48 treesize of output 42 [2024-11-07 16:42:20,489 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:42:20,489 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 100 treesize of output 94 [2024-11-07 16:42:20,496 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:20,515 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2024-11-07 16:42:20,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 90 treesize of output 87 [2024-11-07 16:42:20,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:20,526 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 45 treesize of output 45 [2024-11-07 16:42:20,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:20,557 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:20,560 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 75 treesize of output 54 [2024-11-07 16:42:20,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 20 treesize of output 18 [2024-11-07 16:42:20,573 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:20,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:20,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:20,580 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:20,589 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-07 16:42:20,589 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 63 treesize of output 1 [2024-11-07 16:42:20,620 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-07 16:42:20,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030283219] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:42:20,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:42:20,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2024-11-07 16:42:20,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810306836] [2024-11-07 16:42:20,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:42:20,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 16:42:20,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:20,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 16:42:20,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=8, NotChecked=98, Total=756 [2024-11-07 16:42:20,621 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 28 states have internal predecessors, (67), 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-07 16:42:21,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:21,590 INFO L93 Difference]: Finished difference Result 167 states and 187 transitions. [2024-11-07 16:42:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:42:21,590 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 28 states have internal predecessors, (67), 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 23 [2024-11-07 16:42:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:21,591 INFO L225 Difference]: With dead ends: 167 [2024-11-07 16:42:21,591 INFO L226 Difference]: Without dead ends: 167 [2024-11-07 16:42:21,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=305, Invalid=1255, Unknown=8, NotChecked=154, Total=1722 [2024-11-07 16:42:21,592 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 347 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 307 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:21,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 572 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 675 Invalid, 0 Unknown, 307 Unchecked, 0.5s Time] [2024-11-07 16:42:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-07 16:42:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2024-11-07 16:42:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 126 states have (on average 1.380952380952381) internal successors, (174), 143 states have internal predecessors, (174), 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-07 16:42:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 176 transitions. [2024-11-07 16:42:21,595 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 176 transitions. Word has length 23 [2024-11-07 16:42:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:21,595 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 176 transitions. [2024-11-07 16:42:21,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 28 states have internal predecessors, (67), 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-07 16:42:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 176 transitions. [2024-11-07 16:42:21,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 16:42:21,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:21,596 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, 1, 1, 1] [2024-11-07 16:42:21,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 16:42:21,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-07 16:42:21,797 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:21,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:21,797 INFO L85 PathProgramCache]: Analyzing trace with hash 487921969, now seen corresponding path program 1 times [2024-11-07 16:42:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:21,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724011192] [2024-11-07 16:42:21,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:21,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:21,850 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-07 16:42:21,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:21,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724011192] [2024-11-07 16:42:21,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724011192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:21,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:21,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:42:21,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911957237] [2024-11-07 16:42:21,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:21,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:42:21,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:21,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:42:21,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:42:21,851 INFO L87 Difference]: Start difference. First operand 145 states and 176 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-07 16:42:21,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:21,976 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2024-11-07 16:42:21,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:42:21,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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 23 [2024-11-07 16:42:21,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:21,978 INFO L225 Difference]: With dead ends: 147 [2024-11-07 16:42:21,978 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 16:42:21,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:42:21,979 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 43 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:21,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 170 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 16:42:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-07 16:42:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 144 states have internal predecessors, (174), 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-07 16:42:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2024-11-07 16:42:21,985 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 23 [2024-11-07 16:42:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:21,985 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2024-11-07 16:42:21,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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-07 16:42:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2024-11-07 16:42:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 16:42:21,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:21,986 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, 1, 1, 1, 1] [2024-11-07 16:42:21,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 16:42:21,986 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:21,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:21,986 INFO L85 PathProgramCache]: Analyzing trace with hash 826748559, now seen corresponding path program 1 times [2024-11-07 16:42:21,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:21,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894150995] [2024-11-07 16:42:21,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:21,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:22,226 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-07 16:42:22,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:22,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894150995] [2024-11-07 16:42:22,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894150995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:42:22,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301476469] [2024-11-07 16:42:22,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:22,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:42:22,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:42:22,229 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-07 16:42:22,231 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-07 16:42:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:22,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-07 16:42:22,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:42:22,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:42:22,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 16:42:22,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 16:42:22,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 16:42:22,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:22,483 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 25 treesize of output 19 [2024-11-07 16:42:22,538 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-07 16:42:22,542 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-07 16:42:22,579 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-07 16:42:22,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:42:22,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301476469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:22,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:42:22,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 20 [2024-11-07 16:42:22,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104543318] [2024-11-07 16:42:22,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:22,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:42:22,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:22,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:42:22,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2024-11-07 16:42:22,583 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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-07 16:42:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:22,782 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2024-11-07 16:42:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 16:42:22,782 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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 24 [2024-11-07 16:42:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:22,783 INFO L225 Difference]: With dead ends: 163 [2024-11-07 16:42:22,783 INFO L226 Difference]: Without dead ends: 156 [2024-11-07 16:42:22,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-07 16:42:22,784 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 147 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:22,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 408 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:22,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-07 16:42:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2024-11-07 16:42:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 127 states have (on average 1.3622047244094488) internal successors, (173), 144 states have internal predecessors, (173), 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-07 16:42:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 175 transitions. [2024-11-07 16:42:22,787 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 175 transitions. Word has length 24 [2024-11-07 16:42:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:22,787 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 175 transitions. [2024-11-07 16:42:22,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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-07 16:42:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 175 transitions. [2024-11-07 16:42:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:42:22,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:22,788 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, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:22,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 16:42:22,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:42:22,988 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:22,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1048871585, now seen corresponding path program 1 times [2024-11-07 16:42:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:22,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504666442] [2024-11-07 16:42:22,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:22,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:23,257 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-07 16:42:23,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:23,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504666442] [2024-11-07 16:42:23,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504666442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:42:23,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:42:23,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 16:42:23,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336115969] [2024-11-07 16:42:23,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:23,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 16:42:23,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:23,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 16:42:23,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:42:23,258 INFO L87 Difference]: Start difference. First operand 146 states and 175 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:23,520 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2024-11-07 16:42:23,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:42:23,521 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-07 16:42:23,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:23,522 INFO L225 Difference]: With dead ends: 155 [2024-11-07 16:42:23,522 INFO L226 Difference]: Without dead ends: 155 [2024-11-07 16:42:23,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-07 16:42:23,522 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 145 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:23,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 444 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-07 16:42:23,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2024-11-07 16:42:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 126 states have (on average 1.3571428571428572) internal successors, (171), 143 states have internal predecessors, (171), 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-07 16:42:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 173 transitions. [2024-11-07 16:42:23,525 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 173 transitions. Word has length 26 [2024-11-07 16:42:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:23,525 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 173 transitions. [2024-11-07 16:42:23,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 173 transitions. [2024-11-07 16:42:23,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:42:23,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:23,526 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:23,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 16:42:23,526 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:23,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:23,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1519517050, now seen corresponding path program 1 times [2024-11-07 16:42:23,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:23,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272760108] [2024-11-07 16:42:23,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:23,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:23,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:23,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272760108] [2024-11-07 16:42:23,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272760108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:42:23,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215616770] [2024-11-07 16:42:23,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:23,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:42:23,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:42:23,788 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-07 16:42:23,789 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-07 16:42:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:23,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-07 16:42:23,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:42:23,874 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-07 16:42:23,896 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:42:23,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:42:23,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-07 16:42:23,936 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 15 treesize of output 1 [2024-11-07 16:42:23,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:42:24,046 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:42:24,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-07 16:42:24,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:24,055 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-07 16:42:24,082 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:42:24,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-07 16:42:24,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:24,092 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-07 16:42:24,129 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:42:24,129 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 50 treesize of output 45 [2024-11-07 16:42:24,134 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-07 16:42:24,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 16:42:24,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-07 16:42:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:24,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:42:24,273 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_630 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-07 16:42:24,319 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_630 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-07 16:42:24,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_630 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_630) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_630) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_629) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-11-07 16:42:24,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:24,345 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 37 treesize of output 38 [2024-11-07 16:42:24,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:24,350 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 29 treesize of output 30 [2024-11-07 16:42:24,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:24,357 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 52 treesize of output 55 [2024-11-07 16:42:24,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:24,368 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 82 treesize of output 81 [2024-11-07 16:42:24,372 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 9 [2024-11-07 16:42:24,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-07 16:42:24,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:24,404 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 20 treesize of output 21 [2024-11-07 16:42:24,406 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:24,408 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-07 16:42:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-07 16:42:24,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215616770] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:42:24,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:42:24,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-11-07 16:42:24,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880089772] [2024-11-07 16:42:24,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:42:24,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 16:42:24,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:24,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 16:42:24,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=482, Unknown=3, NotChecked=138, Total=702 [2024-11-07 16:42:24,497 INFO L87 Difference]: Start difference. First operand 145 states and 173 transitions. Second operand has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 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-07 16:42:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:25,253 INFO L93 Difference]: Finished difference Result 225 states and 263 transitions. [2024-11-07 16:42:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 16:42:25,254 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 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 25 [2024-11-07 16:42:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:25,256 INFO L225 Difference]: With dead ends: 225 [2024-11-07 16:42:25,256 INFO L226 Difference]: Without dead ends: 225 [2024-11-07 16:42:25,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=1001, Unknown=3, NotChecked=204, Total=1406 [2024-11-07 16:42:25,257 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 238 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 451 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:25,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 626 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 981 Invalid, 0 Unknown, 451 Unchecked, 0.4s Time] [2024-11-07 16:42:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-07 16:42:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 182. [2024-11-07 16:42:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 163 states have (on average 1.343558282208589) internal successors, (219), 180 states have internal predecessors, (219), 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-07 16:42:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 221 transitions. [2024-11-07 16:42:25,263 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 221 transitions. Word has length 25 [2024-11-07 16:42:25,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:25,263 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 221 transitions. [2024-11-07 16:42:25,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 27 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-07 16:42:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 221 transitions. [2024-11-07 16:42:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:42:25,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:25,264 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:25,280 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-07 16:42:25,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:42:25,469 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:25,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1519517049, now seen corresponding path program 1 times [2024-11-07 16:42:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:25,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750464915] [2024-11-07 16:42:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:25,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:25,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750464915] [2024-11-07 16:42:25,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750464915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:42:25,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403712546] [2024-11-07 16:42:25,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:25,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:42:25,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:42:25,646 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-07 16:42:25,648 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-07 16:42:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:25,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 16:42:25,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:42:25,737 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-07 16:42:25,764 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-07 16:42:25,765 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-07 16:42:25,787 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 15 treesize of output 1 [2024-11-07 16:42:25,862 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:42:25,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-07 16:42:25,891 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:42:25,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-07 16:42:25,933 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:42:25,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-07 16:42:25,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 16:42:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:26,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:42:26,069 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_716 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_716) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-07 16:42:26,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:26,077 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 20 treesize of output 21 [2024-11-07 16:42:26,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:26,087 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 34 treesize of output 37 [2024-11-07 16:42:26,093 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 5 [2024-11-07 16:42:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:26,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403712546] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:42:26,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:42:26,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-11-07 16:42:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617405639] [2024-11-07 16:42:26,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:42:26,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 16:42:26,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:26,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 16:42:26,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=401, Unknown=16, NotChecked=42, Total=552 [2024-11-07 16:42:26,285 INFO L87 Difference]: Start difference. First operand 182 states and 221 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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-07 16:42:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:26,850 INFO L93 Difference]: Finished difference Result 245 states and 285 transitions. [2024-11-07 16:42:26,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:42:26,850 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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-07 16:42:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:26,851 INFO L225 Difference]: With dead ends: 245 [2024-11-07 16:42:26,851 INFO L226 Difference]: Without dead ends: 245 [2024-11-07 16:42:26,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=835, Unknown=19, NotChecked=62, Total=1122 [2024-11-07 16:42:26,852 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 381 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:26,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 543 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 809 Invalid, 0 Unknown, 180 Unchecked, 0.4s Time] [2024-11-07 16:42:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-07 16:42:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 182. [2024-11-07 16:42:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 163 states have (on average 1.3374233128834356) internal successors, (218), 180 states have internal predecessors, (218), 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-07 16:42:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 220 transitions. [2024-11-07 16:42:26,855 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 220 transitions. Word has length 25 [2024-11-07 16:42:26,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:26,855 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 220 transitions. [2024-11-07 16:42:26,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 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-07 16:42:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 220 transitions. [2024-11-07 16:42:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:42:26,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:26,856 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:26,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 16:42:27,060 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,SelfDestructingSolverStorable26 [2024-11-07 16:42:27,061 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:27,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:27,062 INFO L85 PathProgramCache]: Analyzing trace with hash -139633308, now seen corresponding path program 1 times [2024-11-07 16:42:27,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:27,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075828138] [2024-11-07 16:42:27,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:27,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:27,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:27,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075828138] [2024-11-07 16:42:27,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075828138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:42:27,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279774800] [2024-11-07 16:42:27,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:27,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:42:27,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:42:27,266 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-07 16:42:27,268 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-07 16:42:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:27,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 16:42:27,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:42:27,353 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-07 16:42:27,373 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:42:27,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:42:27,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 16:42:27,400 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 15 treesize of output 1 [2024-11-07 16:42:27,427 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-07 16:42:27,471 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:42:27,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-07 16:42:27,495 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-07 16:42:27,533 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:42:27,533 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 33 treesize of output 32 [2024-11-07 16:42:27,550 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 24 treesize of output 12 [2024-11-07 16:42:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:27,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:42:27,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:27,735 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 19 treesize of output 20 [2024-11-07 16:42:27,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:27,742 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 33 treesize of output 36 [2024-11-07 16:42:27,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-07 16:42:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:27,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279774800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:42:27,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:42:27,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 26 [2024-11-07 16:42:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105263647] [2024-11-07 16:42:27,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:42:27,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 16:42:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 16:42:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=562, Unknown=6, NotChecked=0, Total=650 [2024-11-07 16:42:27,862 INFO L87 Difference]: Start difference. First operand 182 states and 220 transitions. Second operand has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:28,386 INFO L93 Difference]: Finished difference Result 222 states and 259 transitions. [2024-11-07 16:42:28,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 16:42:28,386 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-07 16:42:28,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:28,387 INFO L225 Difference]: With dead ends: 222 [2024-11-07 16:42:28,387 INFO L226 Difference]: Without dead ends: 222 [2024-11-07 16:42:28,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=1022, Unknown=6, NotChecked=0, Total=1190 [2024-11-07 16:42:28,388 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 209 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:28,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 728 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:42:28,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-07 16:42:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 182. [2024-11-07 16:42:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 163 states have (on average 1.3312883435582823) internal successors, (217), 180 states have internal predecessors, (217), 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-07 16:42:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 219 transitions. [2024-11-07 16:42:28,391 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 219 transitions. Word has length 26 [2024-11-07 16:42:28,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:28,391 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 219 transitions. [2024-11-07 16:42:28,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:42:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 219 transitions. [2024-11-07 16:42:28,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 16:42:28,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:28,392 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:28,406 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-07 16:42:28,592 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,SelfDestructingSolverStorable27 [2024-11-07 16:42:28,593 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:28,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:28,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1514135337, now seen corresponding path program 1 times [2024-11-07 16:42:28,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:28,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622838092] [2024-11-07 16:42:28,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:28,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:28,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:28,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622838092] [2024-11-07 16:42:28,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622838092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:42:28,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101855177] [2024-11-07 16:42:28,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:28,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:42:28,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:42:28,795 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-07 16:42:28,796 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-07 16:42:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:28,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-07 16:42:28,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:42:28,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:42:28,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:42:28,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 16:42:28,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 16:42:28,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 16:42:28,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:28,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 16:42:28,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:28,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-07 16:42:29,189 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:42:29,189 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 55 treesize of output 33 [2024-11-07 16:42:29,196 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 7 treesize of output 3 [2024-11-07 16:42:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:29,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:42:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:29,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101855177] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 16:42:29,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:42:29,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 14] total 27 [2024-11-07 16:42:29,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432182504] [2024-11-07 16:42:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:42:29,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 16:42:29,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:29,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 16:42:29,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2024-11-07 16:42:29,376 INFO L87 Difference]: Start difference. First operand 182 states and 219 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-07 16:42:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:29,484 INFO L93 Difference]: Finished difference Result 206 states and 247 transitions. [2024-11-07 16:42:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 16:42:29,484 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 26 [2024-11-07 16:42:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:29,485 INFO L225 Difference]: With dead ends: 206 [2024-11-07 16:42:29,485 INFO L226 Difference]: Without dead ends: 206 [2024-11-07 16:42:29,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2024-11-07 16:42:29,486 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:29,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 310 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:42:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-07 16:42:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 201. [2024-11-07 16:42:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 182 states have (on average 1.3186813186813187) internal successors, (240), 199 states have internal predecessors, (240), 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-07 16:42:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 242 transitions. [2024-11-07 16:42:29,488 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 242 transitions. Word has length 26 [2024-11-07 16:42:29,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:29,489 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 242 transitions. [2024-11-07 16:42:29,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-07 16:42:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 242 transitions. [2024-11-07 16:42:29,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:42:29,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:29,489 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:29,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-07 16:42:29,689 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,SelfDestructingSolverStorable28 [2024-11-07 16:42:29,690 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:29,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:29,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1022806559, now seen corresponding path program 1 times [2024-11-07 16:42:29,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:29,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765471670] [2024-11-07 16:42:29,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:29,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:29,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:29,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765471670] [2024-11-07 16:42:29,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765471670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:42:29,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523989579] [2024-11-07 16:42:29,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:29,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:42:29,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:42:29,972 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-07 16:42:29,974 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-07 16:42:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:30,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-07 16:42:30,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:42:30,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-07 16:42:30,092 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:42:30,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:42:30,117 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 15 treesize of output 1 [2024-11-07 16:42:30,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 16:42:30,205 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-07 16:42:30,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2024-11-07 16:42:30,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:30,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-07 16:42:30,275 INFO L349 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2024-11-07 16:42:30,276 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 25 [2024-11-07 16:42:30,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-07 16:42:30,359 INFO L349 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2024-11-07 16:42:30,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 48 [2024-11-07 16:42:30,366 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-07 16:42:30,401 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 22 treesize of output 10 [2024-11-07 16:42:30,507 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-07 16:42:30,507 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 31 treesize of output 14 [2024-11-07 16:42:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:30,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:42:30,588 INFO L349 Elim1Store]: treesize reduction 5, result has 68.8 percent of original size [2024-11-07 16:42:30,588 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 20 treesize of output 19 [2024-11-07 16:42:30,638 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_941 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_68| Int) (v_ArrVal_940 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_68|) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_940))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) |v_ULTIMATE.start_main_~x~0#1.offset_68|) |c_ULTIMATE.start_main_~head~0#1.base|) (not (= v_ArrVal_940 (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 (select v_ArrVal_940 .cse1))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_68| 0))) is different from false [2024-11-07 16:42:30,777 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_940 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_68| Int)) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_940))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) |v_ULTIMATE.start_main_~x~0#1.offset_68|) |c_ULTIMATE.start_main_~head~0#1.base|) (not (= v_ArrVal_940 (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_69|))) (store (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.base|) .cse1 (select v_ArrVal_940 .cse1))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_69| 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_68|) (< |c_ULTIMATE.start_main_#t~mem4#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_69|) (< |v_ULTIMATE.start_main_~x~0#1.offset_68| 0))) is different from false [2024-11-07 16:42:30,799 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_941 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_68| Int) (v_ArrVal_940 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_ArrVal_940 (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_69|))) (store (store (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~head~0#1.base|) .cse1 (select v_ArrVal_940 .cse1))))) (= (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_940))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) |v_ULTIMATE.start_main_~x~0#1.offset_68|) |c_ULTIMATE.start_main_~head~0#1.base|) (< |v_ULTIMATE.start_main_~x~0#1.offset_69| 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_68| 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_941) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_68|) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_69|)))) is different from false [2024-11-07 16:42:30,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:30,831 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 18 treesize of output 19 [2024-11-07 16:42:30,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:30,837 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 60 treesize of output 44 [2024-11-07 16:42:30,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:30,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 30 treesize of output 33 [2024-11-07 16:42:30,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:30,897 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 109 treesize of output 185 [2024-11-07 16:42:30,925 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 9 [2024-11-07 16:42:30,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-07 16:42:31,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-07 16:42:31,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-07 16:42:31,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:31,223 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 53 treesize of output 57 [2024-11-07 16:42:31,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-07 16:42:31,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-07 16:42:31,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:31,634 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 16 treesize of output 20 [2024-11-07 16:42:31,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-07 16:42:31,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-07 16:42:31,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-07 16:42:31,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-07 16:42:31,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:31,889 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 12 treesize of output 16 [2024-11-07 16:42:31,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-07 16:42:32,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:32,821 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 153 treesize of output 155 [2024-11-07 16:42:32,881 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 52 treesize of output 50 [2024-11-07 16:42:32,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:32,910 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 439 treesize of output 435 [2024-11-07 16:42:33,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-07 16:42:33,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:33,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2024-11-07 16:42:33,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:33,344 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 301 treesize of output 307 [2024-11-07 16:42:33,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:33,544 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:33,545 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:33,547 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-07 16:42:33,690 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:33,691 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:33,691 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:33,691 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:33,693 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-07 16:42:33,695 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:33,696 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:33,696 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:33,696 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:33,702 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-07 16:42:33,706 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:33,706 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:33,708 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-07 16:42:34,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:34,041 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 3174 treesize of output 2996 [2024-11-07 16:42:34,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:34,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:34,611 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:34,612 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-07 16:42:34,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:34,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:34,689 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 135 [2024-11-07 16:42:34,750 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:34,751 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:34,752 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-07 16:42:34,765 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-07 16:42:34,766 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 131 treesize of output 122 [2024-11-07 16:42:34,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:34,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-07 16:42:35,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-07 16:42:35,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523989579] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:42:35,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:42:35,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2024-11-07 16:42:35,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825010019] [2024-11-07 16:42:35,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:42:35,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-07 16:42:35,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:35,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-07 16:42:35,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=678, Unknown=4, NotChecked=162, Total=930 [2024-11-07 16:42:35,342 INFO L87 Difference]: Start difference. First operand 201 states and 242 transitions. Second operand has 31 states, 30 states have (on average 2.566666666666667) internal successors, (77), 31 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-07 16:42:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:42:36,197 INFO L93 Difference]: Finished difference Result 241 states and 284 transitions. [2024-11-07 16:42:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:42:36,197 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.566666666666667) internal successors, (77), 31 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 28 [2024-11-07 16:42:36,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:42:36,198 INFO L225 Difference]: With dead ends: 241 [2024-11-07 16:42:36,198 INFO L226 Difference]: Without dead ends: 241 [2024-11-07 16:42:36,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=1365, Unknown=4, NotChecked=234, Total=1806 [2024-11-07 16:42:36,199 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 301 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 416 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:42:36,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 947 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1028 Invalid, 0 Unknown, 416 Unchecked, 0.5s Time] [2024-11-07 16:42:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-07 16:42:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 201. [2024-11-07 16:42:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 199 states have internal predecessors, (239), 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-07 16:42:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 241 transitions. [2024-11-07 16:42:36,203 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 241 transitions. Word has length 28 [2024-11-07 16:42:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:42:36,203 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 241 transitions. [2024-11-07 16:42:36,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.566666666666667) internal successors, (77), 31 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-07 16:42:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 241 transitions. [2024-11-07 16:42:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:42:36,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:42:36,204 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:42:36,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 16:42:36,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:42:36,408 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:42:36,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:42:36,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1022806558, now seen corresponding path program 1 times [2024-11-07 16:42:36,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:42:36,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971358327] [2024-11-07 16:42:36,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:36,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:42:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:36,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:42:36,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971358327] [2024-11-07 16:42:36,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971358327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:42:36,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546650027] [2024-11-07 16:42:36,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:42:36,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:42:36,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:42:36,795 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-07 16:42:36,796 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-07 16:42:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:42:36,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-07 16:42:36,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:42:36,906 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-07 16:42:36,912 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 8 treesize of output 1 [2024-11-07 16:42:36,960 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:42:36,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:42:36,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-07 16:42:36,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:42:36,991 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 15 treesize of output 1 [2024-11-07 16:42:37,069 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-07 16:42:37,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2024-11-07 16:42:37,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:37,079 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 19 treesize of output 18 [2024-11-07 16:42:37,128 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 16:42:37,128 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-07 16:42:37,144 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 30 treesize of output 21 [2024-11-07 16:42:37,228 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 16:42:37,229 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 1 case distinctions, treesize of input 85 treesize of output 58 [2024-11-07 16:42:37,232 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 46 treesize of output 25 [2024-11-07 16:42:37,385 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 16:42:37,385 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 42 treesize of output 21 [2024-11-07 16:42:37,389 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 15 treesize of output 7 [2024-11-07 16:42:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:42:37,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:42:37,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (or (not (= v_ArrVal_1033 (store .cse0 .cse1 (select v_ArrVal_1033 .cse1)))) (forall ((v_ArrVal_1034 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 .cse1 v_ArrVal_1034)))) (or (< (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0) (< 0 (+ (select (select .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) |v_ULTIMATE.start_main_~x~0#1.offset_74|) 5))))))) (forall ((v_ArrVal_1033 (Array Int Int))) (or (not (= v_ArrVal_1033 (store .cse0 .cse1 (select v_ArrVal_1033 .cse1)))) (forall ((v_ArrVal_1034 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 .cse1 v_ArrVal_1034)))) (or (< (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1033))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (< (+ 7 (select (select .cse4 .cse5) |v_ULTIMATE.start_main_~x~0#1.offset_74|)) (select |c_#length| (select (select .cse6 .cse5) |v_ULTIMATE.start_main_~x~0#1.offset_74|))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0)))))))) is different from false [2024-11-07 16:42:37,739 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (v_prenex_347 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse5 .cse4 v_prenex_346)))) (or (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_347))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (< (+ 7 (select (select .cse0 .cse1) v_prenex_348)) (select |c_#length| (select (select .cse2 .cse1) v_prenex_348))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_prenex_348) (< v_prenex_348 0) (not (= (store .cse3 .cse4 (select v_prenex_347 .cse4)) v_prenex_347))))) (forall ((v_ArrVal_1034 Int) (v_ArrVal_1033 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse5 .cse4 v_ArrVal_1034)))) (or (not (= v_ArrVal_1033 (store .cse3 .cse4 (select v_ArrVal_1033 .cse4)))) (< (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0) (< 0 (+ (select (select .cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) |v_ULTIMATE.start_main_~x~0#1.offset_74|) 5))))))) is different from false [2024-11-07 16:42:38,083 INFO L349 Elim1Store]: treesize reduction 4, result has 84.6 percent of original size [2024-11-07 16:42:38,083 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 4961 treesize of output 4799 [2024-11-07 16:42:38,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:38,119 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 394 treesize of output 282 [2024-11-07 16:42:38,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:38,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 454 treesize of output 446 [2024-11-07 16:42:38,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-07 16:42:39,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-07 16:42:39,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 6 treesize of output 4 [2024-11-07 16:42:39,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:42:39,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:39,882 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 2377 treesize of output 2333 [2024-11-07 16:42:39,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:39,925 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 408 treesize of output 272 [2024-11-07 16:42:39,994 INFO L349 Elim1Store]: treesize reduction 36, result has 59.6 percent of original size [2024-11-07 16:42:39,995 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 778 treesize of output 738 [2024-11-07 16:42:40,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-07 16:42:40,350 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 279 treesize of output 275 [2024-11-07 16:42:40,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-07 16:42:40,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-07 16:42:40,500 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:42:40,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:42:40,511 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 75 treesize of output 77 [2024-11-07 16:42:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-07 16:42:40,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546650027] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:42:40,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:42:40,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 36 [2024-11-07 16:42:40,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447216486] [2024-11-07 16:42:40,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:42:40,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-07 16:42:40,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:42:40,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-07 16:42:40,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1075, Unknown=3, NotChecked=134, Total=1332 [2024-11-07 16:42:40,976 INFO L87 Difference]: Start difference. First operand 201 states and 241 transitions. Second operand has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 37 states have internal predecessors, (82), 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-07 16:42:51,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:42:55,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:43:03,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:43:10,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:43:15,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:43:16,552 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |c_#length| |c_ULTIMATE.start_main_~head~0#1.base|) 8) (or (let ((.cse1 (store (select |c_#memory_$Pointer$#1.base| .cse5) .cse8 |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse6 (store (select |c_#memory_$Pointer$#1.offset| .cse5) .cse8 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse2 (+ .cse8 4))) (and (forall ((v_prenex_348 Int) (v_prenex_346 Int) (v_prenex_347 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse5 (store .cse6 .cse2 v_prenex_346)))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_prenex_348) (not (= v_prenex_347 (store .cse1 .cse2 (select v_prenex_347 .cse2)))) (< v_prenex_348 0) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_prenex_347))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (< (+ (select (select .cse0 .cse3) v_prenex_348) 7) (select |c_#length| (select (select .cse4 .cse3) v_prenex_348)))))))) (forall ((v_ArrVal_1034 Int) (v_ArrVal_1033 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_74| Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse5 (store .cse6 .cse2 v_ArrVal_1034)))) (or (not (= (store .cse1 .cse2 (select v_ArrVal_1033 .cse2)) v_ArrVal_1033)) (< 0 (+ 5 (select (select .cse7 (select (select (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_1033) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) |v_ULTIMATE.start_main_~x~0#1.offset_74|))) (< (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_74|) (< |v_ULTIMATE.start_main_~x~0#1.offset_74| 0)))))) (< .cse8 0)) (= .cse8 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= 8 (select |c_#length| .cse5)))) is different from false [2024-11-07 16:43:20,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:43:26,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:43:28,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:43:30,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:43:34,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-07 16:43:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:43:36,802 INFO L93 Difference]: Finished difference Result 254 states and 290 transitions. [2024-11-07 16:43:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:43:36,804 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 37 states have internal predecessors, (82), 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-07 16:43:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:43:36,805 INFO L225 Difference]: With dead ends: 254 [2024-11-07 16:43:36,805 INFO L226 Difference]: Without dead ends: 254 [2024-11-07 16:43:36,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=347, Invalid=2195, Unknown=20, NotChecked=300, Total=2862 [2024-11-07 16:43:36,806 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 274 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 30 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 368 IncrementalHoareTripleChecker+Unchecked, 40.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:43:36,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1069 Invalid, 1737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1325 Invalid, 14 Unknown, 368 Unchecked, 40.3s Time] [2024-11-07 16:43:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-07 16:43:36,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 201. [2024-11-07 16:43:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 199 states have internal predecessors, (238), 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-07 16:43:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 240 transitions. [2024-11-07 16:43:36,809 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 240 transitions. Word has length 28 [2024-11-07 16:43:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:43:36,809 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 240 transitions. [2024-11-07 16:43:36,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 37 states have internal predecessors, (82), 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-07 16:43:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 240 transitions. [2024-11-07 16:43:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 16:43:36,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:43:36,809 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:43:36,823 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-07 16:43:37,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:43:37,010 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-07 16:43:37,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:43:37,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1642247054, now seen corresponding path program 1 times [2024-11-07 16:43:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:43:37,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558480850] [2024-11-07 16:43:37,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:43:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:43:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:43:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:43:37,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:43:37,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558480850] [2024-11-07 16:43:37,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558480850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:43:37,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439687953] [2024-11-07 16:43:37,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:43:37,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:43:37,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:43:37,321 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-07 16:43:37,322 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-07 16:43:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:43:37,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-07 16:43:37,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:43:37,421 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-07 16:43:37,495 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 8 treesize of output 1 [2024-11-07 16:43:37,510 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:43:37,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-07 16:43:37,563 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 15 treesize of output 1 [2024-11-07 16:43:37,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:43:37,741 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-07 16:43:37,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-07 16:43:37,762 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:43:37,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-07 16:43:37,857 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-07 16:43:37,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-07 16:43:37,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:43:37,870 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 30 treesize of output 21 [2024-11-07 16:43:37,961 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 16:43:37,962 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 72 treesize of output 63 [2024-11-07 16:43:37,969 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 46 treesize of output 25 [2024-11-07 16:43:38,176 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 36 treesize of output 20 [2024-11-07 16:43:38,180 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 15 treesize of output 7 [2024-11-07 16:43:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:43:38,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:43:38,415 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1125 Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_1125)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (< (+ 7 .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1126) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (< (+ .cse0 4) 0)))) is different from false [2024-11-07 16:43:38,707 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 4147 treesize of output 4083 [2024-11-07 16:43:38,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:43:38,748 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 437 treesize of output 349 [2024-11-07 16:43:38,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:43:38,765 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 541 treesize of output 500 [2024-11-07 16:43:38,782 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 315 treesize of output 291 [2024-11-07 16:43:39,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:43:39,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 250 treesize of output 519