./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 501447f5c37550c3f5e8fdfcef22269dce5065ef789f4faf9fbe7fcfc263a044 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:24:35,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:24:36,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-09 07:24:36,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:24:36,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:24:36,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:24:36,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:24:36,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:24:36,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:24:36,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:24:36,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:24:36,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:24:36,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:24:36,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:24:36,063 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:24:36,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:24:36,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:24:36,064 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:24:36,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:24:36,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:24:36,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:24:36,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:24:36,065 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:24:36,065 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:24:36,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:24:36,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:24:36,066 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:24:36,066 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:24:36,066 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:24:36,066 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:24:36,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:24:36,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:24:36,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:24:36,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:24:36,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:24:36,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:24:36,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:24:36,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:24:36,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:24:36,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:24:36,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:24:36,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:24:36,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:24:36,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:24:36,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:24:36,069 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 501447f5c37550c3f5e8fdfcef22269dce5065ef789f4faf9fbe7fcfc263a044 [2024-11-09 07:24:36,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:24:36,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:24:36,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:24:36,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:24:36,279 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:24:36,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i [2024-11-09 07:24:37,457 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:24:37,758 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:24:37,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-1.i [2024-11-09 07:24:37,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14b09328/7f11b21cc64049f58c7fc7442cab465c/FLAGa5bacd3e8 [2024-11-09 07:24:38,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14b09328/7f11b21cc64049f58c7fc7442cab465c [2024-11-09 07:24:38,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:24:38,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:24:38,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:24:38,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:24:38,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:24:38,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:38,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62fd8ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38, skipping insertion in model container [2024-11-09 07:24:38,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:38,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:24:38,550 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-09 07:24:38,562 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-09 07:24:38,567 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-09 07:24:38,569 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-09 07:24:38,576 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-09 07:24:38,591 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-09 07:24:38,592 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-09 07:24:38,593 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-09 07:24:38,593 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-09 07:24:38,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:24:38,605 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:24:38,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:24:38,733 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:24:38,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38 WrapperNode [2024-11-09 07:24:38,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:24:38,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:24:38,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:24:38,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:24:38,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:38,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:38,892 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3282 [2024-11-09 07:24:38,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:24:38,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:24:38,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:24:38,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:24:38,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:38,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:38,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:38,986 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [34, 2, 172]. 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 [4, 0, 42]. [2024-11-09 07:24:38,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:38,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:39,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:39,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:39,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:39,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:39,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:24:39,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:24:39,096 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:24:39,096 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:24:39,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38" (1/1) ... [2024-11-09 07:24:39,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:24:39,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:24:39,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:24:39,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:24:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 07:24:39,170 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 07:24:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:24:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:24:39,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 07:24:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 07:24:39,171 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 07:24:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:24:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:24:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 07:24:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 07:24:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 07:24:39,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 07:24:39,171 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 07:24:39,171 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 07:24:39,172 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 07:24:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:24:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:24:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:24:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:24:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:24:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:24:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:24:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:24:39,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:24:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:24:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:24:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:24:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 07:24:39,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:24:39,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:24:39,328 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:24:39,330 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:24:41,234 INFO L? ?]: Removed 799 outVars from TransFormulas that were not future-live. [2024-11-09 07:24:41,235 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:24:41,273 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:24:41,274 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 07:24:41,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:24:41 BoogieIcfgContainer [2024-11-09 07:24:41,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:24:41,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:24:41,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:24:41,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:24:41,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:24:38" (1/3) ... [2024-11-09 07:24:41,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ec0650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:24:41, skipping insertion in model container [2024-11-09 07:24:41,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:38" (2/3) ... [2024-11-09 07:24:41,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ec0650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:24:41, skipping insertion in model container [2024-11-09 07:24:41,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:24:41" (3/3) ... [2024-11-09 07:24:41,280 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test9-1.i [2024-11-09 07:24:41,293 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:24:41,294 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:24:41,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:24:41,377 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;@28e0b0dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:24:41,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 07:24:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 1375 states, 864 states have (on average 1.8391203703703705) internal successors, (1589), 1368 states have internal predecessors, (1589), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-09 07:24:41,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:24:41,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:24:41,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:24:41,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:24:41,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:24:41,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1582134003, now seen corresponding path program 1 times [2024-11-09 07:24:41,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:24:41,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483366590] [2024-11-09 07:24:41,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:24:41,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:24:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:41,539 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-09 07:24:41,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:24:41,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483366590] [2024-11-09 07:24:41,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483366590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:24:41,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:24:41,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:24:41,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407530543] [2024-11-09 07:24:41,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:24:41,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:24:41,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:24:41,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:24:41,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:24:41,573 INFO L87 Difference]: Start difference. First operand has 1375 states, 864 states have (on average 1.8391203703703705) internal successors, (1589), 1368 states have internal predecessors, (1589), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) 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-09 07:24:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:24:41,677 INFO L93 Difference]: Finished difference Result 1373 states and 2536 transitions. [2024-11-09 07:24:41,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:24:41,679 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-09 07:24:41,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:24:41,701 INFO L225 Difference]: With dead ends: 1373 [2024-11-09 07:24:41,702 INFO L226 Difference]: Without dead ends: 1371 [2024-11-09 07:24:41,703 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-09 07:24:41,705 INFO L432 NwaCegarLoop]: 2536 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, 2536 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-09 07:24:41,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:24:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2024-11-09 07:24:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1371. [2024-11-09 07:24:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 862 states have (on average 1.7703016241299303) internal successors, (1526), 1364 states have internal predecessors, (1526), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 07:24:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2534 transitions. [2024-11-09 07:24:41,945 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2534 transitions. Word has length 7 [2024-11-09 07:24:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:24:41,946 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 2534 transitions. [2024-11-09 07:24:41,946 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-09 07:24:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2534 transitions. [2024-11-09 07:24:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:24:41,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:24:41,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:24:41,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:24:41,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:24:41,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:24:41,948 INFO L85 PathProgramCache]: Analyzing trace with hash -940141398, now seen corresponding path program 1 times [2024-11-09 07:24:41,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:24:41,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385565631] [2024-11-09 07:24:41,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:24:41,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:24:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:42,135 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-09 07:24:42,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:24:42,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385565631] [2024-11-09 07:24:42,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385565631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:24:42,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:24:42,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:24:42,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118463899] [2024-11-09 07:24:42,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:24:42,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:24:42,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:24:42,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:24:42,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:24:42,138 INFO L87 Difference]: Start difference. First operand 1371 states and 2534 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-09 07:24:42,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:24:42,809 INFO L93 Difference]: Finished difference Result 2725 states and 5052 transitions. [2024-11-09 07:24:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:24:42,809 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-09 07:24:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:24:42,824 INFO L225 Difference]: With dead ends: 2725 [2024-11-09 07:24:42,824 INFO L226 Difference]: Without dead ends: 2725 [2024-11-09 07:24:42,825 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-09 07:24:42,826 INFO L432 NwaCegarLoop]: 2623 mSDtfsCounter, 1508 mSDsluCounter, 4630 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 7253 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:24:42,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 7253 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:24:42,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2024-11-09 07:24:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 1373. [2024-11-09 07:24:43,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 864 states have (on average 1.7685185185185186) internal successors, (1528), 1366 states have internal predecessors, (1528), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 07:24:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2536 transitions. [2024-11-09 07:24:43,073 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2536 transitions. Word has length 9 [2024-11-09 07:24:43,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:24:43,073 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 2536 transitions. [2024-11-09 07:24:43,073 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-09 07:24:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2536 transitions. [2024-11-09 07:24:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 07:24:43,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:24:43,075 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-09 07:24:43,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:24:43,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:24:43,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:24:43,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1595289559, now seen corresponding path program 1 times [2024-11-09 07:24:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:24:43,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206078227] [2024-11-09 07:24:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:24:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:24:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:43,283 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-09 07:24:43,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:24:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206078227] [2024-11-09 07:24:43,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206078227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:24:43,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:24:43,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:24:43,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583987164] [2024-11-09 07:24:43,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:24:43,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:24:43,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:24:43,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:24:43,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:24:43,288 INFO L87 Difference]: Start difference. First operand 1373 states and 2536 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-09 07:24:43,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:24:43,387 INFO L93 Difference]: Finished difference Result 1376 states and 2532 transitions. [2024-11-09 07:24:43,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:24:43,387 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-09 07:24:43,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:24:43,392 INFO L225 Difference]: With dead ends: 1376 [2024-11-09 07:24:43,392 INFO L226 Difference]: Without dead ends: 1376 [2024-11-09 07:24:43,392 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-09 07:24:43,393 INFO L432 NwaCegarLoop]: 2506 mSDtfsCounter, 106 mSDsluCounter, 4919 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 7425 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:24:43,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 7425 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:24:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-09 07:24:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1373. [2024-11-09 07:24:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 864 states have (on average 1.7604166666666667) internal successors, (1521), 1366 states have internal predecessors, (1521), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 07:24:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2529 transitions. [2024-11-09 07:24:43,471 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2529 transitions. Word has length 85 [2024-11-09 07:24:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:24:43,472 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 2529 transitions. [2024-11-09 07:24:43,472 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-09 07:24:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2529 transitions. [2024-11-09 07:24:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 07:24:43,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:24:43,476 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-09 07:24:43,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:24:43,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:24:43,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:24:43,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2124143963, now seen corresponding path program 1 times [2024-11-09 07:24:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:24:43,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113511753] [2024-11-09 07:24:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:24:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:24:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:43,624 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-09 07:24:43,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:24:43,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113511753] [2024-11-09 07:24:43,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113511753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:24:43,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:24:43,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:24:43,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172498291] [2024-11-09 07:24:43,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:24:43,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:24:43,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:24:43,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:24:43,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:24:43,627 INFO L87 Difference]: Start difference. First operand 1373 states and 2529 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-09 07:24:43,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:24:43,700 INFO L93 Difference]: Finished difference Result 1325 states and 2449 transitions. [2024-11-09 07:24:43,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:24:43,703 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-09 07:24:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:24:43,708 INFO L225 Difference]: With dead ends: 1325 [2024-11-09 07:24:43,708 INFO L226 Difference]: Without dead ends: 1325 [2024-11-09 07:24:43,708 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-09 07:24:43,709 INFO L432 NwaCegarLoop]: 2431 mSDtfsCounter, 9 mSDsluCounter, 4843 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 7274 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:24:43,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 7274 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:24:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-11-09 07:24:43,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2024-11-09 07:24:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 816 states have (on average 1.7659313725490196) internal successors, (1441), 1318 states have internal predecessors, (1441), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 07:24:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2449 transitions. [2024-11-09 07:24:43,785 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 2449 transitions. Word has length 85 [2024-11-09 07:24:43,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:24:43,785 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 2449 transitions. [2024-11-09 07:24:43,786 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-09 07:24:43,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 2449 transitions. [2024-11-09 07:24:43,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 07:24:43,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:24:43,787 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-09 07:24:43,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:24:43,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:24:43,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:24:43,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1922320029, now seen corresponding path program 1 times [2024-11-09 07:24:43,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:24:43,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552628326] [2024-11-09 07:24:43,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:24:43,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:24:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:43,927 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-09 07:24:43,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:24:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552628326] [2024-11-09 07:24:43,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552628326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:24:43,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:24:43,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:24:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337881026] [2024-11-09 07:24:43,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:24:43,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:24:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:24:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:24:43,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:24:43,930 INFO L87 Difference]: Start difference. First operand 1325 states and 2449 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-09 07:24:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:24:44,002 INFO L93 Difference]: Finished difference Result 2546 states and 4764 transitions. [2024-11-09 07:24:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:24:44,003 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-09 07:24:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:24:44,015 INFO L225 Difference]: With dead ends: 2546 [2024-11-09 07:24:44,015 INFO L226 Difference]: Without dead ends: 2546 [2024-11-09 07:24:44,015 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-09 07:24:44,016 INFO L432 NwaCegarLoop]: 2653 mSDtfsCounter, 1259 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 5086 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-09 07:24:44,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 5086 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:24:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2024-11-09 07:24:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2542. [2024-11-09 07:24:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 1533 states have (on average 1.7958251793868232) internal successors, (2753), 2535 states have internal predecessors, (2753), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 07:24:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4761 transitions. [2024-11-09 07:24:44,219 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4761 transitions. Word has length 85 [2024-11-09 07:24:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:24:44,220 INFO L471 AbstractCegarLoop]: Abstraction has 2542 states and 4761 transitions. [2024-11-09 07:24:44,220 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-09 07:24:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4761 transitions. [2024-11-09 07:24:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 07:24:44,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:24:44,223 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-09 07:24:44,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:24:44,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:24:44,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:24:44,226 INFO L85 PathProgramCache]: Analyzing trace with hash 559394108, now seen corresponding path program 1 times [2024-11-09 07:24:44,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:24:44,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915710107] [2024-11-09 07:24:44,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:24:44,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:24:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:24:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:44,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:24:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:44,533 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-09 07:24:44,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:24:44,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915710107] [2024-11-09 07:24:44,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915710107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:24:44,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:24:44,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:24:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383418750] [2024-11-09 07:24:44,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:24:44,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:24:44,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:24:44,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:24:44,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:24:44,537 INFO L87 Difference]: Start difference. First operand 2542 states and 4761 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-09 07:24:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:24:47,949 INFO L93 Difference]: Finished difference Result 4772 states and 9094 transitions. [2024-11-09 07:24:47,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:24:47,950 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-09 07:24:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:24:47,968 INFO L225 Difference]: With dead ends: 4772 [2024-11-09 07:24:47,969 INFO L226 Difference]: Without dead ends: 4772 [2024-11-09 07:24:47,969 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-09 07:24:47,971 INFO L432 NwaCegarLoop]: 2632 mSDtfsCounter, 1427 mSDsluCounter, 4698 mSDsCounter, 0 mSdLazyCounter, 2580 mSolverCounterSat, 1005 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 7330 SdHoareTripleChecker+Invalid, 3585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1005 IncrementalHoareTripleChecker+Valid, 2580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:24:47,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1933 Valid, 7330 Invalid, 3585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1005 Valid, 2580 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 07:24:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2024-11-09 07:24:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 2544. [2024-11-09 07:24:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 1535 states have (on average 1.794788273615635) internal successors, (2755), 2537 states have internal predecessors, (2755), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 07:24:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 4763 transitions. [2024-11-09 07:24:48,305 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 4763 transitions. Word has length 100 [2024-11-09 07:24:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:24:48,305 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 4763 transitions. [2024-11-09 07:24:48,306 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-09 07:24:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 4763 transitions. [2024-11-09 07:24:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 07:24:48,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:24:48,310 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-09 07:24:48,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:24:48,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:24:48,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:24:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash 114127026, now seen corresponding path program 1 times [2024-11-09 07:24:48,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:24:48,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911299456] [2024-11-09 07:24:48,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:24:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:24:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:48,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:24:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:48,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:24:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:48,564 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-09 07:24:48,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:24:48,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911299456] [2024-11-09 07:24:48,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911299456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:24:48,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:24:48,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:24:48,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254220273] [2024-11-09 07:24:48,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:24:48,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:24:48,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:24:48,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:24:48,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:24:48,570 INFO L87 Difference]: Start difference. First operand 2544 states and 4763 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-09 07:24:50,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:24:50,154 INFO L93 Difference]: Finished difference Result 2463 states and 4615 transitions. [2024-11-09 07:24:50,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:24:50,158 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-09 07:24:50,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:24:50,168 INFO L225 Difference]: With dead ends: 2463 [2024-11-09 07:24:50,168 INFO L226 Difference]: Without dead ends: 2463 [2024-11-09 07:24:50,169 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-09 07:24:50,170 INFO L432 NwaCegarLoop]: 2334 mSDtfsCounter, 32 mSDsluCounter, 4933 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 7267 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:24:50,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 7267 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 07:24:50,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2024-11-09 07:24:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2460. [2024-11-09 07:24:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 1451 states have (on average 1.7925568573397657) internal successors, (2601), 2453 states have internal predecessors, (2601), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 07:24:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 4609 transitions. [2024-11-09 07:24:50,394 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 4609 transitions. Word has length 157 [2024-11-09 07:24:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:24:50,395 INFO L471 AbstractCegarLoop]: Abstraction has 2460 states and 4609 transitions. [2024-11-09 07:24:50,395 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-09 07:24:50,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 4609 transitions. [2024-11-09 07:24:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 07:24:50,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:24:50,397 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-09 07:24:50,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:24:50,398 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:24:50,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:24:50,398 INFO L85 PathProgramCache]: Analyzing trace with hash -430129184, now seen corresponding path program 1 times [2024-11-09 07:24:50,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:24:50,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707865389] [2024-11-09 07:24:50,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:24:50,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:24:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:50,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:24:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:50,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:24:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:50,617 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-09 07:24:50,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:24:50,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707865389] [2024-11-09 07:24:50,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707865389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:24:50,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:24:50,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:24:50,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75184673] [2024-11-09 07:24:50,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:24:50,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:24:50,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:24:50,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:24:50,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:24:50,620 INFO L87 Difference]: Start difference. First operand 2460 states and 4609 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-09 07:24:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:24:52,087 INFO L93 Difference]: Finished difference Result 2451 states and 4595 transitions. [2024-11-09 07:24:52,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:24:52,087 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-09 07:24:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:24:52,096 INFO L225 Difference]: With dead ends: 2451 [2024-11-09 07:24:52,096 INFO L226 Difference]: Without dead ends: 2451 [2024-11-09 07:24:52,096 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-09 07:24:52,097 INFO L432 NwaCegarLoop]: 2336 mSDtfsCounter, 19 mSDsluCounter, 4934 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7270 SdHoareTripleChecker+Invalid, 2137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:24:52,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7270 Invalid, 2137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 07:24:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2024-11-09 07:24:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2448. [2024-11-09 07:24:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 1439 states have (on average 1.7936066712995136) internal successors, (2581), 2441 states have internal predecessors, (2581), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 07:24:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 4589 transitions. [2024-11-09 07:24:52,290 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 4589 transitions. Word has length 157 [2024-11-09 07:24:52,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:24:52,291 INFO L471 AbstractCegarLoop]: Abstraction has 2448 states and 4589 transitions. [2024-11-09 07:24:52,291 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-09 07:24:52,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 4589 transitions. [2024-11-09 07:24:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 07:24:52,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:24:52,292 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-09 07:24:52,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:24:52,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:24:52,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:24:52,293 INFO L85 PathProgramCache]: Analyzing trace with hash 314420200, now seen corresponding path program 1 times [2024-11-09 07:24:52,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:24:52,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062232306] [2024-11-09 07:24:52,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:24:52,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:24:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:52,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:24:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:52,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:24:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:52,527 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-09 07:24:52,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:24:52,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062232306] [2024-11-09 07:24:52,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062232306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:24:52,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:24:52,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:24:52,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221742285] [2024-11-09 07:24:52,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:24:52,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:24:52,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:24:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:24:52,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:24:52,529 INFO L87 Difference]: Start difference. First operand 2448 states and 4589 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-09 07:24:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:24:55,415 INFO L93 Difference]: Finished difference Result 2534 states and 4703 transitions. [2024-11-09 07:24:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:24:55,416 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-09 07:24:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:24:55,424 INFO L225 Difference]: With dead ends: 2534 [2024-11-09 07:24:55,424 INFO L226 Difference]: Without dead ends: 2534 [2024-11-09 07:24:55,424 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-09 07:24:55,424 INFO L432 NwaCegarLoop]: 2526 mSDtfsCounter, 6040 mSDsluCounter, 3843 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 2857 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6542 SdHoareTripleChecker+Valid, 6369 SdHoareTripleChecker+Invalid, 4135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2857 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:24:55,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6542 Valid, 6369 Invalid, 4135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2857 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 07:24:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2024-11-09 07:24:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 1360. [2024-11-09 07:24:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 851 states have (on average 1.7179788484136311) internal successors, (1462), 1353 states have internal predecessors, (1462), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 07:24:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2470 transitions. [2024-11-09 07:24:55,585 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2470 transitions. Word has length 157 [2024-11-09 07:24:55,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:24:55,585 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 2470 transitions. [2024-11-09 07:24:55,585 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-09 07:24:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2470 transitions. [2024-11-09 07:24:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 07:24:55,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:24:55,586 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-09 07:24:55,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:24:55,587 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:24:55,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:24:55,587 INFO L85 PathProgramCache]: Analyzing trace with hash -565706756, now seen corresponding path program 1 times [2024-11-09 07:24:55,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:24:55,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499282177] [2024-11-09 07:24:55,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:24:55,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:24:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:56,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:24:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:56,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:24:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:56,207 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-09 07:24:56,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:24:56,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499282177] [2024-11-09 07:24:56,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499282177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:24:56,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142724737] [2024-11-09 07:24:56,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:24:56,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:24:56,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:24:56,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:24:56,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:24:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:24:56,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:24:56,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:24:56,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:24:56,711 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 25 treesize of output 13 [2024-11-09 07:24:56,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:24:56,725 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-09 07:24:56,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:24:56,893 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-09 07:24:56,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142724737] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:24:56,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:24:56,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2024-11-09 07:24:56,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86319749] [2024-11-09 07:24:56,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:24:56,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:24:56,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:24:56,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:24:56,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:24:56,897 INFO L87 Difference]: Start difference. First operand 1360 states and 2470 transitions. Second operand has 12 states, 12 states have (on average 20.833333333333332) internal successors, (250), 11 states have internal predecessors, (250), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 07:25:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:02,737 INFO L93 Difference]: Finished difference Result 4064 states and 7406 transitions. [2024-11-09 07:25:02,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:25:02,738 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.833333333333332) internal successors, (250), 11 states have internal predecessors, (250), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 167 [2024-11-09 07:25:02,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:02,750 INFO L225 Difference]: With dead ends: 4064 [2024-11-09 07:25:02,752 INFO L226 Difference]: Without dead ends: 4064 [2024-11-09 07:25:02,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 331 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:25:02,753 INFO L432 NwaCegarLoop]: 1879 mSDtfsCounter, 5533 mSDsluCounter, 11711 mSDsCounter, 0 mSdLazyCounter, 6326 mSolverCounterSat, 3020 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6545 SdHoareTripleChecker+Valid, 13590 SdHoareTripleChecker+Invalid, 9346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3020 IncrementalHoareTripleChecker+Valid, 6326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:25:02,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6545 Valid, 13590 Invalid, 9346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3020 Valid, 6326 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-09 07:25:02,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2024-11-09 07:25:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 1695. [2024-11-09 07:25:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1182 states have (on average 1.6065989847715736) internal successors, (1899), 1684 states have internal predecessors, (1899), 508 states have call successors, (508), 4 states have call predecessors, (508), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2024-11-09 07:25:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2913 transitions. [2024-11-09 07:25:03,019 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2913 transitions. Word has length 167 [2024-11-09 07:25:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:03,019 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 2913 transitions. [2024-11-09 07:25:03,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.833333333333332) internal successors, (250), 11 states have internal predecessors, (250), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 07:25:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2913 transitions. [2024-11-09 07:25:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2024-11-09 07:25:03,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:03,023 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-09 07:25:03,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:25:03,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 07:25:03,224 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:03,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash -197599741, now seen corresponding path program 1 times [2024-11-09 07:25:03,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:25:03,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428465378] [2024-11-09 07:25:03,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:03,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:25:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:05,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:25:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:05,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:25:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:05,875 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-09 07:25:05,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:25:05,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428465378] [2024-11-09 07:25:05,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428465378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:25:05,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895365297] [2024-11-09 07:25:05,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:05,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:25:05,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:25:05,877 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:25:05,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:25:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:06,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:25:06,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:06,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:25:06,568 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 25 treesize of output 13 [2024-11-09 07:25:06,651 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 25 treesize of output 13 [2024-11-09 07:25:06,737 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 25 treesize of output 13 [2024-11-09 07:25:06,819 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 25 treesize of output 13 [2024-11-09 07:25:06,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:25:06,827 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-09 07:25:06,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:25:07,249 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-09 07:25:07,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895365297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:25:07,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:25:07,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2024-11-09 07:25:07,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396088750] [2024-11-09 07:25:07,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:25:07,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:25:07,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:25:07,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:25:07,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:25:07,252 INFO L87 Difference]: Start difference. First operand 1695 states and 2913 transitions. Second operand has 21 states, 21 states have (on average 33.904761904761905) internal successors, (712), 20 states have internal predecessors, (712), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 07:25:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:19,061 INFO L93 Difference]: Finished difference Result 9336 states and 17102 transitions. [2024-11-09 07:25:19,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 07:25:19,062 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 33.904761904761905) internal successors, (712), 20 states have internal predecessors, (712), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 395 [2024-11-09 07:25:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:19,079 INFO L225 Difference]: With dead ends: 9336 [2024-11-09 07:25:19,079 INFO L226 Difference]: Without dead ends: 9336 [2024-11-09 07:25:19,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 787 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2024-11-09 07:25:19,080 INFO L432 NwaCegarLoop]: 1879 mSDtfsCounter, 16950 mSDsluCounter, 15536 mSDsCounter, 0 mSdLazyCounter, 10781 mSolverCounterSat, 6797 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19974 SdHoareTripleChecker+Valid, 17415 SdHoareTripleChecker+Invalid, 17578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6797 IncrementalHoareTripleChecker+Valid, 10781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:25:19,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19974 Valid, 17415 Invalid, 17578 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6797 Valid, 10781 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2024-11-09 07:25:19,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9336 states. [2024-11-09 07:25:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9336 to 2523. [2024-11-09 07:25:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2004 states have (on average 1.4895209580838322) internal successors, (2985), 2506 states have internal predecessors, (2985), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-09 07:25:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 4011 transitions. [2024-11-09 07:25:19,704 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 4011 transitions. Word has length 395 [2024-11-09 07:25:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:19,705 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 4011 transitions. [2024-11-09 07:25:19,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 33.904761904761905) internal successors, (712), 20 states have internal predecessors, (712), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 07:25:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 4011 transitions. [2024-11-09 07:25:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-09 07:25:19,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:19,716 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-09 07:25:19,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:25:19,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 07:25:19,918 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:19,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:19,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2127414383, now seen corresponding path program 2 times [2024-11-09 07:25:19,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:25:19,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363546653] [2024-11-09 07:25:19,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:19,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:25:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:28,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:25:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:28,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:25:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:28,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:25:28,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:25:28,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363546653] [2024-11-09 07:25:28,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363546653] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:25:28,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219960554] [2024-11-09 07:25:28,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:25:28,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:25:28,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:25:28,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:25:28,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:25:29,445 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:25:29,446 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:25:29,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:25:29,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:29,483 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-09 07:25:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-09 07:25:30,006 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:25:30,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219960554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:25:30,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:25:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [26] total 33 [2024-11-09 07:25:30,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644389431] [2024-11-09 07:25:30,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:25:30,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:25:30,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:25:30,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:25:30,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 07:25:30,009 INFO L87 Difference]: Start difference. First operand 2523 states and 4011 transitions. Second operand has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 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-09 07:25:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:32,605 INFO L93 Difference]: Finished difference Result 3631 states and 6154 transitions. [2024-11-09 07:25:32,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:25:32,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 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 851 [2024-11-09 07:25:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:32,614 INFO L225 Difference]: With dead ends: 3631 [2024-11-09 07:25:32,614 INFO L226 Difference]: Without dead ends: 3631 [2024-11-09 07:25:32,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 857 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 07:25:32,615 INFO L432 NwaCegarLoop]: 2462 mSDtfsCounter, 1327 mSDsluCounter, 9395 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1830 SdHoareTripleChecker+Valid, 11857 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:25:32,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1830 Valid, 11857 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 07:25:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2024-11-09 07:25:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 2552. [2024-11-09 07:25:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2033 states have (on average 1.4825381210034432) internal successors, (3014), 2535 states have internal predecessors, (3014), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-09 07:25:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 4040 transitions. [2024-11-09 07:25:32,793 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 4040 transitions. Word has length 851 [2024-11-09 07:25:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:32,793 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 4040 transitions. [2024-11-09 07:25:32,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 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-09 07:25:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 4040 transitions. [2024-11-09 07:25:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2024-11-09 07:25:32,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:32,841 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, 1] [2024-11-09 07:25:32,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:25:33,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:25:33,042 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:33,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:33,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1342271983, now seen corresponding path program 1 times [2024-11-09 07:25:33,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:25:33,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94461509] [2024-11-09 07:25:33,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:33,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:25:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:41,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:25:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:41,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:25:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:25:41,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:25:41,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94461509] [2024-11-09 07:25:41,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94461509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:25:41,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017301131] [2024-11-09 07:25:41,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:41,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:25:41,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:25:41,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:25:41,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:25:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:42,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 4166 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:25:42,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:42,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:25:42,720 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 25 treesize of output 13 [2024-11-09 07:25:42,785 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 25 treesize of output 13 [2024-11-09 07:25:42,850 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 25 treesize of output 13 [2024-11-09 07:25:42,920 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 25 treesize of output 13 [2024-11-09 07:25:42,989 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 25 treesize of output 13 [2024-11-09 07:25:43,053 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 25 treesize of output 13 [2024-11-09 07:25:43,121 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 25 treesize of output 13 [2024-11-09 07:25:43,196 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 25 treesize of output 13 [2024-11-09 07:25:43,274 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 25 treesize of output 13 [2024-11-09 07:25:43,340 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 25 treesize of output 13 [2024-11-09 07:25:43,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:25:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:25:43,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:25:44,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:25:44,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017301131] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:25:44,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:25:44,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15, 14] total 39 [2024-11-09 07:25:44,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872217039] [2024-11-09 07:25:44,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:25:44,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 07:25:44,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:25:44,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 07:25:44,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=909, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 07:25:44,241 INFO L87 Difference]: Start difference. First operand 2552 states and 4040 transitions. Second operand has 39 states, 39 states have (on average 41.97435897435897) internal successors, (1637), 38 states have internal predecessors, (1637), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)