./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:00:27,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:00:27,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:00:27,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:00:27,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:00:27,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:00:27,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:00:27,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:00:27,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:00:27,312 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:00:27,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:00:27,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:00:27,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:00:27,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:00:27,316 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:00:27,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:00:27,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:00:27,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:00:27,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:00:27,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:00:27,318 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:00:27,321 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:00:27,322 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:00:27,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:00:27,322 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:00:27,322 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:00:27,323 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:00:27,323 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:00:27,323 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:00:27,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:00:27,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:00:27,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:00:27,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:00:27,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:00:27,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:00:27,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:00:27,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:00:27,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:00:27,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:00:27,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:00:27,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:00:27,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:00:27,327 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c [2024-11-09 10:00:27,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:00:27,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:00:27,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:00:27,598 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:00:27,599 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:00:27,600 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-09 10:00:29,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:00:29,413 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:00:29,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2024-11-09 10:00:29,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d40932cc/3482f30ab26541c9913861c83aa23721/FLAG8a490ea6e [2024-11-09 10:00:29,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d40932cc/3482f30ab26541c9913861c83aa23721 [2024-11-09 10:00:29,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:00:29,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:00:29,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:00:29,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:00:29,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:00:29,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:00:29" (1/1) ... [2024-11-09 10:00:29,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de6d20e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:29, skipping insertion in model container [2024-11-09 10:00:29,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:00:29" (1/1) ... [2024-11-09 10:00:29,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:00:30,183 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:00:30,224 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:00:30,230 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:00:30,236 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:00:30,245 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:00:30,329 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:00:30,330 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:00:30,336 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:00:30,340 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:00:30,388 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:00:30,389 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:00:30,390 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:00:30,391 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:00:30,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:00:30,420 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:00:30,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:00:30,565 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:00:30,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30 WrapperNode [2024-11-09 10:00:30,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:00:30,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:00:30,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:00:30,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:00:30,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30" (1/1) ... [2024-11-09 10:00:30,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30" (1/1) ... [2024-11-09 10:00:30,715 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2052 [2024-11-09 10:00:30,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:00:30,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:00:30,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:00:30,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:00:30,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30" (1/1) ... [2024-11-09 10:00:30,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30" (1/1) ... [2024-11-09 10:00:30,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30" (1/1) ... [2024-11-09 10:00:30,858 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-09 10:00:30,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30" (1/1) ... [2024-11-09 10:00:30,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30" (1/1) ... [2024-11-09 10:00:30,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30" (1/1) ... [2024-11-09 10:00:30,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30" (1/1) ... [2024-11-09 10:00:30,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30" (1/1) ... [2024-11-09 10:00:30,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30" (1/1) ... [2024-11-09 10:00:30,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:00:30,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:00:30,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:00:30,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:00:30,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30" (1/1) ... [2024-11-09 10:00:30,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:00:30,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:00:31,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:00:31,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:00:31,066 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 10:00:31,067 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 10:00:31,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:00:31,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:00:31,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:00:31,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:00:31,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:00:31,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:00:31,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:00:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:00:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:00:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:00:31,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:00:31,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:00:31,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:00:31,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:00:31,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:00:31,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:00:31,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:00:31,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:00:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:00:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:00:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:00:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:00:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:00:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:00:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:00:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:00:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:00:31,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:00:31,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:00:31,297 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:00:31,299 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:00:31,317 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:00:31,364 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:00:31,390 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:00:34,224 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-11-09 10:00:34,225 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:00:34,276 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:00:34,277 INFO L316 CfgBuilder]: Removed 83 assume(true) statements. [2024-11-09 10:00:34,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:00:34 BoogieIcfgContainer [2024-11-09 10:00:34,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:00:34,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:00:34,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:00:34,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:00:34,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:00:29" (1/3) ... [2024-11-09 10:00:34,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c2a4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:00:34, skipping insertion in model container [2024-11-09 10:00:34,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:30" (2/3) ... [2024-11-09 10:00:34,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c2a4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:00:34, skipping insertion in model container [2024-11-09 10:00:34,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:00:34" (3/3) ... [2024-11-09 10:00:34,287 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-1.i [2024-11-09 10:00:34,303 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:00:34,303 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 712 error locations. [2024-11-09 10:00:34,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:00:34,421 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39180e22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:00:34,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-09 10:00:34,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 1738 states, 1015 states have (on average 2.0344827586206895) internal successors, (2065), 1728 states have internal predecessors, (2065), 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-09 10:00:34,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:00:34,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:34,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:00:34,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:34,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:34,444 INFO L85 PathProgramCache]: Analyzing trace with hash 63053744, now seen corresponding path program 1 times [2024-11-09 10:00:34,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:34,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552475889] [2024-11-09 10:00:34,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:34,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:34,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:34,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552475889] [2024-11-09 10:00:34,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552475889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:34,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:34,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:00:34,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170334368] [2024-11-09 10:00:34,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:34,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:00:34,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:34,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:00:34,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:00:34,676 INFO L87 Difference]: Start difference. First operand has 1738 states, 1015 states have (on average 2.0344827586206895) internal successors, (2065), 1728 states have internal predecessors, (2065), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:34,778 INFO L93 Difference]: Finished difference Result 1718 states and 1978 transitions. [2024-11-09 10:00:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:00:34,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-11-09 10:00:34,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:34,801 INFO L225 Difference]: With dead ends: 1718 [2024-11-09 10:00:34,802 INFO L226 Difference]: Without dead ends: 1716 [2024-11-09 10:00:34,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:00:34,806 INFO L432 NwaCegarLoop]: 1978 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:34,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:00:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2024-11-09 10:00:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1716. [2024-11-09 10:00:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1005 states have (on average 1.9422885572139303) internal successors, (1952), 1706 states have internal predecessors, (1952), 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-09 10:00:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 1976 transitions. [2024-11-09 10:00:34,916 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 1976 transitions. Word has length 5 [2024-11-09 10:00:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:34,916 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 1976 transitions. [2024-11-09 10:00:34,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 1976 transitions. [2024-11-09 10:00:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:00:34,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:34,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:00:34,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:00:34,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:34,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:34,920 INFO L85 PathProgramCache]: Analyzing trace with hash 63053806, now seen corresponding path program 1 times [2024-11-09 10:00:34,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:34,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159690424] [2024-11-09 10:00:34,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:34,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:35,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:35,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159690424] [2024-11-09 10:00:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159690424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:35,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:35,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:00:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755774661] [2024-11-09 10:00:35,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:35,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:00:35,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:35,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:00:35,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:00:35,041 INFO L87 Difference]: Start difference. First operand 1716 states and 1976 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:36,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:36,201 INFO L93 Difference]: Finished difference Result 1945 states and 2293 transitions. [2024-11-09 10:00:36,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:00:36,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-09 10:00:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:36,210 INFO L225 Difference]: With dead ends: 1945 [2024-11-09 10:00:36,210 INFO L226 Difference]: Without dead ends: 1945 [2024-11-09 10:00:36,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:00:36,212 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 1737 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:36,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 1918 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:00:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2024-11-09 10:00:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1624. [2024-11-09 10:00:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1005 states have (on average 1.8507462686567164) internal successors, (1860), 1614 states have internal predecessors, (1860), 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-09 10:00:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1884 transitions. [2024-11-09 10:00:36,256 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 1884 transitions. Word has length 5 [2024-11-09 10:00:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:36,257 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 1884 transitions. [2024-11-09 10:00:36,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 1884 transitions. [2024-11-09 10:00:36,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:00:36,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:36,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:00:36,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:00:36,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:36,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:36,259 INFO L85 PathProgramCache]: Analyzing trace with hash 63053807, now seen corresponding path program 1 times [2024-11-09 10:00:36,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:36,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998297628] [2024-11-09 10:00:36,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:36,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:36,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:36,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998297628] [2024-11-09 10:00:36,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998297628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:36,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:36,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:00:36,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386926897] [2024-11-09 10:00:36,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:36,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:00:36,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:36,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:00:36,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:00:36,361 INFO L87 Difference]: Start difference. First operand 1624 states and 1884 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:37,602 INFO L93 Difference]: Finished difference Result 2361 states and 2785 transitions. [2024-11-09 10:00:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:00:37,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-09 10:00:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:37,612 INFO L225 Difference]: With dead ends: 2361 [2024-11-09 10:00:37,613 INFO L226 Difference]: Without dead ends: 2361 [2024-11-09 10:00:37,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:00:37,615 INFO L432 NwaCegarLoop]: 1955 mSDtfsCounter, 1217 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:37,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 2890 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:00:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2024-11-09 10:00:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1887. [2024-11-09 10:00:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1278 states have (on average 1.8262910798122065) internal successors, (2334), 1877 states have internal predecessors, (2334), 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-09 10:00:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2358 transitions. [2024-11-09 10:00:37,675 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2358 transitions. Word has length 5 [2024-11-09 10:00:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:37,675 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2358 transitions. [2024-11-09 10:00:37,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2358 transitions. [2024-11-09 10:00:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 10:00:37,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:37,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:00:37,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:00:37,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:37,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1957056365, now seen corresponding path program 1 times [2024-11-09 10:00:37,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:37,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656421427] [2024-11-09 10:00:37,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:37,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:37,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:37,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656421427] [2024-11-09 10:00:37,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656421427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:37,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:37,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:00:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005059341] [2024-11-09 10:00:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:37,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:00:37,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:37,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:00:37,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:00:37,735 INFO L87 Difference]: Start difference. First operand 1887 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:37,806 INFO L93 Difference]: Finished difference Result 3755 states and 4697 transitions. [2024-11-09 10:00:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:00:37,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-09 10:00:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:37,821 INFO L225 Difference]: With dead ends: 3755 [2024-11-09 10:00:37,821 INFO L226 Difference]: Without dead ends: 3755 [2024-11-09 10:00:37,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:00:37,823 INFO L432 NwaCegarLoop]: 2150 mSDtfsCounter, 1830 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 4014 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:37,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 4014 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:00:37,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2024-11-09 10:00:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 1889. [2024-11-09 10:00:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1280 states have (on average 1.825) internal successors, (2336), 1879 states have internal predecessors, (2336), 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-09 10:00:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2360 transitions. [2024-11-09 10:00:37,872 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2360 transitions. Word has length 6 [2024-11-09 10:00:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:37,873 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 2360 transitions. [2024-11-09 10:00:37,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2360 transitions. [2024-11-09 10:00:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 10:00:37,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:37,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:00:37,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:00:37,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:37,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:37,917 INFO L85 PathProgramCache]: Analyzing trace with hash -408167560, now seen corresponding path program 1 times [2024-11-09 10:00:37,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:37,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426783340] [2024-11-09 10:00:37,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:37,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:37,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:37,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426783340] [2024-11-09 10:00:37,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426783340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:37,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:37,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:00:37,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851294087] [2024-11-09 10:00:37,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:37,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:00:37,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:37,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:00:37,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:00:37,977 INFO L87 Difference]: Start difference. First operand 1889 states and 2360 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:39,132 INFO L93 Difference]: Finished difference Result 1915 states and 2413 transitions. [2024-11-09 10:00:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:00:39,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-09 10:00:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:39,139 INFO L225 Difference]: With dead ends: 1915 [2024-11-09 10:00:39,140 INFO L226 Difference]: Without dead ends: 1915 [2024-11-09 10:00:39,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:00:39,141 INFO L432 NwaCegarLoop]: 1160 mSDtfsCounter, 2005 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2016 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:39,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2016 Valid, 2176 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:00:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2024-11-09 10:00:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1866. [2024-11-09 10:00:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1280 states have (on average 1.80703125) internal successors, (2313), 1856 states have internal predecessors, (2313), 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-09 10:00:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2337 transitions. [2024-11-09 10:00:39,174 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2337 transitions. Word has length 11 [2024-11-09 10:00:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:39,175 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2337 transitions. [2024-11-09 10:00:39,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2337 transitions. [2024-11-09 10:00:39,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 10:00:39,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:39,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:00:39,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:00:39,176 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:39,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash -408167559, now seen corresponding path program 1 times [2024-11-09 10:00:39,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:39,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078722418] [2024-11-09 10:00:39,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:39,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:39,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:39,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078722418] [2024-11-09 10:00:39,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078722418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:39,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:39,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:00:39,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785171070] [2024-11-09 10:00:39,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:39,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:00:39,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:39,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:00:39,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:00:39,240 INFO L87 Difference]: Start difference. First operand 1866 states and 2337 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:39,275 INFO L93 Difference]: Finished difference Result 1791 states and 2234 transitions. [2024-11-09 10:00:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:00:39,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-09 10:00:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:39,282 INFO L225 Difference]: With dead ends: 1791 [2024-11-09 10:00:39,282 INFO L226 Difference]: Without dead ends: 1791 [2024-11-09 10:00:39,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:00:39,284 INFO L432 NwaCegarLoop]: 1736 mSDtfsCounter, 61 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3419 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:39,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3419 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:00:39,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2024-11-09 10:00:39,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1791. [2024-11-09 10:00:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1217 states have (on average 1.8159408381265407) internal successors, (2210), 1781 states have internal predecessors, (2210), 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-09 10:00:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2234 transitions. [2024-11-09 10:00:39,324 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2234 transitions. Word has length 11 [2024-11-09 10:00:39,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:39,324 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2234 transitions. [2024-11-09 10:00:39,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2234 transitions. [2024-11-09 10:00:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 10:00:39,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:39,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:00:39,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:00:39,326 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:39,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1406843659, now seen corresponding path program 1 times [2024-11-09 10:00:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:39,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189390737] [2024-11-09 10:00:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:39,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:39,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189390737] [2024-11-09 10:00:39,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189390737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:39,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:39,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:00:39,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206328025] [2024-11-09 10:00:39,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:39,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:00:39,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:39,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:00:39,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:00:39,413 INFO L87 Difference]: Start difference. First operand 1791 states and 2234 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:39,483 INFO L93 Difference]: Finished difference Result 1776 states and 2212 transitions. [2024-11-09 10:00:39,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:00:39,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 10:00:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:39,490 INFO L225 Difference]: With dead ends: 1776 [2024-11-09 10:00:39,490 INFO L226 Difference]: Without dead ends: 1776 [2024-11-09 10:00:39,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:00:39,492 INFO L432 NwaCegarLoop]: 1698 mSDtfsCounter, 45 mSDsluCounter, 3373 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5071 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:39,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5071 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:00:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-09 10:00:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2024-11-09 10:00:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1209 states have (on average 1.8097601323407775) internal successors, (2188), 1766 states have internal predecessors, (2188), 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-09 10:00:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2212 transitions. [2024-11-09 10:00:39,523 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2212 transitions. Word has length 13 [2024-11-09 10:00:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:39,523 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 2212 transitions. [2024-11-09 10:00:39,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2212 transitions. [2024-11-09 10:00:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 10:00:39,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:39,525 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] [2024-11-09 10:00:39,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:00:39,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:39,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1340702493, now seen corresponding path program 1 times [2024-11-09 10:00:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581909806] [2024-11-09 10:00:39,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:39,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:39,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:39,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581909806] [2024-11-09 10:00:39,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581909806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:39,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:39,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:00:39,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125057338] [2024-11-09 10:00:39,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:39,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:00:39,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:39,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:00:39,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:00:39,675 INFO L87 Difference]: Start difference. First operand 1776 states and 2212 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:40,973 INFO L93 Difference]: Finished difference Result 2296 states and 2712 transitions. [2024-11-09 10:00:40,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:00:40,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-09 10:00:40,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:40,981 INFO L225 Difference]: With dead ends: 2296 [2024-11-09 10:00:40,982 INFO L226 Difference]: Without dead ends: 2296 [2024-11-09 10:00:40,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:00:40,983 INFO L432 NwaCegarLoop]: 1431 mSDtfsCounter, 1222 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:40,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 3385 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:00:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2024-11-09 10:00:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1772. [2024-11-09 10:00:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1209 states have (on average 1.8064516129032258) internal successors, (2184), 1762 states have internal predecessors, (2184), 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-09 10:00:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2208 transitions. [2024-11-09 10:00:41,018 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2208 transitions. Word has length 27 [2024-11-09 10:00:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:41,018 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2208 transitions. [2024-11-09 10:00:41,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2208 transitions. [2024-11-09 10:00:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 10:00:41,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:41,021 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] [2024-11-09 10:00:41,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:00:41,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:41,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:41,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1878905961, now seen corresponding path program 1 times [2024-11-09 10:00:41,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:41,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493353801] [2024-11-09 10:00:41,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:41,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:41,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493353801] [2024-11-09 10:00:41,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493353801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:41,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:41,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:00:41,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447688118] [2024-11-09 10:00:41,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:41,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:00:41,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:41,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:00:41,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:00:41,119 INFO L87 Difference]: Start difference. First operand 1772 states and 2208 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:41,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:41,177 INFO L93 Difference]: Finished difference Result 1766 states and 2198 transitions. [2024-11-09 10:00:41,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:00:41,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-11-09 10:00:41,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:41,184 INFO L225 Difference]: With dead ends: 1766 [2024-11-09 10:00:41,184 INFO L226 Difference]: Without dead ends: 1766 [2024-11-09 10:00:41,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:00:41,187 INFO L432 NwaCegarLoop]: 1696 mSDtfsCounter, 21 mSDsluCounter, 3361 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 5057 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-09 10:00:41,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 5057 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:00:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2024-11-09 10:00:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2024-11-09 10:00:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1203 states have (on average 1.8071487946799667) internal successors, (2174), 1756 states have internal predecessors, (2174), 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-09 10:00:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2198 transitions. [2024-11-09 10:00:41,219 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2198 transitions. Word has length 61 [2024-11-09 10:00:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:41,219 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2198 transitions. [2024-11-09 10:00:41,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2198 transitions. [2024-11-09 10:00:41,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 10:00:41,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:41,223 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] [2024-11-09 10:00:41,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:00:41,224 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:41,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:41,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1294710755, now seen corresponding path program 1 times [2024-11-09 10:00:41,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:41,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227614743] [2024-11-09 10:00:41,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:41,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:41,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:41,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227614743] [2024-11-09 10:00:41,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227614743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:41,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:41,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:00:41,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136912909] [2024-11-09 10:00:41,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:41,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:00:41,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:41,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:00:41,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:00:41,362 INFO L87 Difference]: Start difference. First operand 1766 states and 2198 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:41,450 INFO L93 Difference]: Finished difference Result 1858 states and 2317 transitions. [2024-11-09 10:00:41,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:00:41,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2024-11-09 10:00:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:41,458 INFO L225 Difference]: With dead ends: 1858 [2024-11-09 10:00:41,459 INFO L226 Difference]: Without dead ends: 1858 [2024-11-09 10:00:41,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:00:41,459 INFO L432 NwaCegarLoop]: 1711 mSDtfsCounter, 54 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3395 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:41,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3395 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:00:41,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2024-11-09 10:00:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858. [2024-11-09 10:00:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1295 states have (on average 1.7706563706563707) internal successors, (2293), 1848 states have internal predecessors, (2293), 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-09 10:00:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2317 transitions. [2024-11-09 10:00:41,489 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2317 transitions. Word has length 69 [2024-11-09 10:00:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:41,490 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2317 transitions. [2024-11-09 10:00:41,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2317 transitions. [2024-11-09 10:00:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 10:00:41,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:41,494 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] [2024-11-09 10:00:41,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:00:41,495 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:41,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1814650898, now seen corresponding path program 1 times [2024-11-09 10:00:41,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:41,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353365302] [2024-11-09 10:00:41,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:41,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:42,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:42,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353365302] [2024-11-09 10:00:42,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353365302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:42,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:42,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:00:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177374029] [2024-11-09 10:00:42,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:42,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:00:42,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:00:42,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:00:42,003 INFO L87 Difference]: Start difference. First operand 1858 states and 2317 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:43,288 INFO L93 Difference]: Finished difference Result 1774 states and 2233 transitions. [2024-11-09 10:00:43,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:00:43,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 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 72 [2024-11-09 10:00:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:43,296 INFO L225 Difference]: With dead ends: 1774 [2024-11-09 10:00:43,296 INFO L226 Difference]: Without dead ends: 1774 [2024-11-09 10:00:43,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:00:43,297 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 1535 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:43,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 1620 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:00:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-09 10:00:43,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1501. [2024-11-09 10:00:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1022 states have (on average 1.687866927592955) internal successors, (1725), 1491 states have internal predecessors, (1725), 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-09 10:00:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1749 transitions. [2024-11-09 10:00:43,330 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1749 transitions. Word has length 72 [2024-11-09 10:00:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:43,330 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1749 transitions. [2024-11-09 10:00:43,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1749 transitions. [2024-11-09 10:00:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 10:00:43,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:43,333 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] [2024-11-09 10:00:43,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:00:43,334 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:43,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:43,334 INFO L85 PathProgramCache]: Analyzing trace with hash -702590666, now seen corresponding path program 1 times [2024-11-09 10:00:43,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:43,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239395474] [2024-11-09 10:00:43,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:43,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:43,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:43,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239395474] [2024-11-09 10:00:43,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239395474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:43,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:43,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:00:43,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463876329] [2024-11-09 10:00:43,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:43,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:00:43,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:43,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:00:43,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:00:43,643 INFO L87 Difference]: Start difference. First operand 1501 states and 1749 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:44,537 INFO L93 Difference]: Finished difference Result 1500 states and 1748 transitions. [2024-11-09 10:00:44,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:00:44,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-09 10:00:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:44,542 INFO L225 Difference]: With dead ends: 1500 [2024-11-09 10:00:44,543 INFO L226 Difference]: Without dead ends: 1500 [2024-11-09 10:00:44,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:00:44,543 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 2 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4778 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:44,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4778 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:00:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2024-11-09 10:00:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1500. [2024-11-09 10:00:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1022 states have (on average 1.6868884540117417) internal successors, (1724), 1490 states have internal predecessors, (1724), 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-09 10:00:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-09 10:00:44,566 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 77 [2024-11-09 10:00:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:44,566 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-09 10:00:44,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-09 10:00:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 10:00:44,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:44,567 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] [2024-11-09 10:00:44,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:00:44,567 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:44,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash -702590665, now seen corresponding path program 1 times [2024-11-09 10:00:44,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:44,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604] [2024-11-09 10:00:44,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:45,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:45,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604] [2024-11-09 10:00:45,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:45,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:45,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:00:45,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5838189] [2024-11-09 10:00:45,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:45,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:00:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:00:45,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:00:45,069 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:46,092 INFO L93 Difference]: Finished difference Result 1499 states and 1747 transitions. [2024-11-09 10:00:46,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:00:46,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-09 10:00:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:46,098 INFO L225 Difference]: With dead ends: 1499 [2024-11-09 10:00:46,098 INFO L226 Difference]: Without dead ends: 1499 [2024-11-09 10:00:46,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:00:46,099 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 1 mSDsluCounter, 3177 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4800 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:46,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4800 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:00:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2024-11-09 10:00:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2024-11-09 10:00:46,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1021 states have (on average 1.6875612144955925) internal successors, (1723), 1489 states have internal predecessors, (1723), 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-09 10:00:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1747 transitions. [2024-11-09 10:00:46,125 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1747 transitions. Word has length 77 [2024-11-09 10:00:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:46,125 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1747 transitions. [2024-11-09 10:00:46,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:00:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1747 transitions. [2024-11-09 10:00:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:00:46,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:46,128 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] [2024-11-09 10:00:46,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:00:46,129 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:46,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash 545873214, now seen corresponding path program 1 times [2024-11-09 10:00:46,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:46,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689178504] [2024-11-09 10:00:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:46,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:46,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:00:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:46,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:46,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689178504] [2024-11-09 10:00:46,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689178504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:46,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:46,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:00:46,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264740785] [2024-11-09 10:00:46,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:46,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:00:46,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:46,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:00:46,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:00:46,779 INFO L87 Difference]: Start difference. First operand 1499 states and 1747 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:00:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:48,095 INFO L93 Difference]: Finished difference Result 1506 states and 1760 transitions. [2024-11-09 10:00:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:00:48,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-09 10:00:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:48,100 INFO L225 Difference]: With dead ends: 1506 [2024-11-09 10:00:48,100 INFO L226 Difference]: Without dead ends: 1506 [2024-11-09 10:00:48,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:00:48,100 INFO L432 NwaCegarLoop]: 1611 mSDtfsCounter, 13 mSDsluCounter, 5816 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7427 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:48,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7427 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:00:48,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-09 10:00:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1505. [2024-11-09 10:00:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1026 states have (on average 1.6861598440545809) internal successors, (1730), 1494 states have internal predecessors, (1730), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-09 10:00:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1760 transitions. [2024-11-09 10:00:48,122 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1760 transitions. Word has length 85 [2024-11-09 10:00:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:48,123 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1760 transitions. [2024-11-09 10:00:48,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:00:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1760 transitions. [2024-11-09 10:00:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:00:48,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:48,124 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] [2024-11-09 10:00:48,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:00:48,124 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:48,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:48,125 INFO L85 PathProgramCache]: Analyzing trace with hash 545873213, now seen corresponding path program 1 times [2024-11-09 10:00:48,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:48,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290819391] [2024-11-09 10:00:48,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:48,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:48,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:00:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:48,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:48,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290819391] [2024-11-09 10:00:48,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290819391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:00:48,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:00:48,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:00:48,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664429596] [2024-11-09 10:00:48,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:00:48,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:00:48,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:48,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:00:48,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:00:48,378 INFO L87 Difference]: Start difference. First operand 1505 states and 1760 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:00:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:49,933 INFO L93 Difference]: Finished difference Result 1510 states and 1764 transitions. [2024-11-09 10:00:49,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:00:49,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2024-11-09 10:00:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:49,937 INFO L225 Difference]: With dead ends: 1510 [2024-11-09 10:00:49,937 INFO L226 Difference]: Without dead ends: 1510 [2024-11-09 10:00:49,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:00:49,938 INFO L432 NwaCegarLoop]: 1606 mSDtfsCounter, 16 mSDsluCounter, 5776 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7382 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:49,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7382 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:00:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-09 10:00:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1505. [2024-11-09 10:00:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1026 states have (on average 1.6851851851851851) internal successors, (1729), 1494 states have internal predecessors, (1729), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-09 10:00:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1759 transitions. [2024-11-09 10:00:49,974 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1759 transitions. Word has length 85 [2024-11-09 10:00:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:49,974 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 1759 transitions. [2024-11-09 10:00:49,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:00:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1759 transitions. [2024-11-09 10:00:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 10:00:49,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:49,976 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] [2024-11-09 10:00:49,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:00:49,976 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:49,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash -749829340, now seen corresponding path program 1 times [2024-11-09 10:00:49,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:49,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076956958] [2024-11-09 10:00:49,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:49,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:50,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:00:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:50,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:50,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076956958] [2024-11-09 10:00:50,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076956958] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:00:50,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951734119] [2024-11-09 10:00:50,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:50,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:00:50,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:00:50,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:00:50,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 10:00:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:51,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 10:00:51,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:00:51,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:00:51,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:00:51,304 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:00:51,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:00:51,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 10:00:51,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:00:51,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 10:00:51,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:00:51,588 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:00:51,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:00:51,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:00:51,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:00:51,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:00:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:51,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:00:51,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951734119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:00:51,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:00:51,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 10:00:51,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730561302] [2024-11-09 10:00:51,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:00:51,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:00:51,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:51,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:00:51,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=385, Unknown=12, NotChecked=0, Total=462 [2024-11-09 10:00:51,845 INFO L87 Difference]: Start difference. First operand 1505 states and 1759 transitions. Second operand has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:00:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:00:57,507 INFO L93 Difference]: Finished difference Result 1512 states and 1766 transitions. [2024-11-09 10:00:57,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:00:57,508 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-09 10:00:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:00:57,511 INFO L225 Difference]: With dead ends: 1512 [2024-11-09 10:00:57,512 INFO L226 Difference]: Without dead ends: 1512 [2024-11-09 10:00:57,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=584, Unknown=12, NotChecked=0, Total=702 [2024-11-09 10:00:57,516 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 1552 mSDsluCounter, 11052 mSDsCounter, 0 mSdLazyCounter, 10585 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 12102 SdHoareTripleChecker+Invalid, 10627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 10585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:00:57,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 12102 Invalid, 10627 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 10585 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-09 10:00:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-09 10:00:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1509. [2024-11-09 10:00:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1030 states have (on average 1.6825242718446602) internal successors, (1733), 1497 states have internal predecessors, (1733), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:00:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1758 transitions. [2024-11-09 10:00:57,549 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1758 transitions. Word has length 86 [2024-11-09 10:00:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:00:57,549 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1758 transitions. [2024-11-09 10:00:57,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 18 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:00:57,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1758 transitions. [2024-11-09 10:00:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 10:00:57,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:00:57,551 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] [2024-11-09 10:00:57,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:00:57,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 10:00:57,752 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:00:57,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:00:57,753 INFO L85 PathProgramCache]: Analyzing trace with hash -749829341, now seen corresponding path program 1 times [2024-11-09 10:00:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:00:57,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272701260] [2024-11-09 10:00:57,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:57,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:00:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:58,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:00:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:58,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:00:58,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272701260] [2024-11-09 10:00:58,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272701260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:00:58,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061825895] [2024-11-09 10:00:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:00:58,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:00:58,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:00:58,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:00:58,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 10:00:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:00:58,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 10:00:58,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:00:58,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:00:58,600 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:00:58,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:00:58,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:00:58,686 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:00:58,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:00:58,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:00:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:00:58,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:00:58,767 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 10:00:58,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 10:00:58,773 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_683 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_683) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-09 10:00:58,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061825895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:00:58,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:00:58,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-09 10:00:58,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216513641] [2024-11-09 10:00:58,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:00:58,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:00:58,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:00:58,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:00:58,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2024-11-09 10:00:58,777 INFO L87 Difference]: Start difference. First operand 1509 states and 1758 transitions. Second operand has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:01:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:01:01,649 INFO L93 Difference]: Finished difference Result 1511 states and 1765 transitions. [2024-11-09 10:01:01,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:01:01,649 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-11-09 10:01:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:01:01,653 INFO L225 Difference]: With dead ends: 1511 [2024-11-09 10:01:01,653 INFO L226 Difference]: Without dead ends: 1511 [2024-11-09 10:01:01,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2024-11-09 10:01:01,657 INFO L432 NwaCegarLoop]: 1045 mSDtfsCounter, 1547 mSDsluCounter, 10191 mSDsCounter, 0 mSdLazyCounter, 6568 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 11236 SdHoareTripleChecker+Invalid, 6606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 6568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:01:01,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 11236 Invalid, 6606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 6568 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 10:01:01,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2024-11-09 10:01:01,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1502. [2024-11-09 10:01:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1025 states have (on average 1.6839024390243902) internal successors, (1726), 1491 states have internal predecessors, (1726), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:01:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1750 transitions. [2024-11-09 10:01:01,681 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1750 transitions. Word has length 86 [2024-11-09 10:01:01,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:01:01,682 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1750 transitions. [2024-11-09 10:01:01,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:01:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1750 transitions. [2024-11-09 10:01:01,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 10:01:01,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:01:01,683 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] [2024-11-09 10:01:01,702 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-09 10:01:01,883 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,SelfDestructingSolverStorable16 [2024-11-09 10:01:01,884 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:01:01,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:01:01,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1363328473, now seen corresponding path program 1 times [2024-11-09 10:01:01,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:01:01,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589843176] [2024-11-09 10:01:01,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:01,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:01:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:02,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:01:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:02,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:01:02,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589843176] [2024-11-09 10:01:02,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589843176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:01:02,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:01:02,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:01:02,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065832886] [2024-11-09 10:01:02,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:01:02,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:01:02,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:01:02,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:01:02,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:01:02,462 INFO L87 Difference]: Start difference. First operand 1502 states and 1750 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:01:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:01:04,835 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-09 10:01:04,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:01:04,836 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-09 10:01:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:01:04,841 INFO L225 Difference]: With dead ends: 1515 [2024-11-09 10:01:04,841 INFO L226 Difference]: Without dead ends: 1515 [2024-11-09 10:01:04,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-09 10:01:04,843 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 1567 mSDsluCounter, 8171 mSDsCounter, 0 mSdLazyCounter, 5399 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 9215 SdHoareTripleChecker+Invalid, 5424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:01:04,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1582 Valid, 9215 Invalid, 5424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5399 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 10:01:04,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-09 10:01:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1511. [2024-11-09 10:01:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1033 states have (on average 1.6805421103581801) internal successors, (1736), 1499 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:01:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1761 transitions. [2024-11-09 10:01:04,871 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1761 transitions. Word has length 88 [2024-11-09 10:01:04,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:01:04,872 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1761 transitions. [2024-11-09 10:01:04,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:01:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1761 transitions. [2024-11-09 10:01:04,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 10:01:04,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:01:04,873 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] [2024-11-09 10:01:04,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 10:01:04,874 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:01:04,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:01:04,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1363328474, now seen corresponding path program 1 times [2024-11-09 10:01:04,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:01:04,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927451723] [2024-11-09 10:01:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:04,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:01:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:05,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:01:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:05,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:01:05,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927451723] [2024-11-09 10:01:05,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927451723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:01:05,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:01:05,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:01:05,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142318075] [2024-11-09 10:01:05,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:01:05,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:01:05,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:01:05,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:01:05,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:01:05,609 INFO L87 Difference]: Start difference. First operand 1511 states and 1761 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:01:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:01:07,721 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-09 10:01:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:01:07,722 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-09 10:01:07,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:01:07,724 INFO L225 Difference]: With dead ends: 1514 [2024-11-09 10:01:07,724 INFO L226 Difference]: Without dead ends: 1514 [2024-11-09 10:01:07,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:01:07,725 INFO L432 NwaCegarLoop]: 1051 mSDtfsCounter, 1554 mSDsluCounter, 4448 mSDsCounter, 0 mSdLazyCounter, 4236 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 5499 SdHoareTripleChecker+Invalid, 4272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:01:07,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 5499 Invalid, 4272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4236 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 10:01:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-09 10:01:07,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1511. [2024-11-09 10:01:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1033 states have (on average 1.6795740561471442) internal successors, (1735), 1499 states have internal predecessors, (1735), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:01:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1760 transitions. [2024-11-09 10:01:07,743 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1760 transitions. Word has length 88 [2024-11-09 10:01:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:01:07,743 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1760 transitions. [2024-11-09 10:01:07,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:01:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1760 transitions. [2024-11-09 10:01:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:01:07,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:01:07,744 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] [2024-11-09 10:01:07,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:01:07,745 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:01:07,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:01:07,745 INFO L85 PathProgramCache]: Analyzing trace with hash -40368589, now seen corresponding path program 1 times [2024-11-09 10:01:07,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:01:07,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386320465] [2024-11-09 10:01:07,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:07,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:01:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:08,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:01:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:08,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:01:08,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386320465] [2024-11-09 10:01:08,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386320465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:01:08,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643102046] [2024-11-09 10:01:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:08,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:01:08,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:01:08,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:01:08,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 10:01:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:08,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 10:01:08,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:01:08,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:01:08,661 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:01:08,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:01:08,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:01:08,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:01:08,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:01:08,789 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:01:08,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:01:08,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:01:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:08,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:01:08,905 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-09 10:01:08,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-09 10:01:08,915 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_949 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_949))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_946)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 10:01:08,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643102046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:01:08,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:01:08,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-09 10:01:08,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963147743] [2024-11-09 10:01:08,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:01:08,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:01:08,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:01:08,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:01:08,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=278, Unknown=14, NotChecked=34, Total=380 [2024-11-09 10:01:08,918 INFO L87 Difference]: Start difference. First operand 1511 states and 1760 transitions. Second operand has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:01:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:01:11,514 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-09 10:01:11,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:01:11,515 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-09 10:01:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:01:11,518 INFO L225 Difference]: With dead ends: 1513 [2024-11-09 10:01:11,518 INFO L226 Difference]: Without dead ends: 1513 [2024-11-09 10:01:11,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=577, Unknown=14, NotChecked=50, Total=756 [2024-11-09 10:01:11,519 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 1538 mSDsluCounter, 10212 mSDsCounter, 0 mSdLazyCounter, 6544 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 11256 SdHoareTripleChecker+Invalid, 6569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:01:11,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 11256 Invalid, 6569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 6544 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 10:01:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-09 10:01:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1510. [2024-11-09 10:01:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1033 states have (on average 1.6786060019361084) internal successors, (1734), 1498 states have internal predecessors, (1734), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:01:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1759 transitions. [2024-11-09 10:01:11,538 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1759 transitions. Word has length 89 [2024-11-09 10:01:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:01:11,538 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 1759 transitions. [2024-11-09 10:01:11,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.6) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:01:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1759 transitions. [2024-11-09 10:01:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:01:11,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:01:11,539 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] [2024-11-09 10:01:11,558 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-09 10:01:11,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:01:11,741 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:01:11,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:01:11,742 INFO L85 PathProgramCache]: Analyzing trace with hash -40368588, now seen corresponding path program 1 times [2024-11-09 10:01:11,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:01:11,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411548137] [2024-11-09 10:01:11,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:11,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:01:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:12,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:01:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:12,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:01:12,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411548137] [2024-11-09 10:01:12,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411548137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:01:12,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722424242] [2024-11-09 10:01:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:12,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:01:12,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:01:12,561 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:01:12,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 10:01:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:12,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 10:01:12,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:01:12,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:01:12,925 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:01:12,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:01:12,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:01:12,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 10:01:12,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:01:13,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 10:01:13,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:01:13,157 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:01:13,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:01:13,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:01:13,248 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:01:13,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:01:13,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:01:13,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:01:13,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:01:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:13,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:01:13,453 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1096 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1097) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:01:13,514 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1102))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1103) .cse0 v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1097) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-09 10:01:13,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722424242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:01:13,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:01:13,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-09 10:01:13,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013421900] [2024-11-09 10:01:13,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:01:13,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 10:01:13,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:01:13,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 10:01:13,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=470, Unknown=10, NotChecked=90, Total=650 [2024-11-09 10:01:13,518 INFO L87 Difference]: Start difference. First operand 1510 states and 1759 transitions. Second operand has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:01:17,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:01:17,637 INFO L93 Difference]: Finished difference Result 1512 states and 1766 transitions. [2024-11-09 10:01:17,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:01:17,638 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2024-11-09 10:01:17,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:01:17,640 INFO L225 Difference]: With dead ends: 1512 [2024-11-09 10:01:17,640 INFO L226 Difference]: Without dead ends: 1512 [2024-11-09 10:01:17,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=736, Unknown=11, NotChecked=114, Total=992 [2024-11-09 10:01:17,641 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 1550 mSDsluCounter, 9651 mSDsCounter, 0 mSdLazyCounter, 8707 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 10700 SdHoareTripleChecker+Invalid, 8748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 8707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:01:17,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 10700 Invalid, 8748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 8707 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 10:01:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-09 10:01:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1500. [2024-11-09 10:01:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1025 states have (on average 1.681951219512195) internal successors, (1724), 1489 states have internal predecessors, (1724), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:01:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1748 transitions. [2024-11-09 10:01:17,656 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1748 transitions. Word has length 89 [2024-11-09 10:01:17,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:01:17,657 INFO L471 AbstractCegarLoop]: Abstraction has 1500 states and 1748 transitions. [2024-11-09 10:01:17,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:01:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1748 transitions. [2024-11-09 10:01:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 10:01:17,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:01:17,658 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] [2024-11-09 10:01:17,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 10:01:17,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:01:17,859 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:01:17,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:01:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1708417764, now seen corresponding path program 1 times [2024-11-09 10:01:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:01:17,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143629170] [2024-11-09 10:01:17,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:17,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:01:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:01:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:18,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:01:18,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143629170] [2024-11-09 10:01:18,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143629170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:01:18,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:01:18,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:01:18,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270461172] [2024-11-09 10:01:18,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:01:18,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:01:18,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:01:18,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:01:18,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:01:18,440 INFO L87 Difference]: Start difference. First operand 1500 states and 1748 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:01:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:01:20,744 INFO L93 Difference]: Finished difference Result 1516 states and 1770 transitions. [2024-11-09 10:01:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:01:20,747 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-09 10:01:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:01:20,749 INFO L225 Difference]: With dead ends: 1516 [2024-11-09 10:01:20,749 INFO L226 Difference]: Without dead ends: 1516 [2024-11-09 10:01:20,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-09 10:01:20,750 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1572 mSDsluCounter, 8167 mSDsCounter, 0 mSdLazyCounter, 5402 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 9210 SdHoareTripleChecker+Invalid, 5428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:01:20,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 9210 Invalid, 5428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5402 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:01:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-09 10:01:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1512. [2024-11-09 10:01:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1036 states have (on average 1.6766409266409266) internal successors, (1737), 1500 states have internal predecessors, (1737), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:01:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1762 transitions. [2024-11-09 10:01:20,772 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1762 transitions. Word has length 91 [2024-11-09 10:01:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:01:20,773 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1762 transitions. [2024-11-09 10:01:20,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:01:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1762 transitions. [2024-11-09 10:01:20,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 10:01:20,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:01:20,774 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] [2024-11-09 10:01:20,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 10:01:20,774 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:01:20,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:01:20,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1708417765, now seen corresponding path program 1 times [2024-11-09 10:01:20,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:01:20,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440129633] [2024-11-09 10:01:20,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:20,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:01:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:21,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:01:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:21,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:01:21,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440129633] [2024-11-09 10:01:21,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440129633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:01:21,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:01:21,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 10:01:21,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35903212] [2024-11-09 10:01:21,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:01:21,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:01:21,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:01:21,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:01:21,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:01:21,683 INFO L87 Difference]: Start difference. First operand 1512 states and 1762 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:01:23,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:01:23,877 INFO L93 Difference]: Finished difference Result 1515 states and 1769 transitions. [2024-11-09 10:01:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:01:23,877 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-09 10:01:23,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:01:23,880 INFO L225 Difference]: With dead ends: 1515 [2024-11-09 10:01:23,881 INFO L226 Difference]: Without dead ends: 1515 [2024-11-09 10:01:23,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:01:23,882 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 1554 mSDsluCounter, 5443 mSDsCounter, 0 mSdLazyCounter, 4839 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 6493 SdHoareTripleChecker+Invalid, 4875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:01:23,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 6493 Invalid, 4875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4839 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:01:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-09 10:01:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1512. [2024-11-09 10:01:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1036 states have (on average 1.6756756756756757) internal successors, (1736), 1500 states have internal predecessors, (1736), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:01:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1761 transitions. [2024-11-09 10:01:23,898 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1761 transitions. Word has length 91 [2024-11-09 10:01:23,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:01:23,898 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1761 transitions. [2024-11-09 10:01:23,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:01:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1761 transitions. [2024-11-09 10:01:23,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:01:23,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:01:23,899 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] [2024-11-09 10:01:23,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 10:01:23,900 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:01:23,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:01:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash -29162422, now seen corresponding path program 1 times [2024-11-09 10:01:23,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:01:23,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345139739] [2024-11-09 10:01:23,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:23,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:01:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:24,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:01:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:24,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:01:24,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345139739] [2024-11-09 10:01:24,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345139739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:01:24,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073521565] [2024-11-09 10:01:24,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:24,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:01:24,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:01:24,538 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-09 10:01:24,540 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-09 10:01:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:24,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 10:01:24,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:01:24,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:01:24,914 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:01:24,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:01:24,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:01:24,981 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:01:24,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-09 10:01:25,017 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:01:25,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-09 10:01:25,052 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:01:25,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:01:25,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:01:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:25,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:01:25,081 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 10:01:25,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 10:01:25,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1390) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-09 10:01:25,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073521565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:01:25,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:01:25,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 19 [2024-11-09 10:01:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950828534] [2024-11-09 10:01:25,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:01:25,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 10:01:25,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:01:25,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 10:01:25,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=388, Unknown=15, NotChecked=40, Total=506 [2024-11-09 10:01:25,165 INFO L87 Difference]: Start difference. First operand 1512 states and 1761 transitions. Second operand has 20 states, 18 states have (on average 7.777777777777778) internal successors, (140), 19 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:01:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:01:27,230 INFO L93 Difference]: Finished difference Result 1514 states and 1768 transitions. [2024-11-09 10:01:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:01:27,230 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.777777777777778) internal successors, (140), 19 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-09 10:01:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:01:27,233 INFO L225 Difference]: With dead ends: 1514 [2024-11-09 10:01:27,233 INFO L226 Difference]: Without dead ends: 1514 [2024-11-09 10:01:27,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=786, Unknown=15, NotChecked=58, Total=992 [2024-11-09 10:01:27,233 INFO L432 NwaCegarLoop]: 1043 mSDtfsCounter, 1545 mSDsluCounter, 7148 mSDsCounter, 0 mSdLazyCounter, 4813 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 8191 SdHoareTripleChecker+Invalid, 4851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:01:27,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 8191 Invalid, 4851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4813 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:01:27,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-09 10:01:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1511. [2024-11-09 10:01:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1036 states have (on average 1.6747104247104247) internal successors, (1735), 1499 states have internal predecessors, (1735), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:01:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1760 transitions. [2024-11-09 10:01:27,249 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1760 transitions. Word has length 92 [2024-11-09 10:01:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:01:27,250 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1760 transitions. [2024-11-09 10:01:27,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.777777777777778) internal successors, (140), 19 states have internal predecessors, (140), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:01:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1760 transitions. [2024-11-09 10:01:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:01:27,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:01:27,251 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] [2024-11-09 10:01:27,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:01:27,451 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,SelfDestructingSolverStorable23 [2024-11-09 10:01:27,452 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:01:27,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:01:27,453 INFO L85 PathProgramCache]: Analyzing trace with hash -29162421, now seen corresponding path program 1 times [2024-11-09 10:01:27,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:01:27,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259221392] [2024-11-09 10:01:27,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:27,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:01:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:28,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:01:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:28,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:01:28,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259221392] [2024-11-09 10:01:28,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259221392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:01:28,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187271536] [2024-11-09 10:01:28,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:28,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:01:28,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:01:28,354 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:01:28,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 10:01:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:28,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 10:01:28,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:01:28,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:01:28,711 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:01:28,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:01:28,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:01:28,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:01:28,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 10:01:28,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 10:01:28,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:01:28,876 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:01:28,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:01:28,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:01:28,953 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:01:28,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:01:28,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:01:29,014 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:01:29,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:01:29,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:01:29,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:01:29,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:01:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:29,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:01:29,155 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1556 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:01:29,171 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1553))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1554) .cse0 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1554) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-09 10:01:29,187 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1554) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1553))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1554) .cse2 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-09 10:01:29,246 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1561))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1562) .cse0 v_ArrVal_1554) (select (select (store .cse1 .cse0 v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1556))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1561))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1553))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1554) .cse4 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-09 10:01:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187271536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:01:29,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:01:29,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2024-11-09 10:01:29,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759266324] [2024-11-09 10:01:29,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:01:29,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:01:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:01:29,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:01:29,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=389, Unknown=14, NotChecked=172, Total=650 [2024-11-09 10:01:29,251 INFO L87 Difference]: Start difference. First operand 1511 states and 1760 transitions. Second operand has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:01:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:01:34,166 INFO L93 Difference]: Finished difference Result 1513 states and 1767 transitions. [2024-11-09 10:01:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:01:34,167 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-09 10:01:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:01:34,170 INFO L225 Difference]: With dead ends: 1513 [2024-11-09 10:01:34,170 INFO L226 Difference]: Without dead ends: 1513 [2024-11-09 10:01:34,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=792, Unknown=15, NotChecked=244, Total=1190 [2024-11-09 10:01:34,171 INFO L432 NwaCegarLoop]: 1041 mSDtfsCounter, 1540 mSDsluCounter, 10177 mSDsCounter, 0 mSdLazyCounter, 9779 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 11218 SdHoareTripleChecker+Invalid, 9807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:01:34,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 11218 Invalid, 9807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 9779 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-09 10:01:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2024-11-09 10:01:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1498. [2024-11-09 10:01:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1025 states have (on average 1.68) internal successors, (1722), 1487 states have internal predecessors, (1722), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 10:01:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1746 transitions. [2024-11-09 10:01:34,187 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1746 transitions. Word has length 92 [2024-11-09 10:01:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:01:34,187 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 1746 transitions. [2024-11-09 10:01:34,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.117647058823529) internal successors, (138), 18 states have internal predecessors, (138), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:01:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1746 transitions. [2024-11-09 10:01:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:01:34,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:01:34,188 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] [2024-11-09 10:01:34,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 10:01:34,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:01:34,390 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:01:34,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:01:34,390 INFO L85 PathProgramCache]: Analyzing trace with hash 111786272, now seen corresponding path program 1 times [2024-11-09 10:01:34,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:01:34,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190180281] [2024-11-09 10:01:34,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:34,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:01:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:34,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:01:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:34,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:01:34,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190180281] [2024-11-09 10:01:34,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190180281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:01:34,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:01:34,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 10:01:34,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246950804] [2024-11-09 10:01:34,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:01:34,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:01:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:01:34,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:01:34,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:01:34,962 INFO L87 Difference]: Start difference. First operand 1498 states and 1746 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:01:37,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:01:37,982 INFO L93 Difference]: Finished difference Result 1517 states and 1771 transitions. [2024-11-09 10:01:37,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:01:37,983 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-09 10:01:37,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:01:37,985 INFO L225 Difference]: With dead ends: 1517 [2024-11-09 10:01:37,985 INFO L226 Difference]: Without dead ends: 1517 [2024-11-09 10:01:37,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-09 10:01:37,986 INFO L432 NwaCegarLoop]: 1042 mSDtfsCounter, 1569 mSDsluCounter, 11201 mSDsCounter, 0 mSdLazyCounter, 7198 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 12243 SdHoareTripleChecker+Invalid, 7223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:01:37,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 12243 Invalid, 7223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7198 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 10:01:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-09 10:01:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1513. [2024-11-09 10:01:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1039 states have (on average 1.672762271414822) internal successors, (1738), 1501 states have internal predecessors, (1738), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-09 10:01:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1763 transitions. [2024-11-09 10:01:38,002 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1763 transitions. Word has length 94 [2024-11-09 10:01:38,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:01:38,003 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1763 transitions. [2024-11-09 10:01:38,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:01:38,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1763 transitions. [2024-11-09 10:01:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:01:38,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:01:38,004 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] [2024-11-09 10:01:38,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 10:01:38,004 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-09 10:01:38,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:01:38,005 INFO L85 PathProgramCache]: Analyzing trace with hash 111786273, now seen corresponding path program 1 times [2024-11-09 10:01:38,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:01:38,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716086446] [2024-11-09 10:01:38,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:01:38,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:01:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:38,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 10:01:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:01:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:01:38,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:01:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716086446] [2024-11-09 10:01:38,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716086446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:01:38,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:01:38,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:01:38,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079979975] [2024-11-09 10:01:38,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:01:38,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:01:38,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:01:38,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:01:38,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:01:38,851 INFO L87 Difference]: Start difference. First operand 1513 states and 1763 transitions. Second operand has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)