./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-memleak_nexttime.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/memsafety/test-memleak_nexttime.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', '0176377c3fa036d8b42b70bf41d842353f196a854b997aa0bf5f176a7ad1942b'] 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/memsafety/test-memleak_nexttime.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 0176377c3fa036d8b42b70bf41d842353f196a854b997aa0bf5f176a7ad1942b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:28:20,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:28:20,363 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:28:20,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:28:20,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:28:20,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:28:20,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:28:20,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:28:20,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:28:20,395 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:28:20,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:28:20,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:28:20,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:28:20,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:28:20,396 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:28:20,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:28:20,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:28:20,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:28:20,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:28:20,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:28:20,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:28:20,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:28:20,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:28:20,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:28:20,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:28:20,398 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 -> 0176377c3fa036d8b42b70bf41d842353f196a854b997aa0bf5f176a7ad1942b [2024-11-07 16:28:20,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:28:20,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:28:20,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:28:20,637 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:28:20,638 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:28:20,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2024-11-07 16:28:21,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:28:22,110 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:28:22,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2024-11-07 16:28:22,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab997f25f/a13081be2b154cacaa9df4538f324f4e/FLAGc461a168f [2024-11-07 16:28:22,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab997f25f/a13081be2b154cacaa9df4538f324f4e [2024-11-07 16:28:22,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:28:22,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:28:22,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:28:22,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:28:22,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:28:22,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:28:22" (1/1) ... [2024-11-07 16:28:22,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3586e7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:22, skipping insertion in model container [2024-11-07 16:28:22,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:28:22" (1/1) ... [2024-11-07 16:28:22,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:28:22,392 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:28:22,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:28:22,404 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:28:22,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:28:22,469 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:28:22,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:22 WrapperNode [2024-11-07 16:28:22,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:28:22,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:28:22,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:28:22,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:28:22,475 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:28:22" (1/1) ... [2024-11-07 16:28:22,487 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:28:22" (1/1) ... [2024-11-07 16:28:22,500 INFO L138 Inliner]: procedures = 181, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2024-11-07 16:28:22,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:28:22,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:28:22,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:28:22,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:28:22,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:22" (1/1) ... [2024-11-07 16:28:22,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:22" (1/1) ... [2024-11-07 16:28:22,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:22" (1/1) ... [2024-11-07 16:28:22,527 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 2 writes are split as follows [0, 2]. [2024-11-07 16:28:22,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:22" (1/1) ... [2024-11-07 16:28:22,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:22" (1/1) ... [2024-11-07 16:28:22,536 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:22" (1/1) ... [2024-11-07 16:28:22,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:22" (1/1) ... [2024-11-07 16:28:22,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:22" (1/1) ... [2024-11-07 16:28:22,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:22" (1/1) ... [2024-11-07 16:28:22,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:28:22,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:28:22,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:28:22,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:28:22,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:22" (1/1) ... [2024-11-07 16:28:22,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:28:22,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:28:22,577 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:28:22,579 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:28:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-07 16:28:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-07 16:28:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-11-07 16:28:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-11-07 16:28:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-07 16:28:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-07 16:28:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-11-07 16:28:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-11-07 16:28:22,597 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-11-07 16:28:22,597 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-11-07 16:28:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:28:22,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:28:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:28:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:28:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:28:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:28:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 16:28:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 16:28:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:28:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:28:22,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-11-07 16:28:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-11-07 16:28:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:28:22,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:28:22,680 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:28:22,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:28:22,683 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 16:28:22,716 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 16:28:22,821 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-07 16:28:22,821 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:28:22,830 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:28:22,830 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 16:28:22,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:28:22 BoogieIcfgContainer [2024-11-07 16:28:22,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:28:22,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:28:22,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:28:22,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:28:22,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:28:22" (1/3) ... [2024-11-07 16:28:22,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a8f71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:28:22, skipping insertion in model container [2024-11-07 16:28:22,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:22" (2/3) ... [2024-11-07 16:28:22,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a8f71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:28:22, skipping insertion in model container [2024-11-07 16:28:22,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:28:22" (3/3) ... [2024-11-07 16:28:22,837 INFO L112 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime.i [2024-11-07 16:28:22,846 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:28:22,846 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-07 16:28:22,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:28:22,875 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;@679e5306, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:28:22,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-07 16:28:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:28:22,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:22,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:28:22,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:22,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash 59647, now seen corresponding path program 1 times [2024-11-07 16:28:22,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:22,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141026237] [2024-11-07 16:28:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:22,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:23,122 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:28:23,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:23,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141026237] [2024-11-07 16:28:23,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141026237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:23,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:23,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 16:28:23,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215281635] [2024-11-07 16:28:23,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:23,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:28:23,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:23,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:28:23,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:28:23,151 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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:28:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:23,203 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-11-07 16:28:23,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:28:23,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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:28:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:23,209 INFO L225 Difference]: With dead ends: 39 [2024-11-07 16:28:23,209 INFO L226 Difference]: Without dead ends: 37 [2024-11-07 16:28:23,211 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:28:23,212 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:23,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-07 16:28:23,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-07 16:28:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-07 16:28:23,241 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 3 [2024-11-07 16:28:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:23,241 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-07 16:28:23,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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:28:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-07 16:28:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:28:23,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:23,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:28:23,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:28:23,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:23,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:23,243 INFO L85 PathProgramCache]: Analyzing trace with hash 59648, now seen corresponding path program 1 times [2024-11-07 16:28:23,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:23,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311622483] [2024-11-07 16:28:23,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:23,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:23,332 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:28:23,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:23,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311622483] [2024-11-07 16:28:23,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311622483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:23,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:23,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:28:23,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511412360] [2024-11-07 16:28:23,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:23,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:28:23,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:23,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:28:23,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:28:23,333 INFO L87 Difference]: Start difference. First operand 37 states and 40 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:28:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:23,359 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-07 16:28:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:28:23,360 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:28:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:23,360 INFO L225 Difference]: With dead ends: 36 [2024-11-07 16:28:23,361 INFO L226 Difference]: Without dead ends: 36 [2024-11-07 16:28:23,361 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:28:23,362 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:23,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-07 16:28:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-07 16:28:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-07 16:28:23,367 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 3 [2024-11-07 16:28:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:23,367 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-07 16:28:23,367 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:28:23,367 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-07 16:28:23,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:28:23,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:23,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:28:23,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:28:23,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:23,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:23,369 INFO L85 PathProgramCache]: Analyzing trace with hash 59649, now seen corresponding path program 1 times [2024-11-07 16:28:23,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:23,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324882439] [2024-11-07 16:28:23,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:23,549 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:28:23,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:23,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324882439] [2024-11-07 16:28:23,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324882439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:23,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:23,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:28:23,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42516900] [2024-11-07 16:28:23,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:23,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:28:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:23,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:28:23,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:28:23,552 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 4 states, 3 states have (on average 1.0) 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:28:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:23,590 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-07 16:28:23,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:28:23,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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:28:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:23,591 INFO L225 Difference]: With dead ends: 35 [2024-11-07 16:28:23,591 INFO L226 Difference]: Without dead ends: 35 [2024-11-07 16:28:23,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:28:23,592 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:23,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 42 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:23,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-07 16:28:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-07 16:28:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-07 16:28:23,598 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 3 [2024-11-07 16:28:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:23,599 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-07 16:28:23,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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:28:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-07 16:28:23,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:28:23,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:23,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:28:23,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:28:23,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:23,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:23,603 INFO L85 PathProgramCache]: Analyzing trace with hash 59650, now seen corresponding path program 1 times [2024-11-07 16:28:23,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:23,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57990501] [2024-11-07 16:28:23,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:23,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:23,687 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:28:23,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:23,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57990501] [2024-11-07 16:28:23,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57990501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:23,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:23,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:28:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016653063] [2024-11-07 16:28:23,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:23,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:28:23,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:23,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:28:23,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:28:23,689 INFO L87 Difference]: Start difference. First operand 35 states and 38 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:28:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:23,706 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-07 16:28:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:28:23,706 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:28:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:23,707 INFO L225 Difference]: With dead ends: 34 [2024-11-07 16:28:23,707 INFO L226 Difference]: Without dead ends: 34 [2024-11-07 16:28:23,708 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:28:23,708 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 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:28:23,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-07 16:28:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-07 16:28:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-07 16:28:23,714 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 3 [2024-11-07 16:28:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:23,714 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-07 16:28:23,714 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:28:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-07 16:28:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:28:23,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:23,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:23,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:28:23,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:23,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:23,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1537300967, now seen corresponding path program 1 times [2024-11-07 16:28:23,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:23,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144433669] [2024-11-07 16:28:23,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:23,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:28:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:23,791 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:28:23,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:23,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144433669] [2024-11-07 16:28:23,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144433669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:23,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:23,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:28:23,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232205961] [2024-11-07 16:28:23,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:23,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:28:23,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:23,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:28:23,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:28:23,794 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:23,838 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-07 16:28:23,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:28:23,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-07 16:28:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:23,841 INFO L225 Difference]: With dead ends: 40 [2024-11-07 16:28:23,841 INFO L226 Difference]: Without dead ends: 40 [2024-11-07 16:28:23,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:28:23,842 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:23,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 38 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:23,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-07 16:28:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2024-11-07 16:28:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-07 16:28:23,848 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2024-11-07 16:28:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:23,848 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-07 16:28:23,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-07 16:28:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:28:23,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:23,849 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:23,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:28:23,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:23,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:23,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1537300966, now seen corresponding path program 1 times [2024-11-07 16:28:23,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:23,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840389274] [2024-11-07 16:28:23,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:23,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:23,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:28:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:23,957 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:28:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:23,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840389274] [2024-11-07 16:28:23,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840389274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:23,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:23,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:28:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349318049] [2024-11-07 16:28:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:23,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:28:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:23,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:28:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:28:23,959 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:24,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:24,022 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-11-07 16:28:24,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:28:24,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-07 16:28:24,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:24,023 INFO L225 Difference]: With dead ends: 46 [2024-11-07 16:28:24,023 INFO L226 Difference]: Without dead ends: 34 [2024-11-07 16:28:24,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:28:24,024 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:24,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 85 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-07 16:28:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-07 16:28:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.434782608695652) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-07 16:28:24,026 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 12 [2024-11-07 16:28:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:24,027 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-07 16:28:24,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-07 16:28:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:28:24,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:24,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:24,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:28:24,027 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:24,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:24,028 INFO L85 PathProgramCache]: Analyzing trace with hash -703749271, now seen corresponding path program 1 times [2024-11-07 16:28:24,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:24,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256164728] [2024-11-07 16:28:24,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:24,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:24,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:28:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:24,166 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:28:24,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:24,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256164728] [2024-11-07 16:28:24,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256164728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:28:24,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165346740] [2024-11-07 16:28:24,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:24,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:28:24,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:28:24,170 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:28:24,171 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:28:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:24,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:28:24,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:24,274 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:28:24,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:28:24,333 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:28:24,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165346740] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 16:28:24,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:28:24,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 10 [2024-11-07 16:28:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313092295] [2024-11-07 16:28:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:24,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:28:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:24,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:28:24,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:28:24,335 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:24,360 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-07 16:28:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:28:24,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-07 16:28:24,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:24,361 INFO L225 Difference]: With dead ends: 36 [2024-11-07 16:28:24,361 INFO L226 Difference]: Without dead ends: 36 [2024-11-07 16:28:24,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:28:24,362 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:24,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 57 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-07 16:28:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-07 16:28:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-07 16:28:24,364 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 13 [2024-11-07 16:28:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:24,364 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-07 16:28:24,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-07 16:28:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 16:28:24,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:24,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:24,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 16:28:24,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:28:24,568 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:24,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:24,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2107217596, now seen corresponding path program 1 times [2024-11-07 16:28:24,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:24,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833153096] [2024-11-07 16:28:24,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:24,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:24,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:28:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:28:24,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:24,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833153096] [2024-11-07 16:28:24,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833153096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:28:24,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967987634] [2024-11-07 16:28:24,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:24,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:28:24,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:28:24,775 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:28:24,777 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:28:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:24,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 16:28:24,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:24,925 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:28:24,925 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:28:25,019 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:28:25,041 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-07 16:28:25,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-07 16:28:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:28:25,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:28:25,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967987634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:25,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 16:28:25,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2024-11-07 16:28:25,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967959117] [2024-11-07 16:28:25,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:25,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:28:25,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:25,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:28:25,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:28:25,060 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:25,113 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-07 16:28:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:28:25,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-07 16:28:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:25,113 INFO L225 Difference]: With dead ends: 35 [2024-11-07 16:28:25,113 INFO L226 Difference]: Without dead ends: 35 [2024-11-07 16:28:25,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:28:25,114 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:25,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-07 16:28:25,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-07 16:28:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.36) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:25,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-07 16:28:25,116 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 14 [2024-11-07 16:28:25,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:25,117 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-07 16:28:25,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-07 16:28:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 16:28:25,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:25,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:25,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 16:28:25,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:28:25,323 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:25,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:25,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2107217597, now seen corresponding path program 1 times [2024-11-07 16:28:25,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:25,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388085044] [2024-11-07 16:28:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:25,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:28:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:28:25,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:25,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388085044] [2024-11-07 16:28:25,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388085044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:25,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:25,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:28:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936552010] [2024-11-07 16:28:25,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:25,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:28:25,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:25,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:28:25,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:28:25,411 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:25,428 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-07 16:28:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:28:25,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-07 16:28:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:25,429 INFO L225 Difference]: With dead ends: 33 [2024-11-07 16:28:25,429 INFO L226 Difference]: Without dead ends: 33 [2024-11-07 16:28:25,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:28:25,429 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:25,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:25,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-07 16:28:25,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-07 16:28:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.28) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-07 16:28:25,433 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 14 [2024-11-07 16:28:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:25,433 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-07 16:28:25,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:25,433 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-07 16:28:25,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 16:28:25,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:25,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:25,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:28:25,434 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:25,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2107217598, now seen corresponding path program 1 times [2024-11-07 16:28:25,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:25,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829766988] [2024-11-07 16:28:25,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:25,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:25,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:28:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:28:25,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:25,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829766988] [2024-11-07 16:28:25,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829766988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:25,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:25,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:28:25,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639868387] [2024-11-07 16:28:25,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:25,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:28:25,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:25,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:28:25,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:28:25,620 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:25,685 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-07 16:28:25,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:28:25,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-07 16:28:25,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:25,686 INFO L225 Difference]: With dead ends: 32 [2024-11-07 16:28:25,686 INFO L226 Difference]: Without dead ends: 32 [2024-11-07 16:28:25,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-07 16:28:25,687 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 60 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:25,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 31 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:25,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-07 16:28:25,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-07 16:28:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-07 16:28:25,689 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 14 [2024-11-07 16:28:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:25,689 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-07 16:28:25,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-07 16:28:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 16:28:25,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:25,691 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:25,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 16:28:25,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:25,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:25,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1777376532, now seen corresponding path program 1 times [2024-11-07 16:28:25,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:25,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353759624] [2024-11-07 16:28:25,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:25,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:25,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:28:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:25,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 16:28:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 16:28:25,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353759624] [2024-11-07 16:28:25,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353759624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:28:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353040024] [2024-11-07 16:28:25,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:25,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:28:25,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:28:25,918 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:28:25,923 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:28:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:26,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-07 16:28:26,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:26,044 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:28:26,044 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:28:26,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:26,304 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 21 treesize of output 21 [2024-11-07 16:28:26,320 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 7 [2024-11-07 16:28:26,426 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:28:26,590 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:28:26,591 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:28:26,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:26,948 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-07 16:28:26,948 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 1 case distinctions, treesize of input 28 treesize of output 35 [2024-11-07 16:28:26,962 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 7 [2024-11-07 16:28:27,027 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:28:27,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-07 16:28:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:28:27,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:28:27,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353040024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:28:27,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:28:27,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16] total 22 [2024-11-07 16:28:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020515172] [2024-11-07 16:28:27,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:28:27,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 16:28:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:27,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 16:28:27,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=488, Unknown=6, NotChecked=0, Total=552 [2024-11-07 16:28:27,174 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 22 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:28:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:28,108 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2024-11-07 16:28:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 16:28:28,109 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2024-11-07 16:28:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:28,109 INFO L225 Difference]: With dead ends: 67 [2024-11-07 16:28:28,109 INFO L226 Difference]: Without dead ends: 53 [2024-11-07 16:28:28,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=1497, Unknown=12, NotChecked=0, Total=1722 [2024-11-07 16:28:28,110 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 52 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 33 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:28,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 154 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 389 Invalid, 14 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:28:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-07 16:28:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2024-11-07 16:28:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 16:28:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2024-11-07 16:28:28,115 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2024-11-07 16:28:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:28,115 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-11-07 16:28:28,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:28:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2024-11-07 16:28:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 16:28:28,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:28,116 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:28,132 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:28:28,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:28:28,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:28,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash 706574085, now seen corresponding path program 2 times [2024-11-07 16:28:28,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:28,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680828176] [2024-11-07 16:28:28,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:28,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:28,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:28:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:28:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:28:28,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:28,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680828176] [2024-11-07 16:28:28,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680828176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:28:28,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426766388] [2024-11-07 16:28:28,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:28:28,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:28:28,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:28:28,632 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:28:28,632 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:28:28,720 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:28:28,721 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:28:28,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 16:28:28,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-07 16:28:28,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:28:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 16:28:28,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426766388] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:28:28,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:28:28,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2024-11-07 16:28:28,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023981705] [2024-11-07 16:28:28,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:28:28,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:28:28,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:28,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:28:28,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:28:28,820 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 16:28:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:28,926 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2024-11-07 16:28:28,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:28:28,926 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 28 [2024-11-07 16:28:28,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:28,927 INFO L225 Difference]: With dead ends: 55 [2024-11-07 16:28:28,927 INFO L226 Difference]: Without dead ends: 35 [2024-11-07 16:28:28,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-11-07 16:28:28,927 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:28,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 156 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:28:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-07 16:28:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-07 16:28:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-07 16:28:28,929 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 28 [2024-11-07 16:28:28,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:28,930 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-07 16:28:28,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 16:28:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-07 16:28:28,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 16:28:28,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:28,930 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:28,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 16:28:29,131 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,SelfDestructingSolverStorable11 [2024-11-07 16:28:29,131 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:29,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash -651814553, now seen corresponding path program 1 times [2024-11-07 16:28:29,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:29,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614503941] [2024-11-07 16:28:29,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:29,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:28:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:29,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 16:28:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 16:28:29,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614503941] [2024-11-07 16:28:29,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614503941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:28:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062378050] [2024-11-07 16:28:29,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:29,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:28:29,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:28:29,333 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:28:29,334 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:28:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:29,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 16:28:29,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-07 16:28:29,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:28:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:28:29,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062378050] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:28:29,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:28:29,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2024-11-07 16:28:29,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913193224] [2024-11-07 16:28:29,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:28:29,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 16:28:29,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:29,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 16:28:29,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-11-07 16:28:29,845 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:28:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:34,111 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2024-11-07 16:28:34,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:28:34,112 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2024-11-07 16:28:34,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:34,112 INFO L225 Difference]: With dead ends: 61 [2024-11-07 16:28:34,112 INFO L226 Difference]: Without dead ends: 45 [2024-11-07 16:28:34,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2024-11-07 16:28:34,113 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:34,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 159 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:28:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-07 16:28:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-07 16:28:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:34,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-11-07 16:28:34,114 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 30 [2024-11-07 16:28:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:34,114 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-11-07 16:28:34,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:28:34,115 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-07 16:28:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 16:28:34,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:34,117 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:34,130 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:28:34,318 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,SelfDestructingSolverStorable12 [2024-11-07 16:28:34,319 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:34,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:34,320 INFO L85 PathProgramCache]: Analyzing trace with hash 167805021, now seen corresponding path program 2 times [2024-11-07 16:28:34,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:34,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007450427] [2024-11-07 16:28:34,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:34,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:35,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:28:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:28:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 16:28:35,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:35,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007450427] [2024-11-07 16:28:35,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007450427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:28:35,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011173141] [2024-11-07 16:28:35,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:28:35,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:28:35,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:28:35,756 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:28:35,757 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:28:35,862 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:28:35,862 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:28:35,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-07 16:28:35,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:35,906 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:28:35,906 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:28:35,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-07 16:28:36,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:36,174 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 34 treesize of output 34 [2024-11-07 16:28:36,176 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 12 treesize of output 1 [2024-11-07 16:28:36,224 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:28:36,279 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-07 16:28:36,280 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:28:36,333 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 21 treesize of output 9 [2024-11-07 16:28:36,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:36,507 INFO L349 Elim1Store]: treesize reduction 18, result has 33.3 percent of original size [2024-11-07 16:28:36,507 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 1 case distinctions, treesize of input 45 treesize of output 50 [2024-11-07 16:28:36,514 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 17 treesize of output 13 [2024-11-07 16:28:36,531 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 12 treesize of output 1 [2024-11-07 16:28:36,583 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 28 treesize of output 12 [2024-11-07 16:28:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 16:28:36,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:28:36,671 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_789 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~1#1.base| v_ArrVal_789) |c_~#a~0.base|) |c_~#a~0.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-07 16:28:36,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011173141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:28:36,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:28:36,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2024-11-07 16:28:36,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484955348] [2024-11-07 16:28:36,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:28:36,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-07 16:28:36,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:36,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-07 16:28:36,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=898, Unknown=11, NotChecked=60, Total=1056 [2024-11-07 16:28:36,674 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 32 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:28:37,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:37,831 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2024-11-07 16:28:37,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:28:37,831 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2024-11-07 16:28:37,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:37,832 INFO L225 Difference]: With dead ends: 44 [2024-11-07 16:28:37,832 INFO L226 Difference]: Without dead ends: 44 [2024-11-07 16:28:37,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=294, Invalid=2040, Unknown=22, NotChecked=94, Total=2450 [2024-11-07 16:28:37,833 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 53 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 26 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:37,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 108 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 319 Invalid, 20 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:28:37,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-07 16:28:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-07 16:28:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2024-11-07 16:28:37,835 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 32 [2024-11-07 16:28:37,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:37,835 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2024-11-07 16:28:37,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 28 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:28:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2024-11-07 16:28:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:28:37,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:37,836 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:37,852 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:28:38,040 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,SelfDestructingSolverStorable13 [2024-11-07 16:28:38,041 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:38,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash 906988440, now seen corresponding path program 1 times [2024-11-07 16:28:38,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:38,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345495061] [2024-11-07 16:28:38,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:38,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:38,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 16:28:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 16:28:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 16:28:39,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:28:39,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345495061] [2024-11-07 16:28:39,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345495061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:28:39,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854217814] [2024-11-07 16:28:39,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:39,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:28:39,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:28:39,301 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:28:39,313 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:28:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:39,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-07 16:28:39,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:39,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:39,493 INFO L349 Elim1Store]: treesize reduction 48, result has 17.2 percent of original size [2024-11-07 16:28:39,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 25 [2024-11-07 16:28:39,545 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 19 treesize of output 11 [2024-11-07 16:28:39,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:39,882 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 32 treesize of output 30 [2024-11-07 16:28:39,885 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 12 treesize of output 11 [2024-11-07 16:28:39,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:39,963 INFO L349 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2024-11-07 16:28:39,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 33 [2024-11-07 16:28:40,058 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2024-11-07 16:28:40,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2024-11-07 16:28:40,137 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 30 treesize of output 14 [2024-11-07 16:28:40,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:40,478 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-07 16:28:40,478 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 1 case distinctions, treesize of input 51 treesize of output 52 [2024-11-07 16:28:40,484 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 12 treesize of output 11 [2024-11-07 16:28:40,489 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 30 treesize of output 22 [2024-11-07 16:28:40,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:28:40,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 84 [2024-11-07 16:28:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 16:28:40,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:28:41,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854217814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:28:41,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:28:41,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2024-11-07 16:28:41,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203393170] [2024-11-07 16:28:41,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:28:41,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-07 16:28:41,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:28:41,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-07 16:28:41,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1066, Unknown=1, NotChecked=0, Total=1190 [2024-11-07 16:28:41,015 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 34 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:28:41,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:41,879 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-11-07 16:28:41,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 16:28:41,880 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2024-11-07 16:28:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:41,881 INFO L225 Difference]: With dead ends: 43 [2024-11-07 16:28:41,881 INFO L226 Difference]: Without dead ends: 43 [2024-11-07 16:28:41,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=296, Invalid=2055, Unknown=1, NotChecked=0, Total=2352 [2024-11-07 16:28:41,882 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 32 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:41,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 96 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:28:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-07 16:28:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-07 16:28:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2024-11-07 16:28:41,888 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 33 [2024-11-07 16:28:41,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:41,888 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2024-11-07 16:28:41,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 16:28:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-11-07 16:28:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 16:28:41,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:41,889 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:41,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 16:28:42,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:28:42,090 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:42,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:42,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1948129344, now seen corresponding path program 1 times [2024-11-07 16:28:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:28:42,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275329211] [2024-11-07 16:28:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:42,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:28:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:42,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 16:28:42,539 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:395) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:871) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:795) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:156) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:320) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-07 16:28:42,543 INFO L158 Benchmark]: Toolchain (without parser) took 20399.38ms. Allocated memory was 109.1MB in the beginning and 352.3MB in the end (delta: 243.3MB). Free memory was 84.9MB in the beginning and 175.1MB in the end (delta: -90.2MB). Peak memory consumption was 211.6MB. Max. memory is 16.1GB. [2024-11-07 16:28:42,544 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:28:42,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.29ms. Allocated memory is still 109.1MB. Free memory was 84.7MB in the beginning and 64.9MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:28:42,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.61ms. Allocated memory is still 109.1MB. Free memory was 64.9MB in the beginning and 63.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:28:42,544 INFO L158 Benchmark]: Boogie Preprocessor took 45.02ms. Allocated memory is still 109.1MB. Free memory was 63.3MB in the beginning and 61.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:28:42,544 INFO L158 Benchmark]: RCFGBuilder took 283.79ms. Allocated memory is still 109.1MB. Free memory was 61.4MB in the beginning and 45.1MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 16:28:42,544 INFO L158 Benchmark]: TraceAbstraction took 19711.31ms. Allocated memory was 109.1MB in the beginning and 352.3MB in the end (delta: 243.3MB). Free memory was 44.4MB in the beginning and 175.1MB in the end (delta: -130.6MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. [2024-11-07 16:28:42,545 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.29ms. Allocated memory is still 109.1MB. Free memory was 84.7MB in the beginning and 64.9MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.61ms. Allocated memory is still 109.1MB. Free memory was 64.9MB in the beginning and 63.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.02ms. Allocated memory is still 109.1MB. Free memory was 63.3MB in the beginning and 61.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 283.79ms. Allocated memory is still 109.1MB. Free memory was 61.4MB in the beginning and 45.1MB in the end (delta: 16.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19711.31ms. Allocated memory was 109.1MB in the beginning and 352.3MB in the end (delta: 243.3MB). Free memory was 44.4MB in the beginning and 175.1MB in the end (delta: -130.6MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-07 16:28:42,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/memsafety/test-memleak_nexttime.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 0176377c3fa036d8b42b70bf41d842353f196a854b997aa0bf5f176a7ad1942b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:28:44,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:28:44,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 16:28:44,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:28:44,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:28:44,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:28:44,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:28:44,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:28:44,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:28:44,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:28:44,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:28:44,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:28:44,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:28:44,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:28:44,667 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:28:44,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:28:44,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:28:44,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:28:44,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:28:44,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:28:44,668 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:28:44,668 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:28:44,668 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 16:28:44,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:28:44,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:28:44,668 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 16:28:44,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:28:44,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 16:28:44,669 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:28:44,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:28:44,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:28:44,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:28:44,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:28:44,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:28:44,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:28:44,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:28:44,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:28:44,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:28:44,670 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 16:28:44,670 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 16:28:44,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:28:44,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:28:44,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:28:44,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:28:44,670 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 -> 0176377c3fa036d8b42b70bf41d842353f196a854b997aa0bf5f176a7ad1942b [2024-11-07 16:28:44,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:28:44,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:28:44,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:28:44,897 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:28:44,897 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:28:44,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2024-11-07 16:28:46,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:28:46,369 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:28:46,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-memleak_nexttime.i [2024-11-07 16:28:46,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/496f31b8d/ec26d3a7cf5548fba623baefc0c9213f/FLAG28d7bf20b [2024-11-07 16:28:46,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/496f31b8d/ec26d3a7cf5548fba623baefc0c9213f [2024-11-07 16:28:46,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:28:46,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:28:46,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:28:46,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:28:46,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:28:46,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:28:46" (1/1) ... [2024-11-07 16:28:46,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccbc79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:46, skipping insertion in model container [2024-11-07 16:28:46,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:28:46" (1/1) ... [2024-11-07 16:28:46,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:28:46,942 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:28:46,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:28:46,956 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:28:46,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:28:47,032 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:28:47,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:47 WrapperNode [2024-11-07 16:28:47,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:28:47,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:28:47,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:28:47,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:28:47,043 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:28:47" (1/1) ... [2024-11-07 16:28:47,063 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:28:47" (1/1) ... [2024-11-07 16:28:47,082 INFO L138 Inliner]: procedures = 182, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2024-11-07 16:28:47,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:28:47,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:28:47,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:28:47,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:28:47,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:47" (1/1) ... [2024-11-07 16:28:47,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:47" (1/1) ... [2024-11-07 16:28:47,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:47" (1/1) ... [2024-11-07 16:28:47,114 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 2 writes are split as follows [0, 2]. [2024-11-07 16:28:47,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:47" (1/1) ... [2024-11-07 16:28:47,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:47" (1/1) ... [2024-11-07 16:28:47,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:47" (1/1) ... [2024-11-07 16:28:47,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:47" (1/1) ... [2024-11-07 16:28:47,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:47" (1/1) ... [2024-11-07 16:28:47,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:47" (1/1) ... [2024-11-07 16:28:47,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:28:47,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:28:47,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:28:47,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:28:47,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:47" (1/1) ... [2024-11-07 16:28:47,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:28:47,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:28:47,162 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:28:47,167 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:28:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-11-07 16:28:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-11-07 16:28:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-07 16:28:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-07 16:28:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-11-07 16:28:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-11-07 16:28:47,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-11-07 16:28:47,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-11-07 16:28:47,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 16:28:47,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 16:28:47,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:28:47,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:28:47,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:28:47,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:28:47,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:28:47,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:28:47,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 16:28:47,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 16:28:47,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 16:28:47,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 16:28:47,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1#0 [2024-11-07 16:28:47,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1#1 [2024-11-07 16:28:47,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:28:47,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:28:47,307 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:28:47,308 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:28:47,310 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 16:28:47,368 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-07 16:28:47,548 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-07 16:28:47,548 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:28:47,554 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:28:47,554 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 16:28:47,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:28:47 BoogieIcfgContainer [2024-11-07 16:28:47,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:28:47,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:28:47,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:28:47,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:28:47,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:28:46" (1/3) ... [2024-11-07 16:28:47,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2533dbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:28:47, skipping insertion in model container [2024-11-07 16:28:47,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:28:47" (2/3) ... [2024-11-07 16:28:47,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2533dbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:28:47, skipping insertion in model container [2024-11-07 16:28:47,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:28:47" (3/3) ... [2024-11-07 16:28:47,560 INFO L112 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime.i [2024-11-07 16:28:47,569 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:28:47,569 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-07 16:28:47,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:28:47,614 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;@66b8a536, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:28:47,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-07 16:28:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:28:47,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:47,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:28:47,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:47,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:47,623 INFO L85 PathProgramCache]: Analyzing trace with hash 59647, now seen corresponding path program 1 times [2024-11-07 16:28:47,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:28:47,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146117027] [2024-11-07 16:28:47,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:47,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:47,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:28:47,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:28:47,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 16:28:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:47,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:28:47,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:47,797 INFO L349 Elim1Store]: treesize reduction 54, result has 18.2 percent of original size [2024-11-07 16:28:47,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 31 [2024-11-07 16:28:47,811 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 20 treesize of output 12 [2024-11-07 16:28:47,819 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 18 treesize of output 10 [2024-11-07 16:28:47,836 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-07 16:28:47,836 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 19 treesize of output 27 [2024-11-07 16:28:47,879 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:28:47,879 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:28:47,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:28:47,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146117027] [2024-11-07 16:28:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146117027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:47,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:47,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 16:28:47,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196168040] [2024-11-07 16:28:47,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:47,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:28:47,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:28:47,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:28:47,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:28:47,898 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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:28:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:47,946 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-11-07 16:28:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:28:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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:28:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:47,952 INFO L225 Difference]: With dead ends: 39 [2024-11-07 16:28:47,952 INFO L226 Difference]: Without dead ends: 37 [2024-11-07 16:28:47,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 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:28:47,954 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:47,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-07 16:28:47,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-07 16:28:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-07 16:28:47,975 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 3 [2024-11-07 16:28:47,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:47,975 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-07 16:28:47,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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:28:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-07 16:28:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:28:47,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:47,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:28:47,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 16:28:48,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:48,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:48,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:48,180 INFO L85 PathProgramCache]: Analyzing trace with hash 59648, now seen corresponding path program 1 times [2024-11-07 16:28:48,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:28:48,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641120677] [2024-11-07 16:28:48,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:48,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:48,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:28:48,184 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:28:48,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 16:28:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:48,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:28:48,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:48,231 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 13 treesize of output 9 [2024-11-07 16:28:48,250 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-07 16:28:48,251 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 1 case distinctions, treesize of input 9 treesize of output 15 [2024-11-07 16:28:48,274 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:28:48,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:28:48,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:28:48,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641120677] [2024-11-07 16:28:48,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641120677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:48,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:48,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:28:48,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120753957] [2024-11-07 16:28:48,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:48,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:28:48,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:28:48,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:28:48,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:28:48,279 INFO L87 Difference]: Start difference. First operand 37 states and 40 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:28:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:48,321 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-07 16:28:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:28:48,321 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:28:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:48,322 INFO L225 Difference]: With dead ends: 36 [2024-11-07 16:28:48,322 INFO L226 Difference]: Without dead ends: 36 [2024-11-07 16:28:48,322 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:28:48,322 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:48,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-07 16:28:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-07 16:28:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-07 16:28:48,325 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 3 [2024-11-07 16:28:48,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:48,325 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-07 16:28:48,325 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:28:48,325 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-07 16:28:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:28:48,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:48,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:28:48,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 16:28:48,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:48,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:48,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:48,529 INFO L85 PathProgramCache]: Analyzing trace with hash 59649, now seen corresponding path program 1 times [2024-11-07 16:28:48,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:28:48,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501932934] [2024-11-07 16:28:48,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:48,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:48,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:28:48,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:28:48,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 16:28:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:48,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 16:28:48,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:48,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:48,687 INFO L349 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2024-11-07 16:28:48,687 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 1 case distinctions, treesize of input 21 treesize of output 26 [2024-11-07 16:28:48,694 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 31 treesize of output 19 [2024-11-07 16:28:48,705 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:28:48,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-07 16:28:48,724 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 18 treesize of output 10 [2024-11-07 16:28:48,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:48,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:48,733 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 0 case distinctions, treesize of input 12 treesize of output 14 [2024-11-07 16:28:48,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:48,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-07 16:28:48,766 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:28:48,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:28:48,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:28:48,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501932934] [2024-11-07 16:28:48,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501932934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:48,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:48,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:28:48,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657420918] [2024-11-07 16:28:48,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:48,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:28:48,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:28:48,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:28:48,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:28:48,767 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 4 states, 3 states have (on average 1.0) 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:28:48,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:48,856 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-07 16:28:48,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:28:48,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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:28:48,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:48,856 INFO L225 Difference]: With dead ends: 35 [2024-11-07 16:28:48,856 INFO L226 Difference]: Without dead ends: 35 [2024-11-07 16:28:48,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:28:48,857 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:48,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 54 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:28:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-07 16:28:48,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-07 16:28:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-07 16:28:48,859 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 3 [2024-11-07 16:28:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:48,860 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-07 16:28:48,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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:28:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-07 16:28:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-07 16:28:48,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:48,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-07 16:28:48,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 16:28:49,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:49,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:49,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:49,061 INFO L85 PathProgramCache]: Analyzing trace with hash 59650, now seen corresponding path program 1 times [2024-11-07 16:28:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:28:49,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862495710] [2024-11-07 16:28:49,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:49,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:49,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:28:49,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:28:49,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 16:28:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:49,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:28:49,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:49,148 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 32 treesize of output 20 [2024-11-07 16:28:49,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:49,153 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 11 treesize of output 5 [2024-11-07 16:28:49,157 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 10 treesize of output 8 [2024-11-07 16:28:49,164 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:28:49,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:28:49,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:28:49,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862495710] [2024-11-07 16:28:49,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862495710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:49,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:49,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:28:49,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612194997] [2024-11-07 16:28:49,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:49,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:28:49,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:28:49,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:28:49,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:28:49,166 INFO L87 Difference]: Start difference. First operand 35 states and 38 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:28:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:49,193 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-07 16:28:49,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:28:49,193 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:28:49,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:49,194 INFO L225 Difference]: With dead ends: 34 [2024-11-07 16:28:49,194 INFO L226 Difference]: Without dead ends: 34 [2024-11-07 16:28:49,194 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:28:49,194 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 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:28:49,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-07 16:28:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-07 16:28:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-07 16:28:49,197 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 3 [2024-11-07 16:28:49,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:49,197 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-07 16:28:49,197 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:28:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-07 16:28:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:28:49,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:49,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:49,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 16:28:49,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:49,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:49,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1537300967, now seen corresponding path program 1 times [2024-11-07 16:28:49,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:28:49,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800152700] [2024-11-07 16:28:49,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:49,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:49,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:28:49,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:28:49,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 16:28:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:49,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:28:49,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:49,488 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:28:49,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:28:49,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:28:49,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800152700] [2024-11-07 16:28:49,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800152700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:49,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:49,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:28:49,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949335825] [2024-11-07 16:28:49,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:49,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:28:49,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:28:49,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:28:49,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:28:49,490 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:49,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:49,533 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-07 16:28:49,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:28:49,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-07 16:28:49,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:49,536 INFO L225 Difference]: With dead ends: 42 [2024-11-07 16:28:49,536 INFO L226 Difference]: Without dead ends: 36 [2024-11-07 16:28:49,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:28:49,537 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:49,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-07 16:28:49,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-07 16:28:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-07 16:28:49,539 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 12 [2024-11-07 16:28:49,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:49,539 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-07 16:28:49,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:49,539 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-07 16:28:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 16:28:49,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:49,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:49,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 16:28:49,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:49,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:49,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:49,742 INFO L85 PathProgramCache]: Analyzing trace with hash -703749272, now seen corresponding path program 1 times [2024-11-07 16:28:49,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:28:49,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512118631] [2024-11-07 16:28:49,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:49,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:49,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:28:49,745 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:28:49,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 16:28:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:49,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:28:49,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:49,839 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:28:49,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:28:49,888 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:28:49,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:28:49,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512118631] [2024-11-07 16:28:49,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512118631] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:28:49,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:28:49,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 16:28:49,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861461311] [2024-11-07 16:28:49,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:28:49,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:28:49,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:28:49,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:28:49,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:28:49,889 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:28:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:49,997 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2024-11-07 16:28:49,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 16:28:49,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2024-11-07 16:28:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:49,998 INFO L225 Difference]: With dead ends: 54 [2024-11-07 16:28:49,998 INFO L226 Difference]: Without dead ends: 42 [2024-11-07 16:28:49,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-07 16:28:49,998 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:49,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 74 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:28:49,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-07 16:28:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-07 16:28:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2024-11-07 16:28:50,001 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 13 [2024-11-07 16:28:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:50,001 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-11-07 16:28:50,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:28:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-07 16:28:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 16:28:50,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:50,001 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:50,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 16:28:50,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:50,204 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:50,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:50,205 INFO L85 PathProgramCache]: Analyzing trace with hash 383451609, now seen corresponding path program 2 times [2024-11-07 16:28:50,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:28:50,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908527259] [2024-11-07 16:28:50,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:28:50,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:50,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:28:50,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:28:50,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 16:28:50,253 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 16:28:50,253 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:28:50,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:28:50,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 16:28:50,270 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:28:50,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:28:50,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908527259] [2024-11-07 16:28:50,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908527259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:50,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:50,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:28:50,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748182554] [2024-11-07 16:28:50,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:50,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:28:50,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:28:50,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:28:50,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:28:50,271 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:50,302 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2024-11-07 16:28:50,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:28:50,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-07 16:28:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:50,303 INFO L225 Difference]: With dead ends: 48 [2024-11-07 16:28:50,303 INFO L226 Difference]: Without dead ends: 44 [2024-11-07 16:28:50,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:28:50,303 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:50,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:50,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-07 16:28:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-07 16:28:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2024-11-07 16:28:50,306 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2024-11-07 16:28:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:50,306 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2024-11-07 16:28:50,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:50,306 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2024-11-07 16:28:50,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:28:50,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:50,306 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:50,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 16:28:50,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:50,507 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:50,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:50,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1450706538, now seen corresponding path program 1 times [2024-11-07 16:28:50,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:28:50,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117841186] [2024-11-07 16:28:50,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:50,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:50,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:28:50,511 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:28:50,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 16:28:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:50,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:28:50,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:50,596 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 7 [2024-11-07 16:28:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:28:50,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:28:50,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:28:50,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117841186] [2024-11-07 16:28:50,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117841186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:50,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:50,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:28:50,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124408267] [2024-11-07 16:28:50,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:50,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:28:50,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:28:50,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:28:50,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:28:50,601 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:50,626 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-07 16:28:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:28:50,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-07 16:28:50,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:50,627 INFO L225 Difference]: With dead ends: 42 [2024-11-07 16:28:50,627 INFO L226 Difference]: Without dead ends: 42 [2024-11-07 16:28:50,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:28:50,627 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:50,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 30 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-07 16:28:50,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-07 16:28:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2024-11-07 16:28:50,629 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 17 [2024-11-07 16:28:50,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:50,629 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-11-07 16:28:50,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-07 16:28:50,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:28:50,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:50,630 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:50,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 16:28:50,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:50,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:50,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:50,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1450706539, now seen corresponding path program 1 times [2024-11-07 16:28:50,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:28:50,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836546754] [2024-11-07 16:28:50,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:50,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:50,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:28:50,834 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:28:50,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 16:28:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:50,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 16:28:50,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:50,957 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:28:50,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-07 16:28:51,054 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 16 treesize of output 13 [2024-11-07 16:28:51,067 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-07 16:28:51,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-07 16:28:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:28:51,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:28:51,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:28:51,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836546754] [2024-11-07 16:28:51,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836546754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:51,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:51,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:28:51,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156965581] [2024-11-07 16:28:51,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:51,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 16:28:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:28:51,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 16:28:51,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:28:51,076 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:51,152 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2024-11-07 16:28:51,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:28:51,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-07 16:28:51,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:51,152 INFO L225 Difference]: With dead ends: 41 [2024-11-07 16:28:51,152 INFO L226 Difference]: Without dead ends: 41 [2024-11-07 16:28:51,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:28:51,153 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:51,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 42 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:28:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-07 16:28:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-07 16:28:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-07 16:28:51,155 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 17 [2024-11-07 16:28:51,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:51,155 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-07 16:28:51,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-07 16:28:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:28:51,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:51,156 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:51,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-07 16:28:51,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:51,360 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:51,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:51,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1450706540, now seen corresponding path program 1 times [2024-11-07 16:28:51,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:28:51,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519906036] [2024-11-07 16:28:51,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:51,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:51,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:28:51,363 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:28:51,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 16:28:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:51,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:28:51,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:51,450 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:28:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:28:51,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:28:51,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:28:51,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519906036] [2024-11-07 16:28:51,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519906036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:51,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:51,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:28:51,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642447965] [2024-11-07 16:28:51,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:51,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:28:51,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:28:51,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:28:51,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:28:51,460 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:51,481 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-11-07 16:28:51,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:28:51,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-07 16:28:51,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:51,482 INFO L225 Difference]: With dead ends: 39 [2024-11-07 16:28:51,482 INFO L226 Difference]: Without dead ends: 39 [2024-11-07 16:28:51,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:28:51,483 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:51,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 38 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:28:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-07 16:28:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-07 16:28:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-11-07 16:28:51,485 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 17 [2024-11-07 16:28:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:51,485 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-07 16:28:51,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-11-07 16:28:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 16:28:51,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:51,488 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:51,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-07 16:28:51,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:51,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:51,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1450706541, now seen corresponding path program 1 times [2024-11-07 16:28:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:28:51,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256133158] [2024-11-07 16:28:51,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:51,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:51,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:28:51,695 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:28:51,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-07 16:28:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:51,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 16:28:51,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:51,954 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-07 16:28:51,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-11-07 16:28:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 16:28:51,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:28:51,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:28:51,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256133158] [2024-11-07 16:28:51,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256133158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:28:51,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:28:51,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:28:51,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645346312] [2024-11-07 16:28:51,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:28:51,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:28:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:28:51,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:28:51,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:28:51,989 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:28:52,070 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-07 16:28:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:28:52,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-07 16:28:52,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:28:52,072 INFO L225 Difference]: With dead ends: 38 [2024-11-07 16:28:52,072 INFO L226 Difference]: Without dead ends: 38 [2024-11-07 16:28:52,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:28:52,072 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:28:52,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 22 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:28:52,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-07 16:28:52,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-07 16:28:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:28:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-07 16:28:52,074 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 17 [2024-11-07 16:28:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:28:52,075 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-07 16:28:52,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 16:28:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-07 16:28:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 16:28:52,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:28:52,075 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:28:52,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-07 16:28:52,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:52,276 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:28:52,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:28:52,276 INFO L85 PathProgramCache]: Analyzing trace with hash -548776266, now seen corresponding path program 1 times [2024-11-07 16:28:52,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:28:52,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150613362] [2024-11-07 16:28:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:52,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:28:52,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:28:52,279 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:28:52,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-07 16:28:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:52,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-07 16:28:52,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:52,530 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:28:52,549 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-07 16:28:52,549 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 21 treesize of output 20 [2024-11-07 16:28:52,576 INFO L349 Elim1Store]: treesize reduction 65, result has 9.7 percent of original size [2024-11-07 16:28:52,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 16 [2024-11-07 16:28:52,583 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:28:52,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:52,874 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 21 treesize of output 21 [2024-11-07 16:28:52,877 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 7 [2024-11-07 16:28:52,915 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 16 treesize of output 13 [2024-11-07 16:28:52,978 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:28:52,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-07 16:28:53,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:53,295 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-07 16:28:53,295 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 1 case distinctions, treesize of input 28 treesize of output 35 [2024-11-07 16:28:53,319 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 7 [2024-11-07 16:28:53,380 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 16:28:53,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:28:53,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:28:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150613362] [2024-11-07 16:28:53,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150613362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:28:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1985557158] [2024-11-07 16:28:53,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:28:53,511 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:28:53,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:28:53,536 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 16:28:53,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-07 16:28:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:28:53,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-07 16:28:53,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:28:53,961 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:28:53,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-07 16:28:54,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:54,201 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 21 treesize of output 21 [2024-11-07 16:28:54,207 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 7 [2024-11-07 16:28:54,224 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 16 treesize of output 13 [2024-11-07 16:28:54,273 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:28:54,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-07 16:28:54,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:28:54,506 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-07 16:28:54,506 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 1 case distinctions, treesize of input 28 treesize of output 35 [2024-11-07 16:28:54,520 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 7 [2024-11-07 16:28:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 16:28:54,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:28:54,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1985557158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:28:54,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:28:54,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2024-11-07 16:28:54,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432702269] [2024-11-07 16:28:54,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:28:54,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 16:28:54,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:28:54,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 16:28:54,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=266, Unknown=23, NotChecked=0, Total=342 [2024-11-07 16:28:54,655 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:29:00,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:29:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:00,298 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2024-11-07 16:29:00,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 16:29:00,298 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-07 16:29:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:00,301 INFO L225 Difference]: With dead ends: 57 [2024-11-07 16:29:00,301 INFO L226 Difference]: Without dead ends: 57 [2024-11-07 16:29:00,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=138, Invalid=750, Unknown=42, NotChecked=0, Total=930 [2024-11-07 16:29:00,302 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 23 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:00,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 85 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 179 Invalid, 17 Unknown, 0 Unchecked, 5.1s Time] [2024-11-07 16:29:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-07 16:29:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2024-11-07 16:29:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 16:29:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-07 16:29:00,312 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 31 [2024-11-07 16:29:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:00,312 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-07 16:29:00,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:29:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-07 16:29:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 16:29:00,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:00,313 INFO L215 NwaCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:00,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-07 16:29:00,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-07 16:29:00,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 16:29:00,718 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:29:00,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:00,719 INFO L85 PathProgramCache]: Analyzing trace with hash -584876539, now seen corresponding path program 2 times [2024-11-07 16:29:00,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:29:00,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982791291] [2024-11-07 16:29:00,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:29:00,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:29:00,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:29:00,722 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:29:00,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-07 16:29:00,841 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:29:00,841 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:29:00,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:29:00,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-07 16:29:00,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-07 16:29:00,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:29:00,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982791291] [2024-11-07 16:29:00,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982791291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:29:00,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:29:00,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 16:29:00,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737385905] [2024-11-07 16:29:00,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:29:00,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:29:00,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:29:00,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:29:00,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:29:00,919 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:29:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:00,993 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-11-07 16:29:00,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:29:00,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-11-07 16:29:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:00,994 INFO L225 Difference]: With dead ends: 43 [2024-11-07 16:29:00,994 INFO L226 Difference]: Without dead ends: 37 [2024-11-07 16:29:00,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:29:00,994 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:00,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 92 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:29:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-07 16:29:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-07 16:29:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:29:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-11-07 16:29:00,996 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2024-11-07 16:29:00,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:00,996 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-11-07 16:29:00,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:29:00,996 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-11-07 16:29:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 16:29:00,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:00,997 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:01,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-07 16:29:01,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:29:01,201 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:29:01,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash 167805021, now seen corresponding path program 1 times [2024-11-07 16:29:01,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:29:01,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255035367] [2024-11-07 16:29:01,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:01,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:29:01,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:29:01,204 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:29:01,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-07 16:29:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:01,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-07 16:29:01,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:01,472 INFO L349 Elim1Store]: treesize reduction 52, result has 27.8 percent of original size [2024-11-07 16:29:01,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 28 [2024-11-07 16:29:01,509 INFO L349 Elim1Store]: treesize reduction 36, result has 30.8 percent of original size [2024-11-07 16:29:01,509 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 29 treesize of output 24 [2024-11-07 16:29:01,563 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 23 treesize of output 15 [2024-11-07 16:29:02,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:29:02,164 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 21 treesize of output 21 [2024-11-07 16:29:02,179 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 12 treesize of output 11 [2024-11-07 16:29:02,229 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 16 treesize of output 13 [2024-11-07 16:29:02,312 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:29:02,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-07 16:29:02,359 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 19 treesize of output 7 [2024-11-07 16:29:02,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:29:02,756 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-07 16:29:02,757 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 1 case distinctions, treesize of input 32 treesize of output 37 [2024-11-07 16:29:02,761 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 12 treesize of output 11 [2024-11-07 16:29:02,769 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 15 treesize of output 11 [2024-11-07 16:29:02,831 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 26 treesize of output 10 [2024-11-07 16:29:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 16:29:02,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:02,961 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~1#1.base| v_ArrVal_566) |c_~#a~0.base|) |c_~#a~0.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-07 16:29:02,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:29:02,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255035367] [2024-11-07 16:29:02,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255035367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:02,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [270431716] [2024-11-07 16:29:02,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:02,963 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 16:29:02,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 16:29:02,965 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 16:29:02,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-07 16:29:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:03,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-07 16:29:03,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:03,427 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:29:03,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-07 16:29:03,470 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:29:03,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:29:03,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 21 treesize of output 21 [2024-11-07 16:29:03,898 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 12 treesize of output 11 [2024-11-07 16:29:03,912 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 16 treesize of output 13 [2024-11-07 16:29:03,958 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 16:29:03,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-07 16:29:03,978 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 19 treesize of output 7 [2024-11-07 16:29:04,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:29:04,260 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-07 16:29:04,260 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 1 case distinctions, treesize of input 32 treesize of output 37 [2024-11-07 16:29:04,266 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 12 treesize of output 11 [2024-11-07 16:29:04,274 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 15 treesize of output 11 [2024-11-07 16:29:04,308 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 26 treesize of output 10 [2024-11-07 16:29:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 16:29:04,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:29:04,399 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#p~1#1.base| v_ArrVal_651) |c_~#a~0.base|) |c_~#a~0.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-07 16:29:04,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [270431716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:29:04,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:29:04,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 21 [2024-11-07 16:29:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865044959] [2024-11-07 16:29:04,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:29:04,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 16:29:04,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:29:04,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 16:29:04,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=460, Unknown=13, NotChecked=90, Total=650 [2024-11-07 16:29:04,403 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:29:05,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:29:08,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:29:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:29:09,101 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-11-07 16:29:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 16:29:09,102 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2024-11-07 16:29:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:29:09,102 INFO L225 Difference]: With dead ends: 36 [2024-11-07 16:29:09,102 INFO L226 Difference]: Without dead ends: 36 [2024-11-07 16:29:09,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=176, Invalid=997, Unknown=25, NotChecked=134, Total=1332 [2024-11-07 16:29:09,104 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 9 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-07 16:29:09,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 87 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 272 Invalid, 28 Unknown, 0 Unchecked, 3.5s Time] [2024-11-07 16:29:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-07 16:29:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-07 16:29:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:29:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-07 16:29:09,109 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 32 [2024-11-07 16:29:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:29:09,109 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-07 16:29:09,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 16:29:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-07 16:29:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 16:29:09,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:29:09,109 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:29:09,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-07 16:29:09,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-07 16:29:09,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 16:29:09,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-07 16:29:09,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:29:09,514 INFO L85 PathProgramCache]: Analyzing trace with hash 906988440, now seen corresponding path program 1 times [2024-11-07 16:29:09,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:29:09,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547023801] [2024-11-07 16:29:09,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:29:09,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:29:09,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:29:09,517 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 16:29:09,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-07 16:29:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:29:09,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-07 16:29:09,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:29:09,845 INFO L349 Elim1Store]: treesize reduction 96, result has 22.0 percent of original size [2024-11-07 16:29:09,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 57 [2024-11-07 16:29:09,922 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 28 treesize of output 16 [2024-11-07 16:29:10,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 16:29:10,784 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 41 treesize of output 37 [2024-11-07 16:29:10,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-07 16:29:10,976 INFO L349 Elim1Store]: treesize reduction 76, result has 23.2 percent of original size [2024-11-07 16:29:10,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 66 [2024-11-07 16:29:16,224 INFO L349 Elim1Store]: treesize reduction 494, result has 28.3 percent of original size [2024-11-07 16:29:16,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 205 treesize of output 370