./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.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 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:42:10,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:42:10,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:42:10,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:42:10,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:42:10,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:42:10,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:42:10,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:42:10,858 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:42:10,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:42:10,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:42:10,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:42:10,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:42:10,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:42:10,863 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:42:10,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:42:10,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:42:10,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:42:10,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:42:10,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:42:10,865 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:42:10,865 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:42:10,869 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:42:10,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:42:10,870 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:42:10,870 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:42:10,870 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:42:10,870 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:42:10,871 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:42:10,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:42:10,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:42:10,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:42:10,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:42:10,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:42:10,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:42:10,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:42:10,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:42:10,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:42:10,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:42:10,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:42:10,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:42:10,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:42:10,874 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 -> 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab [2024-10-24 16:42:11,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:42:11,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:42:11,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:42:11,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:42:11,183 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:42:11,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2024-10-24 16:42:12,668 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:42:12,945 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:42:12,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2024-10-24 16:42:12,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1c7368d/6595d23d09ac499abf53ad790671fc37/FLAG5fb34bee6 [2024-10-24 16:42:12,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1c7368d/6595d23d09ac499abf53ad790671fc37 [2024-10-24 16:42:12,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:42:12,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:42:12,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:42:12,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:42:12,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:42:12,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:42:12" (1/1) ... [2024-10-24 16:42:12,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fab6c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:12, skipping insertion in model container [2024-10-24 16:42:12,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:42:12" (1/1) ... [2024-10-24 16:42:13,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:42:13,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:42:13,566 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:42:13,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:42:13,705 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:42:13,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13 WrapperNode [2024-10-24 16:42:13,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:42:13,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:42:13,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:42:13,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:42:13,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13" (1/1) ... [2024-10-24 16:42:13,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13" (1/1) ... [2024-10-24 16:42:13,786 INFO L138 Inliner]: procedures = 184, calls = 145, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 236 [2024-10-24 16:42:13,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:42:13,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:42:13,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:42:13,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:42:13,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13" (1/1) ... [2024-10-24 16:42:13,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13" (1/1) ... [2024-10-24 16:42:13,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13" (1/1) ... [2024-10-24 16:42:13,854 INFO L175 MemorySlicer]: Split 91 memory accesses to 3 slices as follows [2, 70, 19]. 77 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 0, 9]. The 44 writes are split as follows [0, 38, 6]. [2024-10-24 16:42:13,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13" (1/1) ... [2024-10-24 16:42:13,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13" (1/1) ... [2024-10-24 16:42:13,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13" (1/1) ... [2024-10-24 16:42:13,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13" (1/1) ... [2024-10-24 16:42:13,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13" (1/1) ... [2024-10-24 16:42:13,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13" (1/1) ... [2024-10-24 16:42:13,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:42:13,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:42:13,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:42:13,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:42:13,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13" (1/1) ... [2024-10-24 16:42:13,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:42:13,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:42:13,935 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-10-24 16:42:13,938 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-10-24 16:42:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 16:42:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 16:42:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 16:42:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-24 16:42:13,983 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-24 16:42:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2024-10-24 16:42:13,983 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2024-10-24 16:42:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 16:42:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 16:42:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 16:42:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:42:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2024-10-24 16:42:13,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2024-10-24 16:42:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:42:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:42:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:42:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 16:42:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 16:42:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2024-10-24 16:42:13,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2024-10-24 16:42:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2024-10-24 16:42:13,984 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2024-10-24 16:42:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2024-10-24 16:42:13,985 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2024-10-24 16:42:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:42:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:42:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 16:42:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2024-10-24 16:42:13,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2024-10-24 16:42:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:42:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2024-10-24 16:42:13,986 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2024-10-24 16:42:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 16:42:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 16:42:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 16:42:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2024-10-24 16:42:13,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2024-10-24 16:42:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:42:13,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:42:14,166 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:42:14,168 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:42:14,965 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2024-10-24 16:42:14,965 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:42:15,023 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:42:15,024 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 16:42:15,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:42:15 BoogieIcfgContainer [2024-10-24 16:42:15,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:42:15,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:42:15,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:42:15,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:42:15,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:42:12" (1/3) ... [2024-10-24 16:42:15,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dbab49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:42:15, skipping insertion in model container [2024-10-24 16:42:15,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:42:13" (2/3) ... [2024-10-24 16:42:15,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dbab49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:42:15, skipping insertion in model container [2024-10-24 16:42:15,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:42:15" (3/3) ... [2024-10-24 16:42:15,035 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2024-10-24 16:42:15,050 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:42:15,050 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 158 error locations. [2024-10-24 16:42:15,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:42:15,104 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;@4e59a930, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:42:15,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 158 error locations. [2024-10-24 16:42:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 356 states, 159 states have (on average 2.1761006289308176) internal successors, (346), 317 states have internal predecessors, (346), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 16:42:15,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:42:15,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:15,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:42:15,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:15,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:15,119 INFO L85 PathProgramCache]: Analyzing trace with hash 592639688, now seen corresponding path program 1 times [2024-10-24 16:42:15,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:15,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197405548] [2024-10-24 16:42:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:15,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:15,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:15,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:15,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197405548] [2024-10-24 16:42:15,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197405548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:15,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:15,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:42:15,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543201593] [2024-10-24 16:42:15,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:15,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:42:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:15,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:42:15,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:42:15,485 INFO L87 Difference]: Start difference. First operand has 356 states, 159 states have (on average 2.1761006289308176) internal successors, (346), 317 states have internal predecessors, (346), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-10-24 16:42:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:16,281 INFO L93 Difference]: Finished difference Result 430 states and 536 transitions. [2024-10-24 16:42:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:42:16,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 5 [2024-10-24 16:42:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:16,301 INFO L225 Difference]: With dead ends: 430 [2024-10-24 16:42:16,301 INFO L226 Difference]: Without dead ends: 429 [2024-10-24 16:42:16,303 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-10-24 16:42:16,308 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 532 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:16,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 308 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:42:16,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-24 16:42:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 350. [2024-10-24 16:42:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 172 states have (on average 1.9883720930232558) internal successors, (342), 306 states have internal predecessors, (342), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-10-24 16:42:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 411 transitions. [2024-10-24 16:42:16,367 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 411 transitions. Word has length 5 [2024-10-24 16:42:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:16,368 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 411 transitions. [2024-10-24 16:42:16,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-10-24 16:42:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 411 transitions. [2024-10-24 16:42:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:42:16,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:16,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:42:16,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:42:16,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:16,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:16,371 INFO L85 PathProgramCache]: Analyzing trace with hash 592639689, now seen corresponding path program 1 times [2024-10-24 16:42:16,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:16,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896415680] [2024-10-24 16:42:16,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:16,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:16,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:16,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:16,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896415680] [2024-10-24 16:42:16,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896415680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:16,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:16,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:42:16,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502605684] [2024-10-24 16:42:16,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:16,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:42:16,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:16,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:42:16,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:42:16,541 INFO L87 Difference]: Start difference. First operand 350 states and 411 transitions. Second operand has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-10-24 16:42:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:17,242 INFO L93 Difference]: Finished difference Result 496 states and 640 transitions. [2024-10-24 16:42:17,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:42:17,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 5 [2024-10-24 16:42:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:17,249 INFO L225 Difference]: With dead ends: 496 [2024-10-24 16:42:17,249 INFO L226 Difference]: Without dead ends: 496 [2024-10-24 16:42:17,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:42:17,251 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 358 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:17,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 784 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:42:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-24 16:42:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 416. [2024-10-24 16:42:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 226 states have (on average 1.8628318584070795) internal successors, (421), 357 states have internal predecessors, (421), 42 states have call successors, (42), 18 states have call predecessors, (42), 19 states have return successors, (55), 40 states have call predecessors, (55), 42 states have call successors, (55) [2024-10-24 16:42:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 518 transitions. [2024-10-24 16:42:17,309 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 518 transitions. Word has length 5 [2024-10-24 16:42:17,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:17,309 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 518 transitions. [2024-10-24 16:42:17,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-10-24 16:42:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 518 transitions. [2024-10-24 16:42:17,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 16:42:17,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:17,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:17,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:42:17,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:17,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:17,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1277530176, now seen corresponding path program 1 times [2024-10-24 16:42:17,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:17,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216708405] [2024-10-24 16:42:17,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:17,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:17,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:17,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:17,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216708405] [2024-10-24 16:42:17,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216708405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:17,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:17,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:42:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000539226] [2024-10-24 16:42:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:17,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:42:17,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:17,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:42:17,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:42:17,493 INFO L87 Difference]: Start difference. First operand 416 states and 518 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-10-24 16:42:18,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:18,085 INFO L93 Difference]: Finished difference Result 470 states and 618 transitions. [2024-10-24 16:42:18,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:42:18,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 8 [2024-10-24 16:42:18,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:18,090 INFO L225 Difference]: With dead ends: 470 [2024-10-24 16:42:18,093 INFO L226 Difference]: Without dead ends: 470 [2024-10-24 16:42:18,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:42:18,094 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 144 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:18,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1028 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:42:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-24 16:42:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 415. [2024-10-24 16:42:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 226 states have (on average 1.8584070796460177) internal successors, (420), 356 states have internal predecessors, (420), 42 states have call successors, (42), 18 states have call predecessors, (42), 19 states have return successors, (55), 40 states have call predecessors, (55), 42 states have call successors, (55) [2024-10-24 16:42:18,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 517 transitions. [2024-10-24 16:42:18,124 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 517 transitions. Word has length 8 [2024-10-24 16:42:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:18,124 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 517 transitions. [2024-10-24 16:42:18,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-10-24 16:42:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 517 transitions. [2024-10-24 16:42:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 16:42:18,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:18,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:18,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:42:18,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:18,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:18,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1277530175, now seen corresponding path program 1 times [2024-10-24 16:42:18,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:18,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379224112] [2024-10-24 16:42:18,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:18,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:18,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:18,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:18,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379224112] [2024-10-24 16:42:18,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379224112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:18,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:18,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:42:18,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152919241] [2024-10-24 16:42:18,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:18,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:42:18,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:18,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:42:18,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:42:18,366 INFO L87 Difference]: Start difference. First operand 415 states and 517 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-10-24 16:42:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:18,984 INFO L93 Difference]: Finished difference Result 469 states and 617 transitions. [2024-10-24 16:42:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:42:18,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 8 [2024-10-24 16:42:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:18,988 INFO L225 Difference]: With dead ends: 469 [2024-10-24 16:42:18,990 INFO L226 Difference]: Without dead ends: 469 [2024-10-24 16:42:18,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:42:18,992 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 143 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:18,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1006 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:42:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-24 16:42:19,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 414. [2024-10-24 16:42:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 226 states have (on average 1.8539823008849559) internal successors, (419), 355 states have internal predecessors, (419), 42 states have call successors, (42), 18 states have call predecessors, (42), 19 states have return successors, (55), 40 states have call predecessors, (55), 42 states have call successors, (55) [2024-10-24 16:42:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 516 transitions. [2024-10-24 16:42:19,010 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 516 transitions. Word has length 8 [2024-10-24 16:42:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:19,011 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 516 transitions. [2024-10-24 16:42:19,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-10-24 16:42:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 516 transitions. [2024-10-24 16:42:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 16:42:19,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:19,012 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:19,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:42:19,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:19,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1687126741, now seen corresponding path program 1 times [2024-10-24 16:42:19,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:19,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845586402] [2024-10-24 16:42:19,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:19,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:19,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:19,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:19,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845586402] [2024-10-24 16:42:19,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845586402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:19,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:19,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:42:19,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288019010] [2024-10-24 16:42:19,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:19,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:42:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:19,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:42:19,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:42:19,085 INFO L87 Difference]: Start difference. First operand 414 states and 516 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:42:19,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:19,440 INFO L93 Difference]: Finished difference Result 468 states and 616 transitions. [2024-10-24 16:42:19,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:42:19,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-24 16:42:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:19,443 INFO L225 Difference]: With dead ends: 468 [2024-10-24 16:42:19,444 INFO L226 Difference]: Without dead ends: 468 [2024-10-24 16:42:19,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:42:19,447 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 143 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:19,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 653 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:42:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-10-24 16:42:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 413. [2024-10-24 16:42:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 226 states have (on average 1.8495575221238938) internal successors, (418), 354 states have internal predecessors, (418), 42 states have call successors, (42), 18 states have call predecessors, (42), 19 states have return successors, (55), 40 states have call predecessors, (55), 42 states have call successors, (55) [2024-10-24 16:42:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 515 transitions. [2024-10-24 16:42:19,465 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 515 transitions. Word has length 12 [2024-10-24 16:42:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:19,465 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 515 transitions. [2024-10-24 16:42:19,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:42:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 515 transitions. [2024-10-24 16:42:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 16:42:19,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:19,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:19,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:42:19,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:19,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:19,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1687126742, now seen corresponding path program 1 times [2024-10-24 16:42:19,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:19,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575878765] [2024-10-24 16:42:19,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:19,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:19,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:19,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575878765] [2024-10-24 16:42:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575878765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:19,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:19,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:42:19,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048108485] [2024-10-24 16:42:19,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:19,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:42:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:19,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:42:19,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:42:19,560 INFO L87 Difference]: Start difference. First operand 413 states and 515 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:42:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:19,933 INFO L93 Difference]: Finished difference Result 467 states and 615 transitions. [2024-10-24 16:42:19,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:42:19,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-24 16:42:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:19,936 INFO L225 Difference]: With dead ends: 467 [2024-10-24 16:42:19,936 INFO L226 Difference]: Without dead ends: 467 [2024-10-24 16:42:19,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:42:19,937 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 143 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:19,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 635 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:42:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-24 16:42:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 412. [2024-10-24 16:42:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 226 states have (on average 1.845132743362832) internal successors, (417), 353 states have internal predecessors, (417), 42 states have call successors, (42), 18 states have call predecessors, (42), 19 states have return successors, (55), 40 states have call predecessors, (55), 42 states have call successors, (55) [2024-10-24 16:42:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 514 transitions. [2024-10-24 16:42:19,951 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 514 transitions. Word has length 12 [2024-10-24 16:42:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:19,952 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 514 transitions. [2024-10-24 16:42:19,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:42:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 514 transitions. [2024-10-24 16:42:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:42:19,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:19,953 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] [2024-10-24 16:42:19,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:42:19,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:19,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1620820502, now seen corresponding path program 1 times [2024-10-24 16:42:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:19,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573163267] [2024-10-24 16:42:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:19,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:20,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:20,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:20,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573163267] [2024-10-24 16:42:20,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573163267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:20,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:20,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:42:20,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995512643] [2024-10-24 16:42:20,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:20,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:42:20,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:20,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:42:20,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:42:20,121 INFO L87 Difference]: Start difference. First operand 412 states and 514 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:42:20,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:20,848 INFO L93 Difference]: Finished difference Result 498 states and 671 transitions. [2024-10-24 16:42:20,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:42:20,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-24 16:42:20,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:20,852 INFO L225 Difference]: With dead ends: 498 [2024-10-24 16:42:20,852 INFO L226 Difference]: Without dead ends: 498 [2024-10-24 16:42:20,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:42:20,853 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 207 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:20,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1380 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:42:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-10-24 16:42:20,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 430. [2024-10-24 16:42:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 241 states have (on average 1.8257261410788381) internal successors, (440), 368 states have internal predecessors, (440), 43 states have call successors, (43), 20 states have call predecessors, (43), 21 states have return successors, (58), 41 states have call predecessors, (58), 43 states have call successors, (58) [2024-10-24 16:42:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 541 transitions. [2024-10-24 16:42:20,872 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 541 transitions. Word has length 20 [2024-10-24 16:42:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:20,873 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 541 transitions. [2024-10-24 16:42:20,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:42:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 541 transitions. [2024-10-24 16:42:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:42:20,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:20,874 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] [2024-10-24 16:42:20,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 16:42:20,874 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:20,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1620820501, now seen corresponding path program 1 times [2024-10-24 16:42:20,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:20,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641387813] [2024-10-24 16:42:20,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:20,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:21,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:21,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:21,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641387813] [2024-10-24 16:42:21,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641387813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:21,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:21,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:42:21,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128980228] [2024-10-24 16:42:21,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:21,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:42:21,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:21,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:42:21,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:42:21,195 INFO L87 Difference]: Start difference. First operand 430 states and 541 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:42:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:22,037 INFO L93 Difference]: Finished difference Result 497 states and 670 transitions. [2024-10-24 16:42:22,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:42:22,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-24 16:42:22,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:22,040 INFO L225 Difference]: With dead ends: 497 [2024-10-24 16:42:22,040 INFO L226 Difference]: Without dead ends: 497 [2024-10-24 16:42:22,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:42:22,041 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 205 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:22,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1326 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:42:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-24 16:42:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 430. [2024-10-24 16:42:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 241 states have (on average 1.8215767634854771) internal successors, (439), 368 states have internal predecessors, (439), 43 states have call successors, (43), 20 states have call predecessors, (43), 21 states have return successors, (58), 41 states have call predecessors, (58), 43 states have call successors, (58) [2024-10-24 16:42:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 540 transitions. [2024-10-24 16:42:22,054 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 540 transitions. Word has length 20 [2024-10-24 16:42:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:22,054 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 540 transitions. [2024-10-24 16:42:22,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:42:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 540 transitions. [2024-10-24 16:42:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:42:22,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:22,055 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] [2024-10-24 16:42:22,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 16:42:22,056 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:22,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1291351054, now seen corresponding path program 1 times [2024-10-24 16:42:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:22,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84834671] [2024-10-24 16:42:22,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:22,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:22,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:22,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84834671] [2024-10-24 16:42:22,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84834671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:22,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:22,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:42:22,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079635007] [2024-10-24 16:42:22,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:22,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:42:22,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:22,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:42:22,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:42:22,216 INFO L87 Difference]: Start difference. First operand 430 states and 540 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:42:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:22,943 INFO L93 Difference]: Finished difference Result 578 states and 788 transitions. [2024-10-24 16:42:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:42:22,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-24 16:42:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:22,947 INFO L225 Difference]: With dead ends: 578 [2024-10-24 16:42:22,947 INFO L226 Difference]: Without dead ends: 578 [2024-10-24 16:42:22,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:42:22,948 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 305 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:22,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1367 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:42:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-10-24 16:42:22,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 465. [2024-10-24 16:42:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 267 states have (on average 1.8052434456928839) internal successors, (482), 397 states have internal predecessors, (482), 49 states have call successors, (49), 24 states have call predecessors, (49), 24 states have return successors, (70), 43 states have call predecessors, (70), 49 states have call successors, (70) [2024-10-24 16:42:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 601 transitions. [2024-10-24 16:42:22,963 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 601 transitions. Word has length 21 [2024-10-24 16:42:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:22,964 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 601 transitions. [2024-10-24 16:42:22,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:42:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 601 transitions. [2024-10-24 16:42:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 16:42:22,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:22,965 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] [2024-10-24 16:42:22,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 16:42:22,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:22,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1291351055, now seen corresponding path program 1 times [2024-10-24 16:42:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:22,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016969787] [2024-10-24 16:42:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:23,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:23,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:23,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016969787] [2024-10-24 16:42:23,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016969787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:23,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:23,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:42:23,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503197325] [2024-10-24 16:42:23,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:23,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:42:23,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:23,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:42:23,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:42:23,177 INFO L87 Difference]: Start difference. First operand 465 states and 601 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:42:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:23,582 INFO L93 Difference]: Finished difference Result 483 states and 604 transitions. [2024-10-24 16:42:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:42:23,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-24 16:42:23,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:23,585 INFO L225 Difference]: With dead ends: 483 [2024-10-24 16:42:23,585 INFO L226 Difference]: Without dead ends: 483 [2024-10-24 16:42:23,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:42:23,587 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 231 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:23,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1272 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:42:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-24 16:42:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 462. [2024-10-24 16:42:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 260 states have (on average 1.7307692307692308) internal successors, (450), 387 states have internal predecessors, (450), 47 states have call successors, (47), 22 states have call predecessors, (47), 30 states have return successors, (98), 52 states have call predecessors, (98), 47 states have call successors, (98) [2024-10-24 16:42:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 595 transitions. [2024-10-24 16:42:23,602 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 595 transitions. Word has length 21 [2024-10-24 16:42:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:23,604 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 595 transitions. [2024-10-24 16:42:23,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:42:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 595 transitions. [2024-10-24 16:42:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-24 16:42:23,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:23,606 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] [2024-10-24 16:42:23,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 16:42:23,606 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:23,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:23,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1863902512, now seen corresponding path program 1 times [2024-10-24 16:42:23,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:23,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615889795] [2024-10-24 16:42:23,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:23,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:23,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:23,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:23,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:23,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615889795] [2024-10-24 16:42:23,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615889795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:23,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:23,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:42:23,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504258289] [2024-10-24 16:42:23,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:23,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:42:23,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:23,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:42:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:42:23,752 INFO L87 Difference]: Start difference. First operand 462 states and 595 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:24,136 INFO L93 Difference]: Finished difference Result 482 states and 613 transitions. [2024-10-24 16:42:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:42:24,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-10-24 16:42:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:24,139 INFO L225 Difference]: With dead ends: 482 [2024-10-24 16:42:24,140 INFO L226 Difference]: Without dead ends: 478 [2024-10-24 16:42:24,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:42:24,141 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 157 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:24,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1188 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:42:24,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-24 16:42:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 471. [2024-10-24 16:42:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 267 states have (on average 1.7191011235955056) internal successors, (459), 395 states have internal predecessors, (459), 47 states have call successors, (47), 23 states have call predecessors, (47), 32 states have return successors, (98), 52 states have call predecessors, (98), 47 states have call successors, (98) [2024-10-24 16:42:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 604 transitions. [2024-10-24 16:42:24,156 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 604 transitions. Word has length 30 [2024-10-24 16:42:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:24,157 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 604 transitions. [2024-10-24 16:42:24,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 604 transitions. [2024-10-24 16:42:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 16:42:24,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:24,158 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] [2024-10-24 16:42:24,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 16:42:24,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:24,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:24,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1016034481, now seen corresponding path program 1 times [2024-10-24 16:42:24,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:24,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365112330] [2024-10-24 16:42:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:24,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:24,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:24,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 16:42:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:24,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 16:42:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:24,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:24,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365112330] [2024-10-24 16:42:24,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365112330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:24,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:24,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 16:42:24,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166233199] [2024-10-24 16:42:24,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:24,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:42:24,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:24,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:42:24,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:42:24,488 INFO L87 Difference]: Start difference. First operand 471 states and 604 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:42:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:25,352 INFO L93 Difference]: Finished difference Result 499 states and 661 transitions. [2024-10-24 16:42:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:42:25,353 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2024-10-24 16:42:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:25,355 INFO L225 Difference]: With dead ends: 499 [2024-10-24 16:42:25,355 INFO L226 Difference]: Without dead ends: 493 [2024-10-24 16:42:25,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:42:25,356 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 295 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:25,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1801 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:42:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-10-24 16:42:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 471. [2024-10-24 16:42:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 267 states have (on average 1.7153558052434457) internal successors, (458), 395 states have internal predecessors, (458), 47 states have call successors, (47), 23 states have call predecessors, (47), 32 states have return successors, (98), 52 states have call predecessors, (98), 47 states have call successors, (98) [2024-10-24 16:42:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 603 transitions. [2024-10-24 16:42:25,371 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 603 transitions. Word has length 29 [2024-10-24 16:42:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:25,372 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 603 transitions. [2024-10-24 16:42:25,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:42:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 603 transitions. [2024-10-24 16:42:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:42:25,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:25,374 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] [2024-10-24 16:42:25,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 16:42:25,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:25,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:25,375 INFO L85 PathProgramCache]: Analyzing trace with hash 701222542, now seen corresponding path program 1 times [2024-10-24 16:42:25,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:25,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616689264] [2024-10-24 16:42:25,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:25,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:25,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:25,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:25,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:25,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616689264] [2024-10-24 16:42:25,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616689264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:25,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:25,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 16:42:25,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559694425] [2024-10-24 16:42:25,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:25,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:42:25,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:25,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:42:25,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:42:25,634 INFO L87 Difference]: Start difference. First operand 471 states and 603 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:42:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:26,972 INFO L93 Difference]: Finished difference Result 648 states and 957 transitions. [2024-10-24 16:42:26,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 16:42:26,973 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-10-24 16:42:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:26,976 INFO L225 Difference]: With dead ends: 648 [2024-10-24 16:42:26,977 INFO L226 Difference]: Without dead ends: 644 [2024-10-24 16:42:26,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2024-10-24 16:42:26,978 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 626 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:26,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1944 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 16:42:26,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-10-24 16:42:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 565. [2024-10-24 16:42:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 340 states have (on average 1.6823529411764706) internal successors, (572), 464 states have internal predecessors, (572), 59 states have call successors, (59), 30 states have call predecessors, (59), 41 states have return successors, (165), 70 states have call predecessors, (165), 59 states have call successors, (165) [2024-10-24 16:42:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 796 transitions. [2024-10-24 16:42:26,999 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 796 transitions. Word has length 32 [2024-10-24 16:42:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:26,999 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 796 transitions. [2024-10-24 16:42:27,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:42:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 796 transitions. [2024-10-24 16:42:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:42:27,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:27,002 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] [2024-10-24 16:42:27,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 16:42:27,002 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:27,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:27,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1940615075, now seen corresponding path program 1 times [2024-10-24 16:42:27,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:27,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324169894] [2024-10-24 16:42:27,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:27,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:27,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:27,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:27,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324169894] [2024-10-24 16:42:27,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324169894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:27,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:27,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:42:27,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220434292] [2024-10-24 16:42:27,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:27,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:42:27,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:27,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:42:27,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:42:27,441 INFO L87 Difference]: Start difference. First operand 565 states and 796 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:42:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:28,237 INFO L93 Difference]: Finished difference Result 637 states and 963 transitions. [2024-10-24 16:42:28,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:42:28,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-24 16:42:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:28,241 INFO L225 Difference]: With dead ends: 637 [2024-10-24 16:42:28,241 INFO L226 Difference]: Without dead ends: 637 [2024-10-24 16:42:28,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:42:28,242 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1145 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:28,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 377 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:42:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-24 16:42:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 573. [2024-10-24 16:42:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 360 states have (on average 1.5555555555555556) internal successors, (560), 460 states have internal predecessors, (560), 59 states have call successors, (59), 30 states have call predecessors, (59), 48 states have return successors, (213), 82 states have call predecessors, (213), 59 states have call successors, (213) [2024-10-24 16:42:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 832 transitions. [2024-10-24 16:42:28,263 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 832 transitions. Word has length 33 [2024-10-24 16:42:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:28,264 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 832 transitions. [2024-10-24 16:42:28,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:42:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 832 transitions. [2024-10-24 16:42:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 16:42:28,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:28,265 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] [2024-10-24 16:42:28,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 16:42:28,266 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:28,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:28,266 INFO L85 PathProgramCache]: Analyzing trace with hash 29525219, now seen corresponding path program 1 times [2024-10-24 16:42:28,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:28,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105411298] [2024-10-24 16:42:28,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:28,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:28,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:28,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:28,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105411298] [2024-10-24 16:42:28,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105411298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:28,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:28,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 16:42:28,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273505813] [2024-10-24 16:42:28,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:28,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:42:28,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:28,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:42:28,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:42:28,959 INFO L87 Difference]: Start difference. First operand 573 states and 832 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:42:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:29,861 INFO L93 Difference]: Finished difference Result 820 states and 1267 transitions. [2024-10-24 16:42:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:42:29,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-10-24 16:42:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:29,866 INFO L225 Difference]: With dead ends: 820 [2024-10-24 16:42:29,866 INFO L226 Difference]: Without dead ends: 818 [2024-10-24 16:42:29,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:42:29,867 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 712 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:29,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1162 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 16:42:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-10-24 16:42:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 706. [2024-10-24 16:42:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 459 states have (on average 1.5185185185185186) internal successors, (697), 559 states have internal predecessors, (697), 75 states have call successors, (75), 39 states have call predecessors, (75), 66 states have return successors, (296), 107 states have call predecessors, (296), 75 states have call successors, (296) [2024-10-24 16:42:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1068 transitions. [2024-10-24 16:42:29,897 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1068 transitions. Word has length 34 [2024-10-24 16:42:29,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:29,897 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 1068 transitions. [2024-10-24 16:42:29,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:42:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1068 transitions. [2024-10-24 16:42:29,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 16:42:29,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:29,898 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] [2024-10-24 16:42:29,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 16:42:29,898 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:29,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash 29525220, now seen corresponding path program 1 times [2024-10-24 16:42:29,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:29,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46215293] [2024-10-24 16:42:29,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:30,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:30,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:31,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:31,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46215293] [2024-10-24 16:42:31,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46215293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:31,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:31,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 16:42:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839499416] [2024-10-24 16:42:31,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:31,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:42:31,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:31,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:42:31,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:42:31,077 INFO L87 Difference]: Start difference. First operand 706 states and 1068 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:42:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:32,052 INFO L93 Difference]: Finished difference Result 863 states and 1283 transitions. [2024-10-24 16:42:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:42:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-10-24 16:42:32,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:32,059 INFO L225 Difference]: With dead ends: 863 [2024-10-24 16:42:32,059 INFO L226 Difference]: Without dead ends: 863 [2024-10-24 16:42:32,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:42:32,060 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 390 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:32,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1442 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 16:42:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-10-24 16:42:32,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 719. [2024-10-24 16:42:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 469 states have (on average 1.5053304904051172) internal successors, (706), 562 states have internal predecessors, (706), 74 states have call successors, (74), 39 states have call predecessors, (74), 70 states have return successors, (322), 117 states have call predecessors, (322), 74 states have call successors, (322) [2024-10-24 16:42:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1102 transitions. [2024-10-24 16:42:32,091 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1102 transitions. Word has length 34 [2024-10-24 16:42:32,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:32,091 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1102 transitions. [2024-10-24 16:42:32,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:42:32,092 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1102 transitions. [2024-10-24 16:42:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 16:42:32,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:32,094 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] [2024-10-24 16:42:32,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 16:42:32,095 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:32,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:32,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1691033244, now seen corresponding path program 1 times [2024-10-24 16:42:32,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:32,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188899747] [2024-10-24 16:42:32,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:32,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:32,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:32,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:32,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:32,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188899747] [2024-10-24 16:42:32,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188899747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:32,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:32,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:42:32,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413550894] [2024-10-24 16:42:32,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:32,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:42:32,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:32,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:42:32,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:42:32,189 INFO L87 Difference]: Start difference. First operand 719 states and 1102 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:32,498 INFO L93 Difference]: Finished difference Result 739 states and 1129 transitions. [2024-10-24 16:42:32,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:42:32,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-10-24 16:42:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:32,502 INFO L225 Difference]: With dead ends: 739 [2024-10-24 16:42:32,503 INFO L226 Difference]: Without dead ends: 739 [2024-10-24 16:42:32,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:42:32,503 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 261 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:32,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 595 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:42:32,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-10-24 16:42:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 717. [2024-10-24 16:42:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 469 states have (on average 1.4968017057569296) internal successors, (702), 560 states have internal predecessors, (702), 74 states have call successors, (74), 39 states have call predecessors, (74), 70 states have return successors, (322), 117 states have call predecessors, (322), 74 states have call successors, (322) [2024-10-24 16:42:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1098 transitions. [2024-10-24 16:42:32,530 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1098 transitions. Word has length 36 [2024-10-24 16:42:32,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:32,530 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1098 transitions. [2024-10-24 16:42:32,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1098 transitions. [2024-10-24 16:42:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 16:42:32,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:32,531 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] [2024-10-24 16:42:32,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 16:42:32,532 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:32,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:32,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1691033243, now seen corresponding path program 1 times [2024-10-24 16:42:32,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:32,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260858968] [2024-10-24 16:42:32,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:32,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:32,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:32,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:32,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:32,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260858968] [2024-10-24 16:42:32,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260858968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:32,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:32,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:42:32,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488981087] [2024-10-24 16:42:32,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:32,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:42:32,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:32,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:42:32,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:42:32,663 INFO L87 Difference]: Start difference. First operand 717 states and 1098 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:33,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:33,054 INFO L93 Difference]: Finished difference Result 737 states and 1125 transitions. [2024-10-24 16:42:33,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:42:33,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-10-24 16:42:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:33,058 INFO L225 Difference]: With dead ends: 737 [2024-10-24 16:42:33,058 INFO L226 Difference]: Without dead ends: 737 [2024-10-24 16:42:33,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:42:33,060 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 257 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:33,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 605 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:42:33,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-24 16:42:33,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 715. [2024-10-24 16:42:33,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 469 states have (on average 1.488272921108742) internal successors, (698), 558 states have internal predecessors, (698), 74 states have call successors, (74), 39 states have call predecessors, (74), 70 states have return successors, (322), 117 states have call predecessors, (322), 74 states have call successors, (322) [2024-10-24 16:42:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1094 transitions. [2024-10-24 16:42:33,085 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1094 transitions. Word has length 36 [2024-10-24 16:42:33,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:33,086 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1094 transitions. [2024-10-24 16:42:33,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1094 transitions. [2024-10-24 16:42:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 16:42:33,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:33,087 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:33,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 16:42:33,087 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:33,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash 416717473, now seen corresponding path program 1 times [2024-10-24 16:42:33,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:33,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819713655] [2024-10-24 16:42:33,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:33,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:33,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:33,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:33,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:33,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819713655] [2024-10-24 16:42:33,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819713655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:33,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:33,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:42:33,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181650136] [2024-10-24 16:42:33,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:33,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:42:33,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:33,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:42:33,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:42:33,309 INFO L87 Difference]: Start difference. First operand 715 states and 1094 transitions. Second operand has 9 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:34,073 INFO L93 Difference]: Finished difference Result 796 states and 1249 transitions. [2024-10-24 16:42:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:42:34,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-10-24 16:42:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:34,079 INFO L225 Difference]: With dead ends: 796 [2024-10-24 16:42:34,079 INFO L226 Difference]: Without dead ends: 796 [2024-10-24 16:42:34,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:42:34,080 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 187 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:34,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1447 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:42:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-10-24 16:42:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 754. [2024-10-24 16:42:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 501 states have (on average 1.4850299401197604) internal successors, (744), 591 states have internal predecessors, (744), 76 states have call successors, (76), 43 states have call predecessors, (76), 75 states have return successors, (333), 119 states have call predecessors, (333), 76 states have call successors, (333) [2024-10-24 16:42:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1153 transitions. [2024-10-24 16:42:34,107 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1153 transitions. Word has length 44 [2024-10-24 16:42:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:34,107 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1153 transitions. [2024-10-24 16:42:34,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1153 transitions. [2024-10-24 16:42:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-24 16:42:34,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:34,108 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:34,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 16:42:34,108 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:34,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash 416717474, now seen corresponding path program 1 times [2024-10-24 16:42:34,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:34,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855804658] [2024-10-24 16:42:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:34,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:34,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:34,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:34,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855804658] [2024-10-24 16:42:34,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855804658] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:42:34,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420455376] [2024-10-24 16:42:34,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:34,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:42:34,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:42:34,474 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-10-24 16:42:34,476 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-10-24 16:42:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:34,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:42:34,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:42:34,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 16:42:34,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 15 treesize of output 7 [2024-10-24 16:42:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:34,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:42:34,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420455376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:34,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:42:34,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 17 [2024-10-24 16:42:34,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103621277] [2024-10-24 16:42:34,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:34,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:42:34,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:34,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:42:34,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:42:34,819 INFO L87 Difference]: Start difference. First operand 754 states and 1153 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:35,305 INFO L93 Difference]: Finished difference Result 951 states and 1547 transitions. [2024-10-24 16:42:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:42:35,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-10-24 16:42:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:35,311 INFO L225 Difference]: With dead ends: 951 [2024-10-24 16:42:35,311 INFO L226 Difference]: Without dead ends: 947 [2024-10-24 16:42:35,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2024-10-24 16:42:35,312 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 180 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:35,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1807 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:42:35,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-10-24 16:42:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 904. [2024-10-24 16:42:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 618 states have (on average 1.470873786407767) internal successors, (909), 703 states have internal predecessors, (909), 93 states have call successors, (93), 53 states have call predecessors, (93), 91 states have return successors, (496), 147 states have call predecessors, (496), 93 states have call successors, (496) [2024-10-24 16:42:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1498 transitions. [2024-10-24 16:42:35,365 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1498 transitions. Word has length 44 [2024-10-24 16:42:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:35,365 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1498 transitions. [2024-10-24 16:42:35,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1498 transitions. [2024-10-24 16:42:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 16:42:35,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:35,366 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:35,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 16:42:35,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:42:35,567 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:35,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:35,568 INFO L85 PathProgramCache]: Analyzing trace with hash 30518839, now seen corresponding path program 1 times [2024-10-24 16:42:35,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:35,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445482253] [2024-10-24 16:42:35,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:35,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:35,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:35,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:35,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:35,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445482253] [2024-10-24 16:42:35,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445482253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:35,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:35,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:42:35,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663394771] [2024-10-24 16:42:35,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:35,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:42:35,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:35,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:42:35,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:42:35,751 INFO L87 Difference]: Start difference. First operand 904 states and 1498 transitions. Second operand has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:36,499 INFO L93 Difference]: Finished difference Result 1032 states and 1764 transitions. [2024-10-24 16:42:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:42:36,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-10-24 16:42:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:36,507 INFO L225 Difference]: With dead ends: 1032 [2024-10-24 16:42:36,507 INFO L226 Difference]: Without dead ends: 1032 [2024-10-24 16:42:36,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:42:36,508 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 441 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:36,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1262 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:42:36,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2024-10-24 16:42:36,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 931. [2024-10-24 16:42:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 639 states have (on average 1.4741784037558685) internal successors, (942), 724 states have internal predecessors, (942), 96 states have call successors, (96), 56 states have call predecessors, (96), 94 states have return successors, (508), 150 states have call predecessors, (508), 96 states have call successors, (508) [2024-10-24 16:42:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1546 transitions. [2024-10-24 16:42:36,546 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1546 transitions. Word has length 45 [2024-10-24 16:42:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:36,546 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1546 transitions. [2024-10-24 16:42:36,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1546 transitions. [2024-10-24 16:42:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 16:42:36,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:36,547 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:36,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 16:42:36,547 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:36,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash 30518840, now seen corresponding path program 1 times [2024-10-24 16:42:36,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:36,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416542067] [2024-10-24 16:42:36,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:36,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:36,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:36,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:36,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:36,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416542067] [2024-10-24 16:42:36,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416542067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:36,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:36,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:42:36,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692267944] [2024-10-24 16:42:36,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:36,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:42:36,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:36,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:42:36,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:42:36,867 INFO L87 Difference]: Start difference. First operand 931 states and 1546 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:37,566 INFO L93 Difference]: Finished difference Result 970 states and 1640 transitions. [2024-10-24 16:42:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:42:37,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-10-24 16:42:37,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:37,574 INFO L225 Difference]: With dead ends: 970 [2024-10-24 16:42:37,575 INFO L226 Difference]: Without dead ends: 970 [2024-10-24 16:42:37,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:42:37,576 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 195 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:37,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1453 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:42:37,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-24 16:42:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 931. [2024-10-24 16:42:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 639 states have (on average 1.4694835680751173) internal successors, (939), 724 states have internal predecessors, (939), 96 states have call successors, (96), 56 states have call predecessors, (96), 94 states have return successors, (508), 150 states have call predecessors, (508), 96 states have call successors, (508) [2024-10-24 16:42:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1543 transitions. [2024-10-24 16:42:37,611 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1543 transitions. Word has length 45 [2024-10-24 16:42:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:37,611 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1543 transitions. [2024-10-24 16:42:37,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1543 transitions. [2024-10-24 16:42:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 16:42:37,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:37,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:37,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 16:42:37,613 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:37,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:37,613 INFO L85 PathProgramCache]: Analyzing trace with hash 943806591, now seen corresponding path program 1 times [2024-10-24 16:42:37,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:37,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272253948] [2024-10-24 16:42:37,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:37,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:37,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:37,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:37,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:37,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272253948] [2024-10-24 16:42:37,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272253948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:37,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:37,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:42:37,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458002208] [2024-10-24 16:42:37,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:37,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:42:37,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:37,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:42:37,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:42:37,876 INFO L87 Difference]: Start difference. First operand 931 states and 1543 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:38,730 INFO L93 Difference]: Finished difference Result 1040 states and 1747 transitions. [2024-10-24 16:42:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:42:38,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-10-24 16:42:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:38,736 INFO L225 Difference]: With dead ends: 1040 [2024-10-24 16:42:38,737 INFO L226 Difference]: Without dead ends: 1040 [2024-10-24 16:42:38,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:42:38,737 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 258 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:38,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 2081 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:42:38,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2024-10-24 16:42:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1016. [2024-10-24 16:42:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 702 states have (on average 1.4259259259259258) internal successors, (1001), 777 states have internal predecessors, (1001), 98 states have call successors, (98), 60 states have call predecessors, (98), 114 states have return successors, (633), 178 states have call predecessors, (633), 98 states have call successors, (633) [2024-10-24 16:42:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1732 transitions. [2024-10-24 16:42:38,774 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1732 transitions. Word has length 46 [2024-10-24 16:42:38,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:38,774 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1732 transitions. [2024-10-24 16:42:38,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:42:38,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1732 transitions. [2024-10-24 16:42:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 16:42:38,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:38,775 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:38,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 16:42:38,776 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:38,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:38,776 INFO L85 PathProgramCache]: Analyzing trace with hash 42601631, now seen corresponding path program 1 times [2024-10-24 16:42:38,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:38,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345607034] [2024-10-24 16:42:38,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:38,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:39,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:39,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:39,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 16:42:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 16:42:39,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:39,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345607034] [2024-10-24 16:42:39,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345607034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:39,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:39,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 16:42:39,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36408406] [2024-10-24 16:42:39,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:39,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:42:39,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:39,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:42:39,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:42:39,093 INFO L87 Difference]: Start difference. First operand 1016 states and 1732 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:42:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:39,583 INFO L93 Difference]: Finished difference Result 1236 states and 2188 transitions. [2024-10-24 16:42:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:42:39,584 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-10-24 16:42:39,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:39,592 INFO L225 Difference]: With dead ends: 1236 [2024-10-24 16:42:39,592 INFO L226 Difference]: Without dead ends: 1236 [2024-10-24 16:42:39,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:42:39,593 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 356 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:39,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 2126 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:42:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-10-24 16:42:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1179. [2024-10-24 16:42:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 837 states have (on average 1.4121863799283154) internal successors, (1182), 912 states have internal predecessors, (1182), 110 states have call successors, (110), 80 states have call predecessors, (110), 130 states have return successors, (708), 186 states have call predecessors, (708), 110 states have call successors, (708) [2024-10-24 16:42:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 2000 transitions. [2024-10-24 16:42:39,646 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 2000 transitions. Word has length 51 [2024-10-24 16:42:39,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:39,646 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 2000 transitions. [2024-10-24 16:42:39,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:42:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 2000 transitions. [2024-10-24 16:42:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 16:42:39,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:39,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:39,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 16:42:39,647 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:39,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash -38488065, now seen corresponding path program 1 times [2024-10-24 16:42:39,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:39,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283776075] [2024-10-24 16:42:39,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:39,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:39,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:39,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 16:42:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 16:42:39,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:39,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283776075] [2024-10-24 16:42:39,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283776075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:39,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:39,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:42:39,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66363767] [2024-10-24 16:42:39,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:39,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:42:39,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:39,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:42:39,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:42:39,766 INFO L87 Difference]: Start difference. First operand 1179 states and 2000 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:42:40,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:40,181 INFO L93 Difference]: Finished difference Result 1180 states and 2001 transitions. [2024-10-24 16:42:40,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:42:40,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-10-24 16:42:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:40,187 INFO L225 Difference]: With dead ends: 1180 [2024-10-24 16:42:40,187 INFO L226 Difference]: Without dead ends: 1180 [2024-10-24 16:42:40,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:42:40,188 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 253 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:40,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 765 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:42:40,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-10-24 16:42:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1177. [2024-10-24 16:42:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 837 states have (on average 1.4097968936678613) internal successors, (1180), 910 states have internal predecessors, (1180), 110 states have call successors, (110), 80 states have call predecessors, (110), 130 states have return successors, (708), 186 states have call predecessors, (708), 110 states have call successors, (708) [2024-10-24 16:42:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1998 transitions. [2024-10-24 16:42:40,227 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1998 transitions. Word has length 51 [2024-10-24 16:42:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:40,227 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1998 transitions. [2024-10-24 16:42:40,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:42:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1998 transitions. [2024-10-24 16:42:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 16:42:40,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:40,228 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:40,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 16:42:40,228 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:40,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:40,229 INFO L85 PathProgramCache]: Analyzing trace with hash -38488064, now seen corresponding path program 1 times [2024-10-24 16:42:40,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:40,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736086201] [2024-10-24 16:42:40,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:40,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:41,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:41,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 16:42:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:42:41,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:41,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736086201] [2024-10-24 16:42:41,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736086201] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:42:41,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447120876] [2024-10-24 16:42:41,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:41,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:42:41,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:42:41,240 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-10-24 16:42:41,241 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-10-24 16:42:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:41,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-24 16:42:41,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:42:41,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-24 16:42:41,474 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 7 treesize of output 6 [2024-10-24 16:42:41,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-10-24 16:42:41,498 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-10-24 16:42:41,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-10-24 16:42:41,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-10-24 16:42:41,551 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-24 16:42:41,552 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 68 treesize of output 63 [2024-10-24 16:42:41,557 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 38 treesize of output 21 [2024-10-24 16:42:41,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 20 [2024-10-24 16:42:41,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-10-24 16:42:41,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-10-24 16:42:41,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-10-24 16:42:41,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-10-24 16:42:41,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-10-24 16:42:41,681 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 23 treesize of output 11 [2024-10-24 16:42:41,685 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 6 treesize of output 4 [2024-10-24 16:42:41,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 20 [2024-10-24 16:42:41,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-10-24 16:42:41,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-10-24 16:42:41,783 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 16 treesize of output 12 [2024-10-24 16:42:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:42:41,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:42:41,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447120876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:41,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:42:41,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 16 [2024-10-24 16:42:41,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051286767] [2024-10-24 16:42:41,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:41,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:42:41,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:41,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:42:41,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:42:41,796 INFO L87 Difference]: Start difference. First operand 1177 states and 1998 transitions. Second operand has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:42:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:42,650 INFO L93 Difference]: Finished difference Result 1175 states and 1983 transitions. [2024-10-24 16:42:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:42:42,651 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2024-10-24 16:42:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:42,656 INFO L225 Difference]: With dead ends: 1175 [2024-10-24 16:42:42,657 INFO L226 Difference]: Without dead ends: 1175 [2024-10-24 16:42:42,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 51 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:42:42,658 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 204 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:42,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1886 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:42:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2024-10-24 16:42:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1161. [2024-10-24 16:42:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 823 states have (on average 1.4119076549210205) internal successors, (1162), 896 states have internal predecessors, (1162), 109 states have call successors, (109), 79 states have call predecessors, (109), 129 states have return successors, (699), 185 states have call predecessors, (699), 109 states have call successors, (699) [2024-10-24 16:42:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1970 transitions. [2024-10-24 16:42:42,698 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1970 transitions. Word has length 51 [2024-10-24 16:42:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:42,698 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1970 transitions. [2024-10-24 16:42:42,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:42:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1970 transitions. [2024-10-24 16:42:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 16:42:42,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:42,699 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:42,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 16:42:42,903 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,SelfDestructingSolverStorable25 [2024-10-24 16:42:42,904 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:42,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:42,904 INFO L85 PathProgramCache]: Analyzing trace with hash 374565685, now seen corresponding path program 1 times [2024-10-24 16:42:42,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:42,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482376677] [2024-10-24 16:42:42,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:42,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:43,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:42:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:43,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 16:42:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:43,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 16:42:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:42:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 16:42:43,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:42:43,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482376677] [2024-10-24 16:42:43,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482376677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:42:43,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:42:43,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:42:43,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751452783] [2024-10-24 16:42:43,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:42:43,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:42:43,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:42:43,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:42:43,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:42:43,028 INFO L87 Difference]: Start difference. First operand 1161 states and 1970 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:42:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:42:43,457 INFO L93 Difference]: Finished difference Result 1162 states and 1971 transitions. [2024-10-24 16:42:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:42:43,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2024-10-24 16:42:43,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:42:43,464 INFO L225 Difference]: With dead ends: 1162 [2024-10-24 16:42:43,464 INFO L226 Difference]: Without dead ends: 1162 [2024-10-24 16:42:43,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:42:43,465 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 127 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:42:43,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 874 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:42:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2024-10-24 16:42:43,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1159. [2024-10-24 16:42:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 823 states have (on average 1.4094775212636694) internal successors, (1160), 894 states have internal predecessors, (1160), 109 states have call successors, (109), 79 states have call predecessors, (109), 129 states have return successors, (699), 185 states have call predecessors, (699), 109 states have call successors, (699) [2024-10-24 16:42:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1968 transitions. [2024-10-24 16:42:43,502 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1968 transitions. Word has length 52 [2024-10-24 16:42:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:42:43,502 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1968 transitions. [2024-10-24 16:42:43,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:42:43,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1968 transitions. [2024-10-24 16:42:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 16:42:43,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:42:43,504 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:42:43,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 16:42:43,505 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-24 16:42:43,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:42:43,506 INFO L85 PathProgramCache]: Analyzing trace with hash 374565686, now seen corresponding path program 1 times [2024-10-24 16:42:43,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:42:43,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426046649] [2024-10-24 16:42:43,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:42:43,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:42:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:42:43,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 16:42:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 16:42:43,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 16:42:43,596 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 16:42:43,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 158 remaining) [2024-10-24 16:42:43,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 158 remaining) [2024-10-24 16:42:43,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 158 remaining) [2024-10-24 16:42:43,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 158 remaining) [2024-10-24 16:42:43,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 158 remaining) [2024-10-24 16:42:43,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 158 remaining) [2024-10-24 16:42:43,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 158 remaining) [2024-10-24 16:42:43,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 158 remaining) [2024-10-24 16:42:43,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 158 remaining) [2024-10-24 16:42:43,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 158 remaining) [2024-10-24 16:42:43,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 158 remaining) [2024-10-24 16:42:43,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 158 remaining) [2024-10-24 16:42:43,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 158 remaining) [2024-10-24 16:42:43,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 158 remaining) [2024-10-24 16:42:43,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 158 remaining) [2024-10-24 16:42:43,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 158 remaining) [2024-10-24 16:42:43,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 158 remaining) [2024-10-24 16:42:43,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 158 remaining) [2024-10-24 16:42:43,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 158 remaining) [2024-10-24 16:42:43,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 158 remaining) [2024-10-24 16:42:43,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 158 remaining) [2024-10-24 16:42:43,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 158 remaining) [2024-10-24 16:42:43,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 158 remaining) [2024-10-24 16:42:43,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 158 remaining) [2024-10-24 16:42:43,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 158 remaining) [2024-10-24 16:42:43,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 158 remaining) [2024-10-24 16:42:43,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 158 remaining) [2024-10-24 16:42:43,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 158 remaining) [2024-10-24 16:42:43,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 158 remaining) [2024-10-24 16:42:43,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 158 remaining) [2024-10-24 16:42:43,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 158 remaining) [2024-10-24 16:42:43,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 158 remaining) [2024-10-24 16:42:43,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 158 remaining) [2024-10-24 16:42:43,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 158 remaining) [2024-10-24 16:42:43,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 158 remaining) [2024-10-24 16:42:43,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 158 remaining) [2024-10-24 16:42:43,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 158 remaining) [2024-10-24 16:42:43,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 158 remaining) [2024-10-24 16:42:43,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 158 remaining) [2024-10-24 16:42:43,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 158 remaining) [2024-10-24 16:42:43,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 158 remaining) [2024-10-24 16:42:43,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 158 remaining) [2024-10-24 16:42:43,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 158 remaining) [2024-10-24 16:42:43,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 158 remaining) [2024-10-24 16:42:43,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 158 remaining) [2024-10-24 16:42:43,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 158 remaining) [2024-10-24 16:42:43,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 158 remaining) [2024-10-24 16:42:43,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 158 remaining) [2024-10-24 16:42:43,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 158 remaining) [2024-10-24 16:42:43,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 158 remaining) [2024-10-24 16:42:43,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 158 remaining) [2024-10-24 16:42:43,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 158 remaining) [2024-10-24 16:42:43,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 158 remaining) [2024-10-24 16:42:43,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 158 remaining) [2024-10-24 16:42:43,607 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 158 remaining) [2024-10-24 16:42:43,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 158 remaining) [2024-10-24 16:42:43,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 158 remaining) [2024-10-24 16:42:43,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 158 remaining) [2024-10-24 16:42:43,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 158 remaining) [2024-10-24 16:42:43,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 158 remaining) [2024-10-24 16:42:43,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 158 remaining) [2024-10-24 16:42:43,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 158 remaining) [2024-10-24 16:42:43,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 158 remaining) [2024-10-24 16:42:43,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 158 remaining) [2024-10-24 16:42:43,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 158 remaining) [2024-10-24 16:42:43,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 158 remaining) [2024-10-24 16:42:43,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 158 remaining) [2024-10-24 16:42:43,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 158 remaining) [2024-10-24 16:42:43,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 158 remaining) [2024-10-24 16:42:43,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 158 remaining) [2024-10-24 16:42:43,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 158 remaining) [2024-10-24 16:42:43,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 158 remaining) [2024-10-24 16:42:43,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 158 remaining) [2024-10-24 16:42:43,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 158 remaining) [2024-10-24 16:42:43,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 158 remaining) [2024-10-24 16:42:43,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 158 remaining) [2024-10-24 16:42:43,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 158 remaining) [2024-10-24 16:42:43,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 158 remaining) [2024-10-24 16:42:43,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 158 remaining) [2024-10-24 16:42:43,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 158 remaining) [2024-10-24 16:42:43,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 158 remaining) [2024-10-24 16:42:43,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 158 remaining) [2024-10-24 16:42:43,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 158 remaining) [2024-10-24 16:42:43,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 158 remaining) [2024-10-24 16:42:43,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 158 remaining) [2024-10-24 16:42:43,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 158 remaining) [2024-10-24 16:42:43,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 158 remaining) [2024-10-24 16:42:43,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 158 remaining) [2024-10-24 16:42:43,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 158 remaining) [2024-10-24 16:42:43,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 158 remaining) [2024-10-24 16:42:43,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 158 remaining) [2024-10-24 16:42:43,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 158 remaining) [2024-10-24 16:42:43,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 158 remaining) [2024-10-24 16:42:43,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 158 remaining) [2024-10-24 16:42:43,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 158 remaining) [2024-10-24 16:42:43,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 158 remaining) [2024-10-24 16:42:43,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 158 remaining) [2024-10-24 16:42:43,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 158 remaining) [2024-10-24 16:42:43,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 158 remaining) [2024-10-24 16:42:43,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 158 remaining) [2024-10-24 16:42:43,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 158 remaining) [2024-10-24 16:42:43,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 158 remaining) [2024-10-24 16:42:43,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 158 remaining) [2024-10-24 16:42:43,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 158 remaining) [2024-10-24 16:42:43,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 158 remaining) [2024-10-24 16:42:43,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 158 remaining) [2024-10-24 16:42:43,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 158 remaining) [2024-10-24 16:42:43,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 158 remaining) [2024-10-24 16:42:43,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 158 remaining) [2024-10-24 16:42:43,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 158 remaining) [2024-10-24 16:42:43,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 158 remaining) [2024-10-24 16:42:43,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 158 remaining) [2024-10-24 16:42:43,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 158 remaining) [2024-10-24 16:42:43,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 158 remaining) [2024-10-24 16:42:43,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 158 remaining) [2024-10-24 16:42:43,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 158 remaining) [2024-10-24 16:42:43,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 158 remaining) [2024-10-24 16:42:43,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 158 remaining) [2024-10-24 16:42:43,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 158 remaining) [2024-10-24 16:42:43,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 158 remaining) [2024-10-24 16:42:43,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 158 remaining) [2024-10-24 16:42:43,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 158 remaining) [2024-10-24 16:42:43,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 158 remaining) [2024-10-24 16:42:43,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 158 remaining) [2024-10-24 16:42:43,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (33 of 158 remaining) [2024-10-24 16:42:43,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (32 of 158 remaining) [2024-10-24 16:42:43,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 158 remaining) [2024-10-24 16:42:43,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 158 remaining) [2024-10-24 16:42:43,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 158 remaining) [2024-10-24 16:42:43,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 158 remaining) [2024-10-24 16:42:43,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 158 remaining) [2024-10-24 16:42:43,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 158 remaining) [2024-10-24 16:42:43,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 158 remaining) [2024-10-24 16:42:43,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 158 remaining) [2024-10-24 16:42:43,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 158 remaining) [2024-10-24 16:42:43,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 158 remaining) [2024-10-24 16:42:43,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 158 remaining) [2024-10-24 16:42:43,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 158 remaining) [2024-10-24 16:42:43,619 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 158 remaining) [2024-10-24 16:42:43,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 158 remaining) [2024-10-24 16:42:43,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 158 remaining) [2024-10-24 16:42:43,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 158 remaining) [2024-10-24 16:42:43,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 158 remaining) [2024-10-24 16:42:43,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 158 remaining) [2024-10-24 16:42:43,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 158 remaining) [2024-10-24 16:42:43,620 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 158 remaining) [2024-10-24 16:42:43,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 158 remaining) [2024-10-24 16:42:43,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 158 remaining) [2024-10-24 16:42:43,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 158 remaining) [2024-10-24 16:42:43,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 158 remaining) [2024-10-24 16:42:43,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 158 remaining) [2024-10-24 16:42:43,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 158 remaining) [2024-10-24 16:42:43,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 158 remaining) [2024-10-24 16:42:43,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 158 remaining) [2024-10-24 16:42:43,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 158 remaining) [2024-10-24 16:42:43,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 158 remaining) [2024-10-24 16:42:43,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 158 remaining) [2024-10-24 16:42:43,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 158 remaining) [2024-10-24 16:42:43,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 16:42:43,625 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-24 16:42:43,667 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 16:42:43,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:42:43 BoogieIcfgContainer [2024-10-24 16:42:43,676 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 16:42:43,677 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 16:42:43,677 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 16:42:43,677 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 16:42:43,678 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:42:15" (3/4) ... [2024-10-24 16:42:43,678 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 16:42:43,737 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 16:42:43,740 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 16:42:43,740 INFO L158 Benchmark]: Toolchain (without parser) took 30764.09ms. Allocated memory was 174.1MB in the beginning and 465.6MB in the end (delta: 291.5MB). Free memory was 106.3MB in the beginning and 236.1MB in the end (delta: -129.8MB). Peak memory consumption was 164.1MB. Max. memory is 16.1GB. [2024-10-24 16:42:43,741 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 107.0MB. Free memory was 78.9MB in the beginning and 78.8MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:42:43,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 728.00ms. Allocated memory is still 174.1MB. Free memory was 106.1MB in the beginning and 131.5MB in the end (delta: -25.4MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-10-24 16:42:43,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.12ms. Allocated memory is still 174.1MB. Free memory was 131.5MB in the beginning and 128.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:42:43,741 INFO L158 Benchmark]: Boogie Preprocessor took 110.85ms. Allocated memory is still 174.1MB. Free memory was 128.7MB in the beginning and 123.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 16:42:43,741 INFO L158 Benchmark]: RCFGBuilder took 1124.68ms. Allocated memory is still 174.1MB. Free memory was 123.1MB in the beginning and 119.5MB in the end (delta: 3.6MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2024-10-24 16:42:43,742 INFO L158 Benchmark]: TraceAbstraction took 28648.02ms. Allocated memory was 174.1MB in the beginning and 465.6MB in the end (delta: 291.5MB). Free memory was 119.5MB in the beginning and 240.3MB in the end (delta: -120.8MB). Peak memory consumption was 170.6MB. Max. memory is 16.1GB. [2024-10-24 16:42:43,742 INFO L158 Benchmark]: Witness Printer took 62.94ms. Allocated memory is still 465.6MB. Free memory was 239.3MB in the beginning and 236.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 16:42:43,743 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 107.0MB. Free memory was 78.9MB in the beginning and 78.8MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 728.00ms. Allocated memory is still 174.1MB. Free memory was 106.1MB in the beginning and 131.5MB in the end (delta: -25.4MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.12ms. Allocated memory is still 174.1MB. Free memory was 131.5MB in the beginning and 128.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.85ms. Allocated memory is still 174.1MB. Free memory was 128.7MB in the beginning and 123.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1124.68ms. Allocated memory is still 174.1MB. Free memory was 123.1MB in the beginning and 119.5MB in the end (delta: 3.6MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. * TraceAbstraction took 28648.02ms. Allocated memory was 174.1MB in the beginning and 465.6MB in the end (delta: 291.5MB). Free memory was 119.5MB in the beginning and 240.3MB in the end (delta: -120.8MB). Peak memory consumption was 170.6MB. Max. memory is 16.1GB. * Witness Printer took 62.94ms. Allocated memory is still 465.6MB. Free memory was 239.3MB in the beginning and 236.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L779] user_t *user; [L975] user = malloc(sizeof(user_t)) [L976] CALL user_initialize() [L966] EXPR, FCALL calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L966] user->info = calloc(1, sizeof(info_t)) [L967] user->message.id = 11 VAL [user={-1:0}] [L968] EXPR user->info VAL [user={-1:0}] [L968] user->info->is_valid = 0 [L969] user->status = AS_NULL VAL [user={-1:0}] [L970] user->user_id = 11 VAL [user={-1:0}] [L971] user->timeout = 3 [L976] RET user_initialize() [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; VAL [user={-1:0}] [L978] e.primitive = _EVENT_START VAL [user={-1:0}] [L979] CALL event_precess(&e) VAL [\old(e)={10:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [\old(e)={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: VAL [\old(e)={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L948] CALL ASNull(e) VAL [\old(e)={10:0}, user={-1:0}] [L838] EXPR e->primitive [L838] e_primitive_t primitive = e->primitive; [L839] COND TRUE primitive == _EVENT_START VAL [\old(e)={10:0}, user={-1:0}] [L840] CALL status_update(AS_START) VAL [\old(status)=2, user={-1:0}] [L814] COND TRUE status < AS_STATE_MAX VAL [\old(status)=2, status=2, user={-1:0}] [L815] EXPR user->status VAL [\old(status)=2, status=2, user={-1:0}] [L815] COND TRUE user->status != status [L816] user->status = status [L817] return 10; VAL [\old(status)=2, \result=10, user={-1:0}] [L840] RET status_update(AS_START) VAL [\old(e)={10:0}, user={-1:0}] [L841] CALL system_initialize() VAL [user={-1:0}] [L829] event_t e = {0}; [L829] event_t e = {0}; [L829] event_t e = {0}; [L829] event_t e = {0}; VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info->is_valid VAL [e={9:0}, user={-1:0}] [L830] COND TRUE !user->info->is_valid [L831] e.primitive = _EVENT_CLOSE VAL [e={9:0}, user={-1:0}] [L835] CALL event_precess(&e) VAL [\old(e)={9:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [\old(e)={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: [L950] case AS_START: VAL [\old(e)={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L951] CALL ASStart(e) VAL [\old(e)={9:0}, user={-1:0}] [L881] EXPR e->primitive [L881] e_primitive_t primitive = e->primitive; [L882] int rc = -1; [L884] case _EVENT_OPEN: VAL [\old(e)={9:0}, e={9:0}, primitive=3, rc=-1, user={-1:0}] [L884] case _EVENT_OPEN: [L898] case _EVENT_CLOSE: VAL [\old(e)={9:0}, e={9:0}, rc=-1, user={-1:0}] [L898] case _EVENT_CLOSE: [L899] message_t *message = &user->message; [L900] EXPR, FCALL calloc(0, sizeof(*message)) VAL [\old(e)={9:0}, e={9:0}, rc=-1, user={-1:0}] [L900] message = calloc(0, sizeof(*message)) [L901] message->id = 3 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 973]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 356 locations, 158 error locations. Started 1 CEGAR loops. OverallTime: 28.5s, OverallIterations: 28, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8464 SdHoareTripleChecker+Valid, 15.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8455 mSDsluCounter, 32574 SdHoareTripleChecker+Invalid, 13.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24723 mSDsCounter, 2529 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20227 IncrementalHoareTripleChecker+Invalid, 22756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2529 mSolverCounterUnsat, 7851 mSDtfsCounter, 20227 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 207 SyntacticMatches, 9 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1179occurred in iteration=24, InterpolantAutomatonStates: 242, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 27 MinimizatonAttempts, 1446 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 972 NumberOfCodeBlocks, 972 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 891 ConstructedInterpolants, 0 QuantifiedInterpolants, 4804 SizeOfPredicates, 16 NumberOfNonLiveVariables, 926 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 29 InterpolantComputations, 27 PerfectInterpolantSequences, 61/63 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 16:42:43,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)