./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3061b6dc 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_BER_test5-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 df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:12:33,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:12:33,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:12:33,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:12:33,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:12:33,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:12:33,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:12:33,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:12:33,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:12:33,716 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:12:33,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:12:33,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:12:33,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:12:33,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:12:33,718 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:12:33,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:12:33,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:12:33,720 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:12:33,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:12:33,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:12:33,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:12:33,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:12:33,722 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:12:33,722 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:12:33,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:12:33,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:12:33,723 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:12:33,723 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:12:33,724 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:12:33,724 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:12:33,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:12:33,724 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:12:33,725 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:12:33,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:12:33,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:12:33,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:12:33,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:12:33,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:12:33,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:12:33,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:12:33,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:12:33,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:12:33,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:12:33,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:12:33,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:12:33,728 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 -> df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c [2024-11-19 06:12:33,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:12:34,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:12:34,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:12:34,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:12:34,035 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:12:34,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2024-11-19 06:12:35,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:12:36,009 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:12:36,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2024-11-19 06:12:36,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cb05288c/d6c28e608a6d47529aa4c7c48d1c2d85/FLAGa6b10e4dd [2024-11-19 06:12:36,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cb05288c/d6c28e608a6d47529aa4c7c48d1c2d85 [2024-11-19 06:12:36,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:12:36,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:12:36,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:12:36,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:12:36,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:12:36,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:12:36" (1/1) ... [2024-11-19 06:12:36,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3924770e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:36, skipping insertion in model container [2024-11-19 06:12:36,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:12:36" (1/1) ... [2024-11-19 06:12:36,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:12:36,671 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-19 06:12:36,718 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-19 06:12:36,726 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-19 06:12:36,731 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-19 06:12:36,739 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-19 06:12:36,788 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-19 06:12:36,794 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-19 06:12:36,796 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:36,801 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-19 06:12:36,833 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-19 06:12:36,837 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-19 06:12:36,839 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-19 06:12:36,840 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-19 06:12:36,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:12:36,871 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:12:36,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:12:37,021 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:12:37,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37 WrapperNode [2024-11-19 06:12:37,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:12:37,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:12:37,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:12:37,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:12:37,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37" (1/1) ... [2024-11-19 06:12:37,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37" (1/1) ... [2024-11-19 06:12:37,190 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2036 [2024-11-19 06:12:37,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:12:37,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:12:37,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:12:37,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:12:37,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37" (1/1) ... [2024-11-19 06:12:37,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37" (1/1) ... [2024-11-19 06:12:37,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37" (1/1) ... [2024-11-19 06:12:37,341 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2024-11-19 06:12:37,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37" (1/1) ... [2024-11-19 06:12:37,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37" (1/1) ... [2024-11-19 06:12:37,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37" (1/1) ... [2024-11-19 06:12:37,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37" (1/1) ... [2024-11-19 06:12:37,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37" (1/1) ... [2024-11-19 06:12:37,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37" (1/1) ... [2024-11-19 06:12:37,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:12:37,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:12:37,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:12:37,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:12:37,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37" (1/1) ... [2024-11-19 06:12:37,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:12:37,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:12:37,521 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-19 06:12:37,526 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-19 06:12:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:12:37,582 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:12:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:12:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:12:37,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 06:12:37,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 06:12:37,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 06:12:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:12:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:12:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 06:12:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 06:12:37,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 06:12:37,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 06:12:37,587 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 06:12:37,588 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 06:12:37,588 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 06:12:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:12:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:12:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:12:37,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:12:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:12:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:12:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:12:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:12:37,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:12:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:12:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:12:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:12:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 06:12:37,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:12:37,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:12:37,877 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:12:37,879 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:12:40,142 INFO L? ?]: Removed 485 outVars from TransFormulas that were not future-live. [2024-11-19 06:12:40,142 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:12:40,166 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:12:40,166 INFO L316 CfgBuilder]: Removed 83 assume(true) statements. [2024-11-19 06:12:40,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:12:40 BoogieIcfgContainer [2024-11-19 06:12:40,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:12:40,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:12:40,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:12:40,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:12:40,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:12:36" (1/3) ... [2024-11-19 06:12:40,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd7c666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:12:40, skipping insertion in model container [2024-11-19 06:12:40,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:37" (2/3) ... [2024-11-19 06:12:40,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd7c666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:12:40, skipping insertion in model container [2024-11-19 06:12:40,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:12:40" (3/3) ... [2024-11-19 06:12:40,179 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-1.i [2024-11-19 06:12:40,198 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:12:40,198 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:12:40,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:12:40,283 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;@617778fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:12:40,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:12:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 573 states, 554 states have (on average 1.6245487364620939) internal successors, (900), 563 states have internal predecessors, (900), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 06:12:40,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:12:40,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:40,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:12:40,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:40,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:40,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2051748014, now seen corresponding path program 1 times [2024-11-19 06:12:40,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:12:40,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257280459] [2024-11-19 06:12:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:12:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:40,574 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-19 06:12:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:12:40,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257280459] [2024-11-19 06:12:40,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257280459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:40,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:12:40,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:12:40,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292740318] [2024-11-19 06:12:40,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:40,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:12:40,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:12:40,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:12:40,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:12:40,629 INFO L87 Difference]: Start difference. First operand has 573 states, 554 states have (on average 1.6245487364620939) internal successors, (900), 563 states have internal predecessors, (900), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-19 06:12:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:40,798 INFO L93 Difference]: Finished difference Result 1122 states and 1642 transitions. [2024-11-19 06:12:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:12:40,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-19 06:12:40,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:40,831 INFO L225 Difference]: With dead ends: 1122 [2024-11-19 06:12:40,832 INFO L226 Difference]: Without dead ends: 1120 [2024-11-19 06:12:40,834 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-19 06:12:40,839 INFO L432 NwaCegarLoop]: 919 mSDtfsCounter, 786 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:12:40,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1741 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:12:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-11-19 06:12:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 571. [2024-11-19 06:12:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 554 states have (on average 1.4566787003610109) internal successors, (807), 561 states have internal predecessors, (807), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 06:12:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 831 transitions. [2024-11-19 06:12:40,953 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 831 transitions. Word has length 7 [2024-11-19 06:12:40,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:40,953 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 831 transitions. [2024-11-19 06:12:40,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-19 06:12:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 831 transitions. [2024-11-19 06:12:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-19 06:12:40,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:40,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:40,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:12:40,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:40,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash -897687887, now seen corresponding path program 1 times [2024-11-19 06:12:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:12:40,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514007947] [2024-11-19 06:12:40,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:40,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:12:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:12:41,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:12:41,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514007947] [2024-11-19 06:12:41,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514007947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:41,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:12:41,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:12:41,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410557178] [2024-11-19 06:12:41,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:41,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:12:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:12:41,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:12:41,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:12:41,774 INFO L87 Difference]: Start difference. First operand 571 states and 831 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:12:41,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:41,878 INFO L93 Difference]: Finished difference Result 574 states and 827 transitions. [2024-11-19 06:12:41,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:12:41,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2024-11-19 06:12:41,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:41,882 INFO L225 Difference]: With dead ends: 574 [2024-11-19 06:12:41,883 INFO L226 Difference]: Without dead ends: 574 [2024-11-19 06:12:41,883 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-19 06:12:41,886 INFO L432 NwaCegarLoop]: 801 mSDtfsCounter, 105 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:12:41,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2310 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:12:41,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-19 06:12:41,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 571. [2024-11-19 06:12:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 554 states have (on average 1.444043321299639) internal successors, (800), 561 states have internal predecessors, (800), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 06:12:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 824 transitions. [2024-11-19 06:12:41,920 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 824 transitions. Word has length 210 [2024-11-19 06:12:41,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:41,921 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 824 transitions. [2024-11-19 06:12:41,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:12:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 824 transitions. [2024-11-19 06:12:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-19 06:12:41,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:41,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:41,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:12:41,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:41,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1975652059, now seen corresponding path program 1 times [2024-11-19 06:12:41,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:12:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602276646] [2024-11-19 06:12:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:12:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:12:42,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:12:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602276646] [2024-11-19 06:12:42,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602276646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:42,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:12:42,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:12:42,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547773343] [2024-11-19 06:12:42,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:42,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:12:42,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:12:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:12:42,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:12:42,308 INFO L87 Difference]: Start difference. First operand 571 states and 824 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:12:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:42,351 INFO L93 Difference]: Finished difference Result 700 states and 1012 transitions. [2024-11-19 06:12:42,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:12:42,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2024-11-19 06:12:42,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:42,360 INFO L225 Difference]: With dead ends: 700 [2024-11-19 06:12:42,360 INFO L226 Difference]: Without dead ends: 700 [2024-11-19 06:12:42,361 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-19 06:12:42,363 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 134 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:12:42,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1635 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:12:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-19 06:12:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2024-11-19 06:12:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 683 states have (on average 1.4465592972181551) internal successors, (988), 690 states have internal predecessors, (988), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 06:12:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1012 transitions. [2024-11-19 06:12:42,389 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1012 transitions. Word has length 210 [2024-11-19 06:12:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:42,390 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1012 transitions. [2024-11-19 06:12:42,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:12:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1012 transitions. [2024-11-19 06:12:42,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-19 06:12:42,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:42,394 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:42,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:12:42,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:42,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:42,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1182561125, now seen corresponding path program 1 times [2024-11-19 06:12:42,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:12:42,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879325437] [2024-11-19 06:12:42,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:42,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:12:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:12:42,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:12:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879325437] [2024-11-19 06:12:42,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879325437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:42,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:12:42,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:12:42,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502727455] [2024-11-19 06:12:42,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:42,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:12:42,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:12:42,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:12:42,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:12:42,918 INFO L87 Difference]: Start difference. First operand 700 states and 1012 transitions. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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-19 06:12:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:43,030 INFO L93 Difference]: Finished difference Result 658 states and 935 transitions. [2024-11-19 06:12:43,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:12:43,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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 225 [2024-11-19 06:12:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:43,036 INFO L225 Difference]: With dead ends: 658 [2024-11-19 06:12:43,036 INFO L226 Difference]: Without dead ends: 658 [2024-11-19 06:12:43,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:12:43,038 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 14 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:12:43,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2845 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:12:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-19 06:12:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2024-11-19 06:12:43,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 641 states have (on average 1.421216848673947) internal successors, (911), 648 states have internal predecessors, (911), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 06:12:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 935 transitions. [2024-11-19 06:12:43,059 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 935 transitions. Word has length 225 [2024-11-19 06:12:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:43,060 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 935 transitions. [2024-11-19 06:12:43,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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-19 06:12:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 935 transitions. [2024-11-19 06:12:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-19 06:12:43,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:43,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:43,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:12:43,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:43,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:43,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1723329399, now seen corresponding path program 1 times [2024-11-19 06:12:43,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:12:43,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785998624] [2024-11-19 06:12:43,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:43,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:12:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:12:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:12:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785998624] [2024-11-19 06:12:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785998624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:43,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:12:43,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:12:43,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905385755] [2024-11-19 06:12:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:43,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:12:43,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:12:43,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:12:43,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:12:43,416 INFO L87 Difference]: Start difference. First operand 658 states and 935 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 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-19 06:12:43,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:43,481 INFO L93 Difference]: Finished difference Result 652 states and 925 transitions. [2024-11-19 06:12:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:12:43,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 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 225 [2024-11-19 06:12:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:43,485 INFO L225 Difference]: With dead ends: 652 [2024-11-19 06:12:43,485 INFO L226 Difference]: Without dead ends: 652 [2024-11-19 06:12:43,486 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-19 06:12:43,487 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 9 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:12:43,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2138 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:12:43,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-19 06:12:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2024-11-19 06:12:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 635 states have (on average 1.4188976377952756) internal successors, (901), 642 states have internal predecessors, (901), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 06:12:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 925 transitions. [2024-11-19 06:12:43,504 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 925 transitions. Word has length 225 [2024-11-19 06:12:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:43,504 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 925 transitions. [2024-11-19 06:12:43,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 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-19 06:12:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 925 transitions. [2024-11-19 06:12:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-19 06:12:43,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:43,508 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:43,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:12:43,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:43,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:43,509 INFO L85 PathProgramCache]: Analyzing trace with hash 753199727, now seen corresponding path program 1 times [2024-11-19 06:12:43,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:12:43,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120636718] [2024-11-19 06:12:43,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:43,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:12:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:12:43,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:12:43,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120636718] [2024-11-19 06:12:43,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120636718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:43,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:12:43,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:12:43,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210270501] [2024-11-19 06:12:43,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:43,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:12:43,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:12:43,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:12:43,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:12:43,904 INFO L87 Difference]: Start difference. First operand 652 states and 925 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-19 06:12:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:43,976 INFO L93 Difference]: Finished difference Result 941 states and 1338 transitions. [2024-11-19 06:12:43,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:12:43,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 225 [2024-11-19 06:12:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:43,984 INFO L225 Difference]: With dead ends: 941 [2024-11-19 06:12:43,984 INFO L226 Difference]: Without dead ends: 941 [2024-11-19 06:12:43,985 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-19 06:12:43,985 INFO L432 NwaCegarLoop]: 930 mSDtfsCounter, 453 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1651 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:12:43,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1651 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:12:43,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-19 06:12:44,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 937. [2024-11-19 06:12:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 912 states have (on average 1.4199561403508771) internal successors, (1295), 924 states have internal predecessors, (1295), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 06:12:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1335 transitions. [2024-11-19 06:12:44,011 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1335 transitions. Word has length 225 [2024-11-19 06:12:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:44,012 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1335 transitions. [2024-11-19 06:12:44,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-19 06:12:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1335 transitions. [2024-11-19 06:12:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-19 06:12:44,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:44,015 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:44,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:12:44,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:44,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:44,016 INFO L85 PathProgramCache]: Analyzing trace with hash 344727401, now seen corresponding path program 1 times [2024-11-19 06:12:44,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:12:44,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551232884] [2024-11-19 06:12:44,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:44,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:12:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 06:12:44,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:12:44,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551232884] [2024-11-19 06:12:44,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551232884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:12:44,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322644512] [2024-11-19 06:12:44,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:44,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:12:44,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:12:44,472 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-19 06:12:44,473 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-19 06:12:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:45,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:12:45,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:12:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 06:12:45,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:12:45,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322644512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:45,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:12:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-19 06:12:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104312468] [2024-11-19 06:12:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:45,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:12:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:12:45,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:12:45,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:12:45,131 INFO L87 Difference]: Start difference. First operand 937 states and 1335 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:12:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:45,212 INFO L93 Difference]: Finished difference Result 977 states and 1375 transitions. [2024-11-19 06:12:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:12:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 240 [2024-11-19 06:12:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:45,217 INFO L225 Difference]: With dead ends: 977 [2024-11-19 06:12:45,218 INFO L226 Difference]: Without dead ends: 977 [2024-11-19 06:12:45,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:12:45,219 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 7 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:12:45,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1417 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:12:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-19 06:12:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-19 06:12:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 952 states have (on average 1.4023109243697478) internal successors, (1335), 964 states have internal predecessors, (1335), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 06:12:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1375 transitions. [2024-11-19 06:12:45,244 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1375 transitions. Word has length 240 [2024-11-19 06:12:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:45,245 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1375 transitions. [2024-11-19 06:12:45,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:12:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1375 transitions. [2024-11-19 06:12:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-19 06:12:45,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:45,248 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:45,269 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-19 06:12:45,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:12:45,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:45,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:45,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1716534699, now seen corresponding path program 1 times [2024-11-19 06:12:45,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:12:45,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793601969] [2024-11-19 06:12:45,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:45,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:12:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 06:12:45,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:12:45,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793601969] [2024-11-19 06:12:45,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793601969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:12:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684832324] [2024-11-19 06:12:45,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:45,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:12:45,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:12:45,856 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-19 06:12:45,857 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-19 06:12:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:46,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:12:46,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:12:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 06:12:46,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:12:46,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684832324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:46,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:12:46,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2024-11-19 06:12:46,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369114689] [2024-11-19 06:12:46,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:46,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:12:46,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:12:46,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:12:46,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:12:46,476 INFO L87 Difference]: Start difference. First operand 977 states and 1375 transitions. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:12:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:46,554 INFO L93 Difference]: Finished difference Result 949 states and 1333 transitions. [2024-11-19 06:12:46,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:12:46,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 240 [2024-11-19 06:12:46,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:46,559 INFO L225 Difference]: With dead ends: 949 [2024-11-19 06:12:46,559 INFO L226 Difference]: Without dead ends: 949 [2024-11-19 06:12:46,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:12:46,560 INFO L432 NwaCegarLoop]: 707 mSDtfsCounter, 103 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:12:46,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 2102 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:12:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-19 06:12:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2024-11-19 06:12:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 924 states have (on average 1.3993506493506493) internal successors, (1293), 936 states have internal predecessors, (1293), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 06:12:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1333 transitions. [2024-11-19 06:12:46,584 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1333 transitions. Word has length 240 [2024-11-19 06:12:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:46,584 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1333 transitions. [2024-11-19 06:12:46,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:12:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1333 transitions. [2024-11-19 06:12:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-19 06:12:46,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:46,588 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:46,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:12:46,789 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,SelfDestructingSolverStorable7 [2024-11-19 06:12:46,790 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:46,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:46,790 INFO L85 PathProgramCache]: Analyzing trace with hash -826786723, now seen corresponding path program 1 times [2024-11-19 06:12:46,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:12:46,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501636911] [2024-11-19 06:12:46,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:46,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:12:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 06:12:47,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:12:47,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501636911] [2024-11-19 06:12:47,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501636911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:12:47,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853928558] [2024-11-19 06:12:47,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:47,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:12:47,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:12:47,153 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-19 06:12:47,154 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-19 06:12:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:47,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:12:47,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:12:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 06:12:47,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:12:47,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853928558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:47,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:12:47,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-19 06:12:47,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100717403] [2024-11-19 06:12:47,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:47,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:12:47,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:12:47,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:12:47,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:12:47,818 INFO L87 Difference]: Start difference. First operand 949 states and 1333 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:12:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:47,877 INFO L93 Difference]: Finished difference Result 841 states and 1161 transitions. [2024-11-19 06:12:47,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:12:47,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 240 [2024-11-19 06:12:47,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:47,881 INFO L225 Difference]: With dead ends: 841 [2024-11-19 06:12:47,881 INFO L226 Difference]: Without dead ends: 841 [2024-11-19 06:12:47,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:12:47,882 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 9 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:12:47,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1877 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:12:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-11-19 06:12:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2024-11-19 06:12:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 816 states have (on average 1.3737745098039216) internal successors, (1121), 828 states have internal predecessors, (1121), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 06:12:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1161 transitions. [2024-11-19 06:12:47,905 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1161 transitions. Word has length 240 [2024-11-19 06:12:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:47,906 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1161 transitions. [2024-11-19 06:12:47,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:12:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1161 transitions. [2024-11-19 06:12:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-19 06:12:47,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:47,911 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:47,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:12:48,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:12:48,112 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:48,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:48,113 INFO L85 PathProgramCache]: Analyzing trace with hash 545020575, now seen corresponding path program 1 times [2024-11-19 06:12:48,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:12:48,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643366506] [2024-11-19 06:12:48,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:48,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:12:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 06:12:48,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:12:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643366506] [2024-11-19 06:12:48,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643366506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:12:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791997619] [2024-11-19 06:12:48,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:48,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:12:48,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:12:48,445 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-19 06:12:48,446 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-19 06:12:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:49,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:12:49,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:12:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 06:12:49,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:12:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 06:12:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791997619] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:12:49,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:12:49,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 06:12:49,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880728554] [2024-11-19 06:12:49,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:12:49,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:12:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:12:49,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:12:49,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:12:49,624 INFO L87 Difference]: Start difference. First operand 841 states and 1161 transitions. Second operand has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 06:12:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:49,822 INFO L93 Difference]: Finished difference Result 1927 states and 2666 transitions. [2024-11-19 06:12:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:12:49,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 240 [2024-11-19 06:12:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:49,832 INFO L225 Difference]: With dead ends: 1927 [2024-11-19 06:12:49,833 INFO L226 Difference]: Without dead ends: 1927 [2024-11-19 06:12:49,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:12:49,834 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 3287 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3318 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:12:49,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3318 Valid, 2353 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:12:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2024-11-19 06:12:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1712. [2024-11-19 06:12:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1662 states have (on average 1.3694344163658243) internal successors, (2276), 1684 states have internal predecessors, (2276), 46 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (44), 28 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-19 06:12:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2366 transitions. [2024-11-19 06:12:49,886 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2366 transitions. Word has length 240 [2024-11-19 06:12:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:49,887 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 2366 transitions. [2024-11-19 06:12:49,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.71428571428571) internal successors, (537), 7 states have internal predecessors, (537), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 06:12:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2366 transitions. [2024-11-19 06:12:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2024-11-19 06:12:49,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:49,905 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:49,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 06:12:50,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:12:50,110 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:50,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1556986692, now seen corresponding path program 1 times [2024-11-19 06:12:50,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:12:50,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998633504] [2024-11-19 06:12:50,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:50,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:12:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 4 proven. 534 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2024-11-19 06:12:51,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:12:51,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998633504] [2024-11-19 06:12:51,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998633504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:12:51,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546510662] [2024-11-19 06:12:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:51,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:12:51,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:12:51,691 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:12:51,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:12:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:52,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 3232 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:12:52,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:12:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 06:12:53,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:12:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 06:12:54,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546510662] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:12:54,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:12:54,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2024-11-19 06:12:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333387781] [2024-11-19 06:12:54,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:12:54,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:12:54,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:12:54,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:12:54,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:12:54,273 INFO L87 Difference]: Start difference. First operand 1712 states and 2366 transitions. Second operand has 16 states, 16 states have (on average 104.3125) internal successors, (1669), 16 states have internal predecessors, (1669), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-19 06:13:01,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:01,510 INFO L93 Difference]: Finished difference Result 13566 states and 18784 transitions. [2024-11-19 06:13:01,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-19 06:13:01,512 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 104.3125) internal successors, (1669), 16 states have internal predecessors, (1669), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 678 [2024-11-19 06:13:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:01,563 INFO L225 Difference]: With dead ends: 13566 [2024-11-19 06:13:01,563 INFO L226 Difference]: Without dead ends: 13566 [2024-11-19 06:13:01,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1414 GetRequests, 1346 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1240, Invalid=3590, Unknown=0, NotChecked=0, Total=4830 [2024-11-19 06:13:01,565 INFO L432 NwaCegarLoop]: 1378 mSDtfsCounter, 32886 mSDsluCounter, 12438 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32886 SdHoareTripleChecker+Valid, 13816 SdHoareTripleChecker+Invalid, 2665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:01,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32886 Valid, 13816 Invalid, 2665 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [374 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-19 06:13:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13566 states. [2024-11-19 06:13:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13566 to 10334. [2024-11-19 06:13:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10334 states, 10142 states have (on average 1.3739893512127785) internal successors, (13935), 10219 states have internal predecessors, (13935), 188 states have call successors, (188), 3 states have call predecessors, (188), 2 states have return successors, (186), 126 states have call predecessors, (186), 186 states have call successors, (186) [2024-11-19 06:13:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10334 states to 10334 states and 14309 transitions. [2024-11-19 06:13:01,802 INFO L78 Accepts]: Start accepts. Automaton has 10334 states and 14309 transitions. Word has length 678 [2024-11-19 06:13:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:01,803 INFO L471 AbstractCegarLoop]: Abstraction has 10334 states and 14309 transitions. [2024-11-19 06:13:01,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 104.3125) internal successors, (1669), 16 states have internal predecessors, (1669), 5 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-19 06:13:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 10334 states and 14309 transitions. [2024-11-19 06:13:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1565 [2024-11-19 06:13:01,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:01,895 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:13:01,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 06:13:02,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 06:13:02,097 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:02,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:02,098 INFO L85 PathProgramCache]: Analyzing trace with hash 313254882, now seen corresponding path program 1 times [2024-11-19 06:13:02,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:13:02,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200977847] [2024-11-19 06:13:02,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:02,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms