./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/uthash-2.0.2/uthash_OAT_test2-1.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b'] 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/uthash-2.0.2/uthash_OAT_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:05:44,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:05:44,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-07 16:05:44,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:05:44,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:05:44,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:05:44,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:05:44,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:05:44,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:05:44,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:05:44,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:05:44,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:05:44,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:05:44,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:05:44,606 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:05:44,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 16:05:44,607 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:05:44,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:05:44,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:05:44,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:05:44,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:05:44,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:05:44,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:05:44,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:05:44,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:05:44,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:05:44,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:05:44,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:05:44,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:05:44,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:05:44,608 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-memcleanup) ) 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 -> 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b [2024-11-07 16:05:44,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:05:44,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:05:44,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:05:44,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:05:44,833 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:05:44,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2024-11-07 16:05:45,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:05:46,232 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:05:46,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2024-11-07 16:05:46,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f69e914f/6391532c8d0441928a62fbd0799408a0/FLAG16ef5dec4 [2024-11-07 16:05:46,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f69e914f/6391532c8d0441928a62fbd0799408a0 [2024-11-07 16:05:46,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:05:46,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:05:46,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:05:46,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:05:46,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:05:46,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:05:46" (1/1) ... [2024-11-07 16:05:46,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719b6614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:46, skipping insertion in model container [2024-11-07 16:05:46,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:05:46" (1/1) ... [2024-11-07 16:05:46,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:05:46,796 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:05:46,816 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:05:46,819 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:05:46,822 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:05:46,828 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:05:46,851 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:05:46,852 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:05:46,853 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:05:46,853 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:05:46,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:05:46,866 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:05:46,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:05:47,012 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:05:47,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:47 WrapperNode [2024-11-07 16:05:47,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:05:47,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:05:47,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:05:47,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:05:47,019 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:05:47" (1/1) ... [2024-11-07 16:05:47,036 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:05:47" (1/1) ... [2024-11-07 16:05:47,079 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1302 [2024-11-07 16:05:47,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:05:47,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:05:47,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:05:47,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:05:47,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:47" (1/1) ... [2024-11-07 16:05:47,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:47" (1/1) ... [2024-11-07 16:05:47,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:47" (1/1) ... [2024-11-07 16:05:47,169 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [172, 2, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 46 writes are split as follows [42, 0, 4]. [2024-11-07 16:05:47,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:47" (1/1) ... [2024-11-07 16:05:47,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:47" (1/1) ... [2024-11-07 16:05:47,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:47" (1/1) ... [2024-11-07 16:05:47,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:47" (1/1) ... [2024-11-07 16:05:47,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:47" (1/1) ... [2024-11-07 16:05:47,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:47" (1/1) ... [2024-11-07 16:05:47,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:05:47,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:05:47,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:05:47,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:05:47,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:47" (1/1) ... [2024-11-07 16:05:47,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:05:47,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:05:47,261 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:05:47,263 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:05:47,278 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-07 16:05:47,278 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-07 16:05:47,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-07 16:05:47,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-07 16:05:47,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-07 16:05:47,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-07 16:05:47,279 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-07 16:05:47,280 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-07 16:05:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:05:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:05:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:05:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 16:05:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:05:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 16:05:47,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 16:05:47,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 16:05:47,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 16:05:47,281 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 16:05:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 16:05:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 16:05:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 16:05:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:05:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:05:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:05:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:05:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 16:05:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 16:05:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 16:05:47,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 16:05:47,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:05:47,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:05:47,424 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:05:47,425 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:05:48,352 INFO L? ?]: Removed 304 outVars from TransFormulas that were not future-live. [2024-11-07 16:05:48,353 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:05:48,366 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:05:48,369 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-07 16:05:48,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:05:48 BoogieIcfgContainer [2024-11-07 16:05:48,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:05:48,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:05:48,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:05:48,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:05:48,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:05:46" (1/3) ... [2024-11-07 16:05:48,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2a3431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:05:48, skipping insertion in model container [2024-11-07 16:05:48,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:47" (2/3) ... [2024-11-07 16:05:48,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2a3431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:05:48, skipping insertion in model container [2024-11-07 16:05:48,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:05:48" (3/3) ... [2024-11-07 16:05:48,375 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-1.i [2024-11-07 16:05:48,384 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:05:48,384 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 16:05:48,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:05:48,421 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;@8879554, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:05:48,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 16:05:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 385 states, 369 states have (on average 1.6233062330623307) internal successors, (599), 378 states have internal predecessors, (599), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 16:05:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 16:05:48,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:05:48,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:05:48,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:05:48,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:05:48,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1585083213, now seen corresponding path program 1 times [2024-11-07 16:05:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:05:48,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906923156] [2024-11-07 16:05:48,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:48,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:05:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:48,553 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:05:48,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:05:48,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906923156] [2024-11-07 16:05:48,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906923156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:05:48,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:05:48,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:05:48,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175102262] [2024-11-07 16:05:48,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:05:48,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 16:05:48,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:05:48,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 16:05:48,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:05:48,580 INFO L87 Difference]: Start difference. First operand has 385 states, 369 states have (on average 1.6233062330623307) internal successors, (599), 378 states have internal predecessors, (599), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:05:48,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:05:48,617 INFO L93 Difference]: Finished difference Result 383 states and 556 transitions. [2024-11-07 16:05:48,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 16:05:48,618 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-11-07 16:05:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:05:48,623 INFO L225 Difference]: With dead ends: 383 [2024-11-07 16:05:48,623 INFO L226 Difference]: Without dead ends: 381 [2024-11-07 16:05:48,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:05:48,626 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:05:48,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:05:48,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-07 16:05:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-11-07 16:05:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 367 states have (on average 1.4604904632152589) internal successors, (536), 374 states have internal predecessors, (536), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 16:05:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 554 transitions. [2024-11-07 16:05:48,672 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 554 transitions. Word has length 7 [2024-11-07 16:05:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:05:48,672 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 554 transitions. [2024-11-07 16:05:48,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:05:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 554 transitions. [2024-11-07 16:05:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 16:05:48,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:05:48,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:05:48,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 16:05:48,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:05:48,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:05:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash -940236438, now seen corresponding path program 1 times [2024-11-07 16:05:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:05:48,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337689593] [2024-11-07 16:05:48,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:48,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:05:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:48,808 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:05:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:05:48,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337689593] [2024-11-07 16:05:48,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337689593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:05:48,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:05:48,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:05:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917791432] [2024-11-07 16:05:48,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:05:48,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:05:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:05:48,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:05:48,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:05:48,810 INFO L87 Difference]: Start difference. First operand 381 states and 554 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:05:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:05:48,922 INFO L93 Difference]: Finished difference Result 745 states and 1092 transitions. [2024-11-07 16:05:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:05:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-07 16:05:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:05:48,925 INFO L225 Difference]: With dead ends: 745 [2024-11-07 16:05:48,925 INFO L226 Difference]: Without dead ends: 745 [2024-11-07 16:05:48,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:05:48,926 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 518 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:05:48,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1596 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:05:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-07 16:05:48,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 383. [2024-11-07 16:05:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 369 states have (on average 1.4579945799457994) internal successors, (538), 376 states have internal predecessors, (538), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 16:05:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 556 transitions. [2024-11-07 16:05:48,956 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 556 transitions. Word has length 9 [2024-11-07 16:05:48,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:05:48,957 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 556 transitions. [2024-11-07 16:05:48,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:05:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 556 transitions. [2024-11-07 16:05:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 16:05:48,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:05:48,959 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:05:48,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 16:05:48,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:05:48,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:05:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1595384599, now seen corresponding path program 1 times [2024-11-07 16:05:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:05:48,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658934825] [2024-11-07 16:05:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:48,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:05:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:05:49,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:05:49,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658934825] [2024-11-07 16:05:49,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658934825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:05:49,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:05:49,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:05:49,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349341281] [2024-11-07 16:05:49,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:05:49,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:05:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:05:49,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:05:49,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:05:49,293 INFO L87 Difference]: Start difference. First operand 383 states and 556 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:05:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:05:49,361 INFO L93 Difference]: Finished difference Result 341 states and 479 transitions. [2024-11-07 16:05:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:05:49,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2024-11-07 16:05:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:05:49,364 INFO L225 Difference]: With dead ends: 341 [2024-11-07 16:05:49,364 INFO L226 Difference]: Without dead ends: 341 [2024-11-07 16:05:49,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:05:49,365 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 36 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:05:49,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1333 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:05:49,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-07 16:05:49,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-11-07 16:05:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 327 states have (on average 1.4097859327217126) internal successors, (461), 334 states have internal predecessors, (461), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 16:05:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 479 transitions. [2024-11-07 16:05:49,374 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 479 transitions. Word has length 85 [2024-11-07 16:05:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:05:49,375 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 479 transitions. [2024-11-07 16:05:49,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:05:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 479 transitions. [2024-11-07 16:05:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 16:05:49,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:05:49,376 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:05:49,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 16:05:49,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:05:49,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:05:49,377 INFO L85 PathProgramCache]: Analyzing trace with hash -820495531, now seen corresponding path program 1 times [2024-11-07 16:05:49,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:05:49,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173351295] [2024-11-07 16:05:49,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:05:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:05:49,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:05:49,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173351295] [2024-11-07 16:05:49,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173351295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:05:49,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:05:49,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:05:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429401028] [2024-11-07 16:05:49,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:05:49,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:05:49,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:05:49,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:05:49,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:05:49,572 INFO L87 Difference]: Start difference. First operand 341 states and 479 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:05:49,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:05:49,613 INFO L93 Difference]: Finished difference Result 335 states and 469 transitions. [2024-11-07 16:05:49,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:05:49,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2024-11-07 16:05:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:05:49,615 INFO L225 Difference]: With dead ends: 335 [2024-11-07 16:05:49,615 INFO L226 Difference]: Without dead ends: 335 [2024-11-07 16:05:49,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:05:49,615 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 9 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:05:49,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1334 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:05:49,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-07 16:05:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2024-11-07 16:05:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 321 states have (on average 1.4049844236760125) internal successors, (451), 328 states have internal predecessors, (451), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 16:05:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 469 transitions. [2024-11-07 16:05:49,621 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 469 transitions. Word has length 85 [2024-11-07 16:05:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:05:49,622 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 469 transitions. [2024-11-07 16:05:49,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:05:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 469 transitions. [2024-11-07 16:05:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 16:05:49,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:05:49,623 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:05:49,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 16:05:49,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:05:49,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:05:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1922224989, now seen corresponding path program 1 times [2024-11-07 16:05:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:05:49,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965490449] [2024-11-07 16:05:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:05:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:05:49,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:05:49,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965490449] [2024-11-07 16:05:49,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965490449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:05:49,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:05:49,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:05:49,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066297328] [2024-11-07 16:05:49,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:05:49,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:05:49,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:05:49,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:05:49,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:05:49,776 INFO L87 Difference]: Start difference. First operand 335 states and 469 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:05:49,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:05:49,820 INFO L93 Difference]: Finished difference Result 566 states and 804 transitions. [2024-11-07 16:05:49,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:05:49,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 85 [2024-11-07 16:05:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:05:49,824 INFO L225 Difference]: With dead ends: 566 [2024-11-07 16:05:49,825 INFO L226 Difference]: Without dead ends: 566 [2024-11-07 16:05:49,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:05:49,826 INFO L432 NwaCegarLoop]: 666 mSDtfsCounter, 269 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:05:49,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1119 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:05:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-07 16:05:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 562. [2024-11-07 16:05:49,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 543 states have (on average 1.423572744014733) internal successors, (773), 555 states have internal predecessors, (773), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 16:05:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 801 transitions. [2024-11-07 16:05:49,844 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 801 transitions. Word has length 85 [2024-11-07 16:05:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:05:49,845 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 801 transitions. [2024-11-07 16:05:49,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:05:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 801 transitions. [2024-11-07 16:05:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 16:05:49,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:05:49,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:05:49,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 16:05:49,848 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:05:49,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:05:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1430207620, now seen corresponding path program 1 times [2024-11-07 16:05:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:05:49,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526218971] [2024-11-07 16:05:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:49,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:05:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:50,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 16:05:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:50,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 16:05:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 16:05:50,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:05:50,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526218971] [2024-11-07 16:05:50,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526218971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:05:50,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:05:50,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:05:50,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286457905] [2024-11-07 16:05:50,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:05:50,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:05:50,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:05:50,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:05:50,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:05:50,193 INFO L87 Difference]: Start difference. First operand 562 states and 801 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:05:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:05:50,444 INFO L93 Difference]: Finished difference Result 812 states and 1174 transitions. [2024-11-07 16:05:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:05:50,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-07 16:05:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:05:50,448 INFO L225 Difference]: With dead ends: 812 [2024-11-07 16:05:50,448 INFO L226 Difference]: Without dead ends: 812 [2024-11-07 16:05:50,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:05:50,449 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 437 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:05:50,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1675 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:05:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-11-07 16:05:50,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 564. [2024-11-07 16:05:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 545 states have (on average 1.4220183486238531) internal successors, (775), 557 states have internal predecessors, (775), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 16:05:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 803 transitions. [2024-11-07 16:05:50,467 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 803 transitions. Word has length 100 [2024-11-07 16:05:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:05:50,467 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 803 transitions. [2024-11-07 16:05:50,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:05:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 803 transitions. [2024-11-07 16:05:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 16:05:50,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:05:50,469 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:05:50,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 16:05:50,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:05:50,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:05:50,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2096205932, now seen corresponding path program 1 times [2024-11-07 16:05:50,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:05:50,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837088477] [2024-11-07 16:05:50,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:50,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:05:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:50,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 16:05:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:50,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 16:05:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 16:05:50,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:05:50,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837088477] [2024-11-07 16:05:50,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837088477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:05:50,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:05:50,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:05:50,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746685013] [2024-11-07 16:05:50,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:05:50,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:05:50,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:05:50,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:05:50,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:05:50,768 INFO L87 Difference]: Start difference. First operand 564 states and 803 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:05:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:05:51,005 INFO L93 Difference]: Finished difference Result 483 states and 655 transitions. [2024-11-07 16:05:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:05:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-11-07 16:05:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:05:51,007 INFO L225 Difference]: With dead ends: 483 [2024-11-07 16:05:51,007 INFO L226 Difference]: Without dead ends: 483 [2024-11-07 16:05:51,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:05:51,008 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 51 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:05:51,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1327 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:05:51,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-07 16:05:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 480. [2024-11-07 16:05:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 461 states have (on average 1.3470715835140998) internal successors, (621), 473 states have internal predecessors, (621), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 16:05:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 649 transitions. [2024-11-07 16:05:51,016 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 649 transitions. Word has length 157 [2024-11-07 16:05:51,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:05:51,017 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 649 transitions. [2024-11-07 16:05:51,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:05:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 649 transitions. [2024-11-07 16:05:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 16:05:51,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:05:51,018 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:05:51,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 16:05:51,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:05:51,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:05:51,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1654505154, now seen corresponding path program 1 times [2024-11-07 16:05:51,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:05:51,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050045992] [2024-11-07 16:05:51,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:51,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:05:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:51,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 16:05:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:51,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 16:05:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 16:05:51,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:05:51,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050045992] [2024-11-07 16:05:51,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050045992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:05:51,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:05:51,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:05:51,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716875631] [2024-11-07 16:05:51,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:05:51,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:05:51,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:05:51,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:05:51,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:05:51,178 INFO L87 Difference]: Start difference. First operand 480 states and 649 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 4 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:05:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:05:51,351 INFO L93 Difference]: Finished difference Result 471 states and 635 transitions. [2024-11-07 16:05:51,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:05:51,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 4 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-11-07 16:05:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:05:51,355 INFO L225 Difference]: With dead ends: 471 [2024-11-07 16:05:51,356 INFO L226 Difference]: Without dead ends: 471 [2024-11-07 16:05:51,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:05:51,356 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 19 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:05:51,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1330 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:05:51,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-07 16:05:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 468. [2024-11-07 16:05:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 449 states have (on average 1.3385300668151447) internal successors, (601), 461 states have internal predecessors, (601), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 16:05:51,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 629 transitions. [2024-11-07 16:05:51,368 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 629 transitions. Word has length 157 [2024-11-07 16:05:51,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:05:51,369 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 629 transitions. [2024-11-07 16:05:51,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 4 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:05:51,369 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 629 transitions. [2024-11-07 16:05:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 16:05:51,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:05:51,370 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:05:51,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 16:05:51,372 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:05:51,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:05:51,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1895912758, now seen corresponding path program 1 times [2024-11-07 16:05:51,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:05:51,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210737628] [2024-11-07 16:05:51,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:51,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:05:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:51,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 16:05:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:51,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 16:05:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:05:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:05:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210737628] [2024-11-07 16:05:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210737628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:05:51,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:05:51,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:05:51,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837345697] [2024-11-07 16:05:51,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:05:51,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:05:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:05:51,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:05:51,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:05:51,576 INFO L87 Difference]: Start difference. First operand 468 states and 629 transitions. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:05:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:05:51,935 INFO L93 Difference]: Finished difference Result 554 states and 743 transitions. [2024-11-07 16:05:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:05:51,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-11-07 16:05:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:05:51,938 INFO L225 Difference]: With dead ends: 554 [2024-11-07 16:05:51,938 INFO L226 Difference]: Without dead ends: 554 [2024-11-07 16:05:51,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:05:51,939 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 796 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:05:51,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1462 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:05:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-07 16:05:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 370. [2024-11-07 16:05:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 356 states have (on average 1.3258426966292134) internal successors, (472), 363 states have internal predecessors, (472), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 16:05:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 490 transitions. [2024-11-07 16:05:51,948 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 490 transitions. Word has length 157 [2024-11-07 16:05:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:05:51,948 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 490 transitions. [2024-11-07 16:05:51,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:05:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 490 transitions. [2024-11-07 16:05:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 16:05:51,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:05:51,952 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:05:51,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 16:05:51,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:05:51,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:05:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1110105822, now seen corresponding path program 1 times [2024-11-07 16:05:51,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:05:51,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024345192] [2024-11-07 16:05:51,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:51,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:05:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:52,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 16:05:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:52,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 16:05:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:05:52,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:05:52,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024345192] [2024-11-07 16:05:52,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024345192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:05:52,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899703197] [2024-11-07 16:05:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:52,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:05:52,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:05:52,495 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:05:52,497 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:05:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:52,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:05:52,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:05:52,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:05:52,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 16:05:53,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:05:53,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:05:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:05:53,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899703197] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:05:53,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:05:53,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 13 [2024-11-07 16:05:53,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860608666] [2024-11-07 16:05:53,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:05:53,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 16:05:53,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:05:53,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 16:05:53,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-07 16:05:53,146 INFO L87 Difference]: Start difference. First operand 370 states and 490 transitions. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 12 states have internal predecessors, (329), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 16:05:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:05:53,607 INFO L93 Difference]: Finished difference Result 1094 states and 1466 transitions. [2024-11-07 16:05:53,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 16:05:53,608 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 12 states have internal predecessors, (329), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 167 [2024-11-07 16:05:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:05:53,611 INFO L225 Difference]: With dead ends: 1094 [2024-11-07 16:05:53,611 INFO L226 Difference]: Without dead ends: 1094 [2024-11-07 16:05:53,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 330 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-07 16:05:53,612 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 1569 mSDsluCounter, 3903 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 4430 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:05:53,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 4430 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:05:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2024-11-07 16:05:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 705. [2024-11-07 16:05:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 687 states have (on average 1.3231441048034935) internal successors, (909), 694 states have internal predecessors, (909), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 16:05:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 933 transitions. [2024-11-07 16:05:53,624 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 933 transitions. Word has length 167 [2024-11-07 16:05:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:05:53,624 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 933 transitions. [2024-11-07 16:05:53,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 12 states have internal predecessors, (329), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 16:05:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 933 transitions. [2024-11-07 16:05:53,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2024-11-07 16:05:53,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:05:53,628 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:05:53,644 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:05:53,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 16:05:53,828 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:05:53,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:05:53,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1860272923, now seen corresponding path program 1 times [2024-11-07 16:05:53,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:05:53,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727259222] [2024-11-07 16:05:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:53,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 16:05:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 16:05:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 16:05:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:05:56,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 16:05:56,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727259222] [2024-11-07 16:05:56,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727259222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 16:05:56,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015764904] [2024-11-07 16:05:56,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:56,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:05:56,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:05:56,357 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:05:56,359 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:05:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:05:56,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 16:05:56,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:05:56,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 16:05:57,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 16:05:57,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 16:05:57,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 16:05:57,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 16:05:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:05:57,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:05:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:05:57,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015764904] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:05:57,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 16:05:57,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 25 [2024-11-07 16:05:57,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216400832] [2024-11-07 16:05:57,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 16:05:57,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 16:05:57,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 16:05:57,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 16:05:57,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2024-11-07 16:05:57,884 INFO L87 Difference]: Start difference. First operand 705 states and 933 transitions. Second operand has 25 states, 25 states have (on average 40.52) internal successors, (1013), 24 states have internal predecessors, (1013), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 16:05:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:05:59,011 INFO L93 Difference]: Finished difference Result 2285 states and 3074 transitions. [2024-11-07 16:05:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-07 16:05:59,015 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 40.52) internal successors, (1013), 24 states have internal predecessors, (1013), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 395 [2024-11-07 16:05:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:05:59,023 INFO L225 Difference]: With dead ends: 2285 [2024-11-07 16:05:59,023 INFO L226 Difference]: Without dead ends: 2285 [2024-11-07 16:05:59,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 783 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=324, Invalid=866, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 16:05:59,025 INFO L432 NwaCegarLoop]: 1383 mSDtfsCounter, 3973 mSDsluCounter, 13998 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4018 SdHoareTripleChecker+Valid, 15381 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 16:05:59,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4018 Valid, 15381 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 16:05:59,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2024-11-07 16:05:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 1533. [2024-11-07 16:05:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1509 states have (on average 1.3220675944333995) internal successors, (1995), 1516 states have internal predecessors, (1995), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 16:05:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2031 transitions. [2024-11-07 16:05:59,058 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2031 transitions. Word has length 395 [2024-11-07 16:05:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:05:59,059 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 2031 transitions. [2024-11-07 16:05:59,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 40.52) internal successors, (1013), 24 states have internal predecessors, (1013), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 16:05:59,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2031 transitions. [2024-11-07 16:05:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-07 16:05:59,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:05:59,074 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:05:59,091 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:05:59,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 16:05:59,279 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:05:59,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:05:59,279 INFO L85 PathProgramCache]: Analyzing trace with hash 721246835, now seen corresponding path program 2 times [2024-11-07 16:05:59,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 16:05:59,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256595876] [2024-11-07 16:05:59,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:05:59,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms