./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 a046e57d 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:06:09,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:06:09,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:06:09,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:06:09,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:06:09,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:06:09,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:06:09,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:06:09,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:06:09,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:06:09,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:06:09,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:06:09,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:06:09,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:06:09,707 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:06:09,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:06:09,707 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:06:09,711 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:06:09,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:06:09,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:06:09,712 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:06:09,712 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:06:09,712 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:06:09,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:06:09,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:06:09,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:06:09,713 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:06:09,713 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:06:09,713 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:06:09,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:06:09,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:06:09,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:06:09,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:06:09,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:06:09,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:06:09,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:06:09,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:06:09,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:06:09,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:06:09,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:06:09,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:06:09,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:06:09,715 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-13 11:06:09,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:06:09,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:06:09,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:06:09,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:06:09,924 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:06:09,925 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-13 11:06:11,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:06:11,323 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:06:11,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2024-10-13 11:06:11,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08c312d6/b1517d06914a4e7ca2d1d9e18d18f7c0/FLAGb9d287567 [2024-10-13 11:06:11,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08c312d6/b1517d06914a4e7ca2d1d9e18d18f7c0 [2024-10-13 11:06:11,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:06:11,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:06:11,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:06:11,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:06:11,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:06:11,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ea2bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11, skipping insertion in model container [2024-10-13 11:06:11,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:06:11,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:06:11,742 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:06:11,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:06:11,825 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:06:11,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11 WrapperNode [2024-10-13 11:06:11,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:06:11,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:06:11,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:06:11,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:06:11,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,873 INFO L138 Inliner]: procedures = 184, calls = 145, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 236 [2024-10-13 11:06:11,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:06:11,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:06:11,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:06:11,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:06:11,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,924 INFO L175 MemorySlicer]: Split 91 memory accesses to 3 slices as follows [2, 19, 70]. 77 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9, 0]. The 44 writes are split as follows [0, 6, 38]. [2024-10-13 11:06:11,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:06:11,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:06:11,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:06:11,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:06:11,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11" (1/1) ... [2024-10-13 11:06:11,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:06:11,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:06:12,001 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-13 11:06:12,004 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-13 11:06:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 11:06:12,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 11:06:12,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 11:06:12,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-13 11:06:12,039 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-13 11:06:12,039 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2024-10-13 11:06:12,039 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2024-10-13 11:06:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 11:06:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 11:06:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 11:06:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:06:12,041 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2024-10-13 11:06:12,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2024-10-13 11:06:12,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:06:12,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:06:12,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:06:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:06:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:06:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2024-10-13 11:06:12,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2024-10-13 11:06:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2024-10-13 11:06:12,042 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2024-10-13 11:06:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2024-10-13 11:06:12,043 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2024-10-13 11:06:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:06:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:06:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:06:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2024-10-13 11:06:12,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2024-10-13 11:06:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:06:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2024-10-13 11:06:12,045 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2024-10-13 11:06:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 11:06:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 11:06:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 11:06:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2024-10-13 11:06:12,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2024-10-13 11:06:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:06:12,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:06:12,201 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:06:12,203 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:06:12,870 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2024-10-13 11:06:12,871 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:06:12,922 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:06:12,923 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 11:06:12,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:06:12 BoogieIcfgContainer [2024-10-13 11:06:12,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:06:12,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:06:12,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:06:12,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:06:12,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:06:11" (1/3) ... [2024-10-13 11:06:12,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a261a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:06:12, skipping insertion in model container [2024-10-13 11:06:12,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:06:11" (2/3) ... [2024-10-13 11:06:12,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a261a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:06:12, skipping insertion in model container [2024-10-13 11:06:12,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:06:12" (3/3) ... [2024-10-13 11:06:12,931 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2024-10-13 11:06:12,942 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:06:12,942 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 158 error locations. [2024-10-13 11:06:12,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:06:12,995 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;@481ae23f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:06:12,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 158 error locations. [2024-10-13 11:06:12,998 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-13 11:06:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 11:06:13,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:13,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 11:06:13,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:13,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:13,009 INFO L85 PathProgramCache]: Analyzing trace with hash 592639688, now seen corresponding path program 1 times [2024-10-13 11:06:13,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:13,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033164407] [2024-10-13 11:06:13,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:13,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:13,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:13,241 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-13 11:06:13,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:13,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033164407] [2024-10-13 11:06:13,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033164407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:13,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:13,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:06:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227911330] [2024-10-13 11:06:13,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:13,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:06:13,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:13,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:06:13,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:06:13,273 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-13 11:06:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:13,877 INFO L93 Difference]: Finished difference Result 430 states and 536 transitions. [2024-10-13 11:06:13,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:06:13,879 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-13 11:06:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:13,892 INFO L225 Difference]: With dead ends: 430 [2024-10-13 11:06:13,892 INFO L226 Difference]: Without dead ends: 429 [2024-10-13 11:06:13,894 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-13 11:06:13,898 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 532 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:13,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 310 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:06:13,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-13 11:06:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 350. [2024-10-13 11:06:13,963 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-13 11:06:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 411 transitions. [2024-10-13 11:06:13,966 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 411 transitions. Word has length 5 [2024-10-13 11:06:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:13,967 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 411 transitions. [2024-10-13 11:06:13,967 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-13 11:06:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 411 transitions. [2024-10-13 11:06:13,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 11:06:13,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:13,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 11:06:13,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 11:06:13,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:13,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash 592639689, now seen corresponding path program 1 times [2024-10-13 11:06:13,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:13,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982758277] [2024-10-13 11:06:13,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:13,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:14,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:14,139 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-13 11:06:14,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:14,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982758277] [2024-10-13 11:06:14,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982758277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:14,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:14,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:06:14,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148739098] [2024-10-13 11:06:14,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:14,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:06:14,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:14,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:06:14,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:06:14,146 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-13 11:06:14,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:14,651 INFO L93 Difference]: Finished difference Result 496 states and 640 transitions. [2024-10-13 11:06:14,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:06:14,652 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-13 11:06:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:14,655 INFO L225 Difference]: With dead ends: 496 [2024-10-13 11:06:14,655 INFO L226 Difference]: Without dead ends: 496 [2024-10-13 11:06:14,658 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-13 11:06:14,658 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 358 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:14,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 788 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:06:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-13 11:06:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 416. [2024-10-13 11:06:14,686 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-13 11:06:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 518 transitions. [2024-10-13 11:06:14,689 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 518 transitions. Word has length 5 [2024-10-13 11:06:14,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:14,689 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 518 transitions. [2024-10-13 11:06:14,689 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-13 11:06:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 518 transitions. [2024-10-13 11:06:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 11:06:14,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:14,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:06:14,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 11:06:14,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:14,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:14,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1277530176, now seen corresponding path program 1 times [2024-10-13 11:06:14,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:14,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010613939] [2024-10-13 11:06:14,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:14,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:14,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:14,803 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-13 11:06:14,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:14,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010613939] [2024-10-13 11:06:14,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010613939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:14,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:14,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:06:14,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588431791] [2024-10-13 11:06:14,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:14,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:06:14,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:14,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:06:14,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:06:14,804 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-13 11:06:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:15,258 INFO L93 Difference]: Finished difference Result 470 states and 618 transitions. [2024-10-13 11:06:15,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:06:15,259 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-13 11:06:15,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:15,261 INFO L225 Difference]: With dead ends: 470 [2024-10-13 11:06:15,261 INFO L226 Difference]: Without dead ends: 470 [2024-10-13 11:06:15,261 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-13 11:06:15,262 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 144 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:15,265 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.4s Time] [2024-10-13 11:06:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-13 11:06:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 415. [2024-10-13 11:06:15,284 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-13 11:06:15,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 517 transitions. [2024-10-13 11:06:15,286 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 517 transitions. Word has length 8 [2024-10-13 11:06:15,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:15,287 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 517 transitions. [2024-10-13 11:06:15,287 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-13 11:06:15,287 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 517 transitions. [2024-10-13 11:06:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 11:06:15,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:15,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:06:15,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 11:06:15,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:15,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1277530175, now seen corresponding path program 1 times [2024-10-13 11:06:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940764894] [2024-10-13 11:06:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:15,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:15,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:15,451 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-13 11:06:15,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:15,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940764894] [2024-10-13 11:06:15,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940764894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:15,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:15,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:06:15,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344831932] [2024-10-13 11:06:15,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:15,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:06:15,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:15,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:06:15,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:06:15,456 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-13 11:06:15,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:15,939 INFO L93 Difference]: Finished difference Result 469 states and 617 transitions. [2024-10-13 11:06:15,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:06:15,939 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-13 11:06:15,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:15,943 INFO L225 Difference]: With dead ends: 469 [2024-10-13 11:06:15,944 INFO L226 Difference]: Without dead ends: 469 [2024-10-13 11:06:15,944 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-13 11:06:15,945 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 143 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1014 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.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:15,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1014 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 11:06:15,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-13 11:06:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 414. [2024-10-13 11:06:15,961 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-13 11:06:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 516 transitions. [2024-10-13 11:06:15,964 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 516 transitions. Word has length 8 [2024-10-13 11:06:15,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:15,964 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 516 transitions. [2024-10-13 11:06:15,964 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-13 11:06:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 516 transitions. [2024-10-13 11:06:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:06:15,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:15,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:06:15,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 11:06:15,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:15,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:15,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1687126741, now seen corresponding path program 1 times [2024-10-13 11:06:15,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:15,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722795761] [2024-10-13 11:06:15,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:15,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:16,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:16,010 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-13 11:06:16,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:16,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722795761] [2024-10-13 11:06:16,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722795761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:16,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:16,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:06:16,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444779903] [2024-10-13 11:06:16,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:16,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:06:16,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:16,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:06:16,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:06:16,012 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-13 11:06:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:16,288 INFO L93 Difference]: Finished difference Result 468 states and 616 transitions. [2024-10-13 11:06:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:06:16,288 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-13 11:06:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:16,290 INFO L225 Difference]: With dead ends: 468 [2024-10-13 11:06:16,290 INFO L226 Difference]: Without dead ends: 468 [2024-10-13 11:06:16,290 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-13 11:06:16,291 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 143 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 649 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-13 11:06:16,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 649 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 11:06:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-10-13 11:06:16,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 413. [2024-10-13 11:06:16,298 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-13 11:06:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 515 transitions. [2024-10-13 11:06:16,300 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 515 transitions. Word has length 12 [2024-10-13 11:06:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:16,300 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 515 transitions. [2024-10-13 11:06:16,301 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-13 11:06:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 515 transitions. [2024-10-13 11:06:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:06:16,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:16,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:06:16,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 11:06:16,301 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:16,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:16,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1687126742, now seen corresponding path program 1 times [2024-10-13 11:06:16,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:16,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12555410] [2024-10-13 11:06:16,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:16,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:16,361 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-13 11:06:16,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12555410] [2024-10-13 11:06:16,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12555410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:16,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:16,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:06:16,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031473798] [2024-10-13 11:06:16,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:16,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:06:16,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:16,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:06:16,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:06:16,363 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-13 11:06:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:16,661 INFO L93 Difference]: Finished difference Result 467 states and 615 transitions. [2024-10-13 11:06:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:06:16,661 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-13 11:06:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:16,663 INFO L225 Difference]: With dead ends: 467 [2024-10-13 11:06:16,663 INFO L226 Difference]: Without dead ends: 467 [2024-10-13 11:06:16,663 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-13 11:06:16,664 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 143 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:16,664 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.3s Time] [2024-10-13 11:06:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-13 11:06:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 412. [2024-10-13 11:06:16,672 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-13 11:06:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 514 transitions. [2024-10-13 11:06:16,673 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 514 transitions. Word has length 12 [2024-10-13 11:06:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:16,674 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 514 transitions. [2024-10-13 11:06:16,674 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-13 11:06:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 514 transitions. [2024-10-13 11:06:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 11:06:16,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:16,674 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-13 11:06:16,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 11:06:16,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:16,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:16,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1620820502, now seen corresponding path program 1 times [2024-10-13 11:06:16,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:16,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389537896] [2024-10-13 11:06:16,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:16,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:16,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:16,812 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-13 11:06:16,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:16,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389537896] [2024-10-13 11:06:16,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389537896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:16,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:16,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 11:06:16,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503226926] [2024-10-13 11:06:16,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:16,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:06:16,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:16,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:06:16,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:06:16,814 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-13 11:06:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:17,373 INFO L93 Difference]: Finished difference Result 498 states and 671 transitions. [2024-10-13 11:06:17,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:06:17,374 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-13 11:06:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:17,376 INFO L225 Difference]: With dead ends: 498 [2024-10-13 11:06:17,376 INFO L226 Difference]: Without dead ends: 498 [2024-10-13 11:06:17,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-13 11:06:17,377 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 207 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:17,377 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.5s Time] [2024-10-13 11:06:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-10-13 11:06:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 430. [2024-10-13 11:06:17,384 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-13 11:06:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 541 transitions. [2024-10-13 11:06:17,386 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 541 transitions. Word has length 20 [2024-10-13 11:06:17,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:17,386 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 541 transitions. [2024-10-13 11:06:17,387 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-13 11:06:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 541 transitions. [2024-10-13 11:06:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 11:06:17,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:17,387 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-13 11:06:17,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 11:06:17,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:17,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:17,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1620820501, now seen corresponding path program 1 times [2024-10-13 11:06:17,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:17,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49921790] [2024-10-13 11:06:17,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:17,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:17,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:17,628 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-13 11:06:17,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:17,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49921790] [2024-10-13 11:06:17,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49921790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:17,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:17,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 11:06:17,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777720605] [2024-10-13 11:06:17,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:17,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:06:17,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:17,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:06:17,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:06:17,633 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-13 11:06:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:18,266 INFO L93 Difference]: Finished difference Result 497 states and 670 transitions. [2024-10-13 11:06:18,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:06:18,267 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-13 11:06:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:18,271 INFO L225 Difference]: With dead ends: 497 [2024-10-13 11:06:18,271 INFO L226 Difference]: Without dead ends: 497 [2024-10-13 11:06:18,271 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-13 11:06:18,272 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 205 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:18,272 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.6s Time] [2024-10-13 11:06:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-13 11:06:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 430. [2024-10-13 11:06:18,282 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-13 11:06:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 540 transitions. [2024-10-13 11:06:18,284 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 540 transitions. Word has length 20 [2024-10-13 11:06:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:18,285 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 540 transitions. [2024-10-13 11:06:18,285 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-13 11:06:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 540 transitions. [2024-10-13 11:06:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 11:06:18,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:18,286 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-13 11:06:18,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 11:06:18,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:18,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1291351054, now seen corresponding path program 1 times [2024-10-13 11:06:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:18,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932535968] [2024-10-13 11:06:18,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:18,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:18,408 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-13 11:06:18,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:18,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932535968] [2024-10-13 11:06:18,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932535968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:18,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:18,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 11:06:18,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970339960] [2024-10-13 11:06:18,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:18,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:06:18,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:18,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:06:18,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:06:18,411 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-13 11:06:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:19,057 INFO L93 Difference]: Finished difference Result 578 states and 788 transitions. [2024-10-13 11:06:19,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 11:06:19,057 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-13 11:06:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:19,060 INFO L225 Difference]: With dead ends: 578 [2024-10-13 11:06:19,060 INFO L226 Difference]: Without dead ends: 578 [2024-10-13 11:06:19,060 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-13 11:06:19,061 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 305 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:19,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1367 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:06:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-10-13 11:06:19,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 465. [2024-10-13 11:06:19,075 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-13 11:06:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 601 transitions. [2024-10-13 11:06:19,077 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 601 transitions. Word has length 21 [2024-10-13 11:06:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:19,077 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 601 transitions. [2024-10-13 11:06:19,077 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-13 11:06:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 601 transitions. [2024-10-13 11:06:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 11:06:19,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:19,078 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-13 11:06:19,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 11:06:19,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:19,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:19,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1291351055, now seen corresponding path program 1 times [2024-10-13 11:06:19,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:19,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968813535] [2024-10-13 11:06:19,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:19,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:19,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:19,242 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-13 11:06:19,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:19,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968813535] [2024-10-13 11:06:19,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968813535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:19,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:19,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:06:19,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732035756] [2024-10-13 11:06:19,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:19,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:06:19,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:19,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:06:19,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:06:19,244 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-13 11:06:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:19,579 INFO L93 Difference]: Finished difference Result 483 states and 604 transitions. [2024-10-13 11:06:19,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 11:06:19,580 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-13 11:06:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:19,581 INFO L225 Difference]: With dead ends: 483 [2024-10-13 11:06:19,581 INFO L226 Difference]: Without dead ends: 483 [2024-10-13 11:06:19,582 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-13 11:06:19,582 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 231 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:19,582 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.3s Time] [2024-10-13 11:06:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-13 11:06:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 462. [2024-10-13 11:06:19,589 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-13 11:06:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 595 transitions. [2024-10-13 11:06:19,591 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 595 transitions. Word has length 21 [2024-10-13 11:06:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:19,591 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 595 transitions. [2024-10-13 11:06:19,591 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-13 11:06:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 595 transitions. [2024-10-13 11:06:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 11:06:19,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:19,592 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-13 11:06:19,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 11:06:19,592 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:19,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:19,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1863902512, now seen corresponding path program 1 times [2024-10-13 11:06:19,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:19,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947334067] [2024-10-13 11:06:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:19,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:19,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:19,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:19,698 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-13 11:06:19,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:19,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947334067] [2024-10-13 11:06:19,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947334067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:19,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:19,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:06:19,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002104432] [2024-10-13 11:06:19,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:19,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:06:19,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:19,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:06:19,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:06:19,699 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-13 11:06:19,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:19,996 INFO L93 Difference]: Finished difference Result 482 states and 613 transitions. [2024-10-13 11:06:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 11:06:19,996 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-13 11:06:19,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:19,998 INFO L225 Difference]: With dead ends: 482 [2024-10-13 11:06:19,998 INFO L226 Difference]: Without dead ends: 478 [2024-10-13 11:06:19,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:06:19,998 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 157 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-13 11:06:19,998 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-13 11:06:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-13 11:06:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 471. [2024-10-13 11:06:20,005 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-13 11:06:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 604 transitions. [2024-10-13 11:06:20,007 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 604 transitions. Word has length 30 [2024-10-13 11:06:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:20,007 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 604 transitions. [2024-10-13 11:06:20,007 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-13 11:06:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 604 transitions. [2024-10-13 11:06:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:06:20,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:20,008 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-13 11:06:20,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 11:06:20,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:20,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:20,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1016034481, now seen corresponding path program 1 times [2024-10-13 11:06:20,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:20,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993918337] [2024-10-13 11:06:20,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:20,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:20,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:20,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 11:06:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:20,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 11:06:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:20,250 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-13 11:06:20,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:20,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993918337] [2024-10-13 11:06:20,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993918337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:20,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:20,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 11:06:20,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131553921] [2024-10-13 11:06:20,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:20,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:06:20,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:20,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:06:20,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:06:20,252 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-13 11:06:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:20,962 INFO L93 Difference]: Finished difference Result 499 states and 661 transitions. [2024-10-13 11:06:20,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:06:20,965 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-13 11:06:20,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:20,967 INFO L225 Difference]: With dead ends: 499 [2024-10-13 11:06:20,967 INFO L226 Difference]: Without dead ends: 493 [2024-10-13 11:06:20,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-13 11:06:20,968 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 295 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:20,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1792 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:06:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-10-13 11:06:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 471. [2024-10-13 11:06:20,976 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-13 11:06:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 603 transitions. [2024-10-13 11:06:20,977 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 603 transitions. Word has length 29 [2024-10-13 11:06:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:20,977 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 603 transitions. [2024-10-13 11:06:20,977 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-13 11:06:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 603 transitions. [2024-10-13 11:06:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 11:06:20,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:20,978 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-13 11:06:20,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 11:06:20,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:20,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash 701222542, now seen corresponding path program 1 times [2024-10-13 11:06:20,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:20,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656752762] [2024-10-13 11:06:20,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:20,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:21,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:21,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:21,165 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-13 11:06:21,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:21,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656752762] [2024-10-13 11:06:21,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656752762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:21,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:21,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 11:06:21,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960999159] [2024-10-13 11:06:21,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:21,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:06:21,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:21,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:06:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:06:21,168 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-13 11:06:22,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:22,205 INFO L93 Difference]: Finished difference Result 648 states and 957 transitions. [2024-10-13 11:06:22,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 11:06:22,205 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-13 11:06:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:22,208 INFO L225 Difference]: With dead ends: 648 [2024-10-13 11:06:22,208 INFO L226 Difference]: Without dead ends: 644 [2024-10-13 11:06:22,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2024-10-13 11:06:22,209 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 622 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:22,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1961 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 11:06:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-10-13 11:06:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 565. [2024-10-13 11:06:22,224 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-13 11:06:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 796 transitions. [2024-10-13 11:06:22,227 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 796 transitions. Word has length 32 [2024-10-13 11:06:22,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:22,227 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 796 transitions. [2024-10-13 11:06:22,227 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-13 11:06:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 796 transitions. [2024-10-13 11:06:22,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:06:22,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:22,229 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-13 11:06:22,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 11:06:22,229 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:22,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1940615075, now seen corresponding path program 1 times [2024-10-13 11:06:22,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:22,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886886637] [2024-10-13 11:06:22,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:22,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:22,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:22,504 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-13 11:06:22,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:22,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886886637] [2024-10-13 11:06:22,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886886637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:22,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:22,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 11:06:22,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806960699] [2024-10-13 11:06:22,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:22,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:06:22,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:22,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:06:22,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:06:22,506 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-13 11:06:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:23,189 INFO L93 Difference]: Finished difference Result 637 states and 963 transitions. [2024-10-13 11:06:23,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 11:06:23,190 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-13 11:06:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:23,194 INFO L225 Difference]: With dead ends: 637 [2024-10-13 11:06:23,194 INFO L226 Difference]: Without dead ends: 637 [2024-10-13 11:06:23,197 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-13 11:06:23,197 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1145 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:23,198 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.6s Time] [2024-10-13 11:06:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-13 11:06:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 573. [2024-10-13 11:06:23,212 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-13 11:06:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 832 transitions. [2024-10-13 11:06:23,214 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 832 transitions. Word has length 33 [2024-10-13 11:06:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:23,215 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 832 transitions. [2024-10-13 11:06:23,215 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-13 11:06:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 832 transitions. [2024-10-13 11:06:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 11:06:23,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:23,216 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-13 11:06:23,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 11:06:23,217 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:23,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:23,217 INFO L85 PathProgramCache]: Analyzing trace with hash 29525219, now seen corresponding path program 1 times [2024-10-13 11:06:23,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:23,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196886328] [2024-10-13 11:06:23,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:23,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:23,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:23,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:23,665 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-13 11:06:23,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:23,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196886328] [2024-10-13 11:06:23,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196886328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:23,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:23,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 11:06:23,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983564651] [2024-10-13 11:06:23,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:23,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 11:06:23,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:23,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 11:06:23,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 11:06:23,667 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-13 11:06:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:24,457 INFO L93 Difference]: Finished difference Result 820 states and 1267 transitions. [2024-10-13 11:06:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 11:06:24,457 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-13 11:06:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:24,461 INFO L225 Difference]: With dead ends: 820 [2024-10-13 11:06:24,461 INFO L226 Difference]: Without dead ends: 818 [2024-10-13 11:06:24,461 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-13 11:06:24,462 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 712 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:24,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1158 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:06:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-10-13 11:06:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 706. [2024-10-13 11:06:24,482 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-13 11:06:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1068 transitions. [2024-10-13 11:06:24,485 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1068 transitions. Word has length 34 [2024-10-13 11:06:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:24,485 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 1068 transitions. [2024-10-13 11:06:24,485 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-13 11:06:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1068 transitions. [2024-10-13 11:06:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 11:06:24,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:24,487 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-13 11:06:24,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 11:06:24,488 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:24,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:24,496 INFO L85 PathProgramCache]: Analyzing trace with hash 29525220, now seen corresponding path program 1 times [2024-10-13 11:06:24,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:24,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891840058] [2024-10-13 11:06:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:24,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:25,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:25,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:25,225 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-13 11:06:25,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:25,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891840058] [2024-10-13 11:06:25,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891840058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:25,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:25,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 11:06:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633662579] [2024-10-13 11:06:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:25,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 11:06:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:25,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 11:06:25,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-13 11:06:25,227 INFO L87 Difference]: Start difference. First operand 706 states and 1068 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 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-13 11:06:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:26,266 INFO L93 Difference]: Finished difference Result 884 states and 1306 transitions. [2024-10-13 11:06:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 11:06:26,266 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 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-13 11:06:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:26,270 INFO L225 Difference]: With dead ends: 884 [2024-10-13 11:06:26,270 INFO L226 Difference]: Without dead ends: 884 [2024-10-13 11:06:26,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2024-10-13 11:06:26,270 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 646 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:26,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1370 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:06:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-10-13 11:06:26,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 719. [2024-10-13 11:06:26,284 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-13 11:06:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1102 transitions. [2024-10-13 11:06:26,287 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1102 transitions. Word has length 34 [2024-10-13 11:06:26,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:26,287 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 1102 transitions. [2024-10-13 11:06:26,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 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-13 11:06:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1102 transitions. [2024-10-13 11:06:26,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 11:06:26,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:26,288 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-13 11:06:26,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 11:06:26,288 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:26,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:26,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1691033244, now seen corresponding path program 1 times [2024-10-13 11:06:26,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:26,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304843326] [2024-10-13 11:06:26,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:26,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:26,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:26,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:26,344 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-13 11:06:26,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:26,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304843326] [2024-10-13 11:06:26,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304843326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:26,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:26,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:06:26,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910986974] [2024-10-13 11:06:26,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:26,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:06:26,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:26,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:06:26,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:06:26,346 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-13 11:06:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:26,630 INFO L93 Difference]: Finished difference Result 739 states and 1129 transitions. [2024-10-13 11:06:26,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:06:26,630 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-13 11:06:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:26,633 INFO L225 Difference]: With dead ends: 739 [2024-10-13 11:06:26,636 INFO L226 Difference]: Without dead ends: 739 [2024-10-13 11:06:26,636 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-13 11:06:26,636 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 261 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 604 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:26,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 604 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:06:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-10-13 11:06:26,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 717. [2024-10-13 11:06:26,653 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-13 11:06:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1098 transitions. [2024-10-13 11:06:26,657 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1098 transitions. Word has length 36 [2024-10-13 11:06:26,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:26,658 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1098 transitions. [2024-10-13 11:06:26,658 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-13 11:06:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1098 transitions. [2024-10-13 11:06:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 11:06:26,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:26,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:06:26,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 11:06:26,658 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:26,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:26,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1691033243, now seen corresponding path program 1 times [2024-10-13 11:06:26,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:26,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568599236] [2024-10-13 11:06:26,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:26,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:26,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:26,747 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-13 11:06:26,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:26,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568599236] [2024-10-13 11:06:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568599236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:26,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:26,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:06:26,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235129137] [2024-10-13 11:06:26,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:26,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:06:26,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:26,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:06:26,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:06:26,752 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-13 11:06:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:26,998 INFO L93 Difference]: Finished difference Result 737 states and 1125 transitions. [2024-10-13 11:06:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:06:26,999 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-13 11:06:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:27,002 INFO L225 Difference]: With dead ends: 737 [2024-10-13 11:06:27,002 INFO L226 Difference]: Without dead ends: 737 [2024-10-13 11:06:27,002 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-13 11:06:27,003 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 257 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 610 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:27,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 610 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:06:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-13 11:06:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 715. [2024-10-13 11:06:27,019 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-13 11:06:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1094 transitions. [2024-10-13 11:06:27,021 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1094 transitions. Word has length 36 [2024-10-13 11:06:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:27,021 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1094 transitions. [2024-10-13 11:06:27,021 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-13 11:06:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1094 transitions. [2024-10-13 11:06:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 11:06:27,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:27,023 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-13 11:06:27,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 11:06:27,023 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:27,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:27,023 INFO L85 PathProgramCache]: Analyzing trace with hash 416717473, now seen corresponding path program 1 times [2024-10-13 11:06:27,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:27,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296303368] [2024-10-13 11:06:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:27,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:27,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:27,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:27,156 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-13 11:06:27,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:27,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296303368] [2024-10-13 11:06:27,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296303368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:27,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:27,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 11:06:27,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91701862] [2024-10-13 11:06:27,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:27,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 11:06:27,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:27,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 11:06:27,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:06:27,158 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-13 11:06:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:27,689 INFO L93 Difference]: Finished difference Result 796 states and 1249 transitions. [2024-10-13 11:06:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:06:27,689 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-13 11:06:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:27,693 INFO L225 Difference]: With dead ends: 796 [2024-10-13 11:06:27,693 INFO L226 Difference]: Without dead ends: 796 [2024-10-13 11:06:27,693 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-13 11:06:27,694 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 331 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:27,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1325 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:06:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-10-13 11:06:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 754. [2024-10-13 11:06:27,708 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-13 11:06:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1153 transitions. [2024-10-13 11:06:27,711 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1153 transitions. Word has length 44 [2024-10-13 11:06:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:27,711 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1153 transitions. [2024-10-13 11:06:27,711 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-13 11:06:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1153 transitions. [2024-10-13 11:06:27,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 11:06:27,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:27,711 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-13 11:06:27,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 11:06:27,711 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:27,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:27,712 INFO L85 PathProgramCache]: Analyzing trace with hash 416717474, now seen corresponding path program 1 times [2024-10-13 11:06:27,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:27,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381638638] [2024-10-13 11:06:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:27,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:27,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:27,975 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-13 11:06:27,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:27,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381638638] [2024-10-13 11:06:27,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381638638] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:06:27,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660391677] [2024-10-13 11:06:27,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:27,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:06:27,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:06:27,978 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-13 11:06:27,979 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-13 11:06:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:28,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 11:06:28,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:06:28,209 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-13 11:06:28,256 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-13 11:06:28,272 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-13 11:06:28,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:06:28,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660391677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:28,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:06:28,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 17 [2024-10-13 11:06:28,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523903246] [2024-10-13 11:06:28,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:28,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:06:28,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:28,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:06:28,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-13 11:06:28,274 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-13 11:06:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:28,653 INFO L93 Difference]: Finished difference Result 951 states and 1547 transitions. [2024-10-13 11:06:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 11:06:28,653 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-13 11:06:28,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:28,657 INFO L225 Difference]: With dead ends: 951 [2024-10-13 11:06:28,657 INFO L226 Difference]: Without dead ends: 947 [2024-10-13 11:06:28,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2024-10-13 11:06:28,658 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 180 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:28,658 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.3s Time] [2024-10-13 11:06:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-10-13 11:06:28,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 904. [2024-10-13 11:06:28,677 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-13 11:06:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1498 transitions. [2024-10-13 11:06:28,680 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1498 transitions. Word has length 44 [2024-10-13 11:06:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:28,680 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1498 transitions. [2024-10-13 11:06:28,680 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-13 11:06:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1498 transitions. [2024-10-13 11:06:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 11:06:28,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:28,681 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-13 11:06:28,695 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-13 11:06:28,885 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-13 11:06:28,886 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:28,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:28,886 INFO L85 PathProgramCache]: Analyzing trace with hash 30518839, now seen corresponding path program 1 times [2024-10-13 11:06:28,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:28,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131636839] [2024-10-13 11:06:28,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:28,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:29,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:29,004 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-13 11:06:29,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:29,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131636839] [2024-10-13 11:06:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131636839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 11:06:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323554208] [2024-10-13 11:06:29,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:29,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 11:06:29,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:29,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 11:06:29,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:06:29,007 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-13 11:06:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:29,593 INFO L93 Difference]: Finished difference Result 1032 states and 1764 transitions. [2024-10-13 11:06:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 11:06:29,593 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-13 11:06:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:29,597 INFO L225 Difference]: With dead ends: 1032 [2024-10-13 11:06:29,598 INFO L226 Difference]: Without dead ends: 1032 [2024-10-13 11:06:29,598 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-13 11:06:29,598 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 457 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:29,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1224 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:06:29,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2024-10-13 11:06:29,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 931. [2024-10-13 11:06:29,618 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-13 11:06:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1546 transitions. [2024-10-13 11:06:29,621 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1546 transitions. Word has length 45 [2024-10-13 11:06:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:29,621 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1546 transitions. [2024-10-13 11:06:29,621 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-13 11:06:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1546 transitions. [2024-10-13 11:06:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 11:06:29,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:29,622 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-13 11:06:29,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 11:06:29,622 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:29,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash 30518840, now seen corresponding path program 1 times [2024-10-13 11:06:29,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:29,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330955789] [2024-10-13 11:06:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:29,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:29,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:29,802 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-13 11:06:29,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:29,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330955789] [2024-10-13 11:06:29,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330955789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:29,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:29,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 11:06:29,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770790539] [2024-10-13 11:06:29,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:29,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 11:06:29,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:29,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 11:06:29,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:06:29,804 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-13 11:06:30,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:30,357 INFO L93 Difference]: Finished difference Result 970 states and 1640 transitions. [2024-10-13 11:06:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 11:06:30,357 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-13 11:06:30,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:30,361 INFO L225 Difference]: With dead ends: 970 [2024-10-13 11:06:30,361 INFO L226 Difference]: Without dead ends: 970 [2024-10-13 11:06:30,362 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-13 11:06:30,362 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 345 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:30,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1332 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:06:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-10-13 11:06:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 931. [2024-10-13 11:06:30,383 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-13 11:06:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1543 transitions. [2024-10-13 11:06:30,386 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1543 transitions. Word has length 45 [2024-10-13 11:06:30,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:30,386 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1543 transitions. [2024-10-13 11:06:30,386 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-13 11:06:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1543 transitions. [2024-10-13 11:06:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 11:06:30,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:30,386 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-13 11:06:30,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 11:06:30,386 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:30,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash 943806591, now seen corresponding path program 1 times [2024-10-13 11:06:30,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:30,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010590533] [2024-10-13 11:06:30,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:30,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:30,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:30,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:30,552 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-13 11:06:30,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:30,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010590533] [2024-10-13 11:06:30,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010590533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:30,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:30,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 11:06:30,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390531695] [2024-10-13 11:06:30,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:30,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 11:06:30,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:30,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 11:06:30,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:06:30,553 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-13 11:06:31,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:31,045 INFO L93 Difference]: Finished difference Result 1040 states and 1747 transitions. [2024-10-13 11:06:31,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 11:06:31,046 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-13 11:06:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:31,050 INFO L225 Difference]: With dead ends: 1040 [2024-10-13 11:06:31,050 INFO L226 Difference]: Without dead ends: 1040 [2024-10-13 11:06:31,050 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-13 11:06:31,051 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 408 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:31,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1931 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 11:06:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2024-10-13 11:06:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1016. [2024-10-13 11:06:31,084 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-13 11:06:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1732 transitions. [2024-10-13 11:06:31,088 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1732 transitions. Word has length 46 [2024-10-13 11:06:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:31,088 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1732 transitions. [2024-10-13 11:06:31,088 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-13 11:06:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1732 transitions. [2024-10-13 11:06:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 11:06:31,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:31,089 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-13 11:06:31,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 11:06:31,089 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:31,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:31,090 INFO L85 PathProgramCache]: Analyzing trace with hash 42601631, now seen corresponding path program 1 times [2024-10-13 11:06:31,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:31,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111357076] [2024-10-13 11:06:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:31,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:31,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:31,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 11:06:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:31,297 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-13 11:06:31,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111357076] [2024-10-13 11:06:31,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111357076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:31,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:31,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 11:06:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092602768] [2024-10-13 11:06:31,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:31,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:06:31,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:31,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:06:31,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:06:31,298 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-13 11:06:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:31,688 INFO L93 Difference]: Finished difference Result 1236 states and 2188 transitions. [2024-10-13 11:06:31,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 11:06:31,689 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-13 11:06:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:31,694 INFO L225 Difference]: With dead ends: 1236 [2024-10-13 11:06:31,694 INFO L226 Difference]: Without dead ends: 1236 [2024-10-13 11:06:31,694 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-13 11:06:31,694 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 356 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:31,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 2126 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 11:06:31,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-10-13 11:06:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1179. [2024-10-13 11:06:31,743 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-13 11:06:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 2000 transitions. [2024-10-13 11:06:31,746 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 2000 transitions. Word has length 51 [2024-10-13 11:06:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:31,746 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 2000 transitions. [2024-10-13 11:06:31,747 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-13 11:06:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 2000 transitions. [2024-10-13 11:06:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 11:06:31,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:31,747 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-13 11:06:31,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 11:06:31,748 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:31,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash -38488065, now seen corresponding path program 1 times [2024-10-13 11:06:31,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:31,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527576358] [2024-10-13 11:06:31,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:31,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:31,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:31,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 11:06:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:31,830 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-13 11:06:31,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:31,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527576358] [2024-10-13 11:06:31,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527576358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:31,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:31,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:06:31,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897854985] [2024-10-13 11:06:31,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:31,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:06:31,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:31,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:06:31,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:06:31,832 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-13 11:06:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:32,178 INFO L93 Difference]: Finished difference Result 1180 states and 2001 transitions. [2024-10-13 11:06:32,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:06:32,178 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-13 11:06:32,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:32,183 INFO L225 Difference]: With dead ends: 1180 [2024-10-13 11:06:32,183 INFO L226 Difference]: Without dead ends: 1180 [2024-10-13 11:06:32,183 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-13 11:06:32,183 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:32,183 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.3s Time] [2024-10-13 11:06:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-10-13 11:06:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1177. [2024-10-13 11:06:32,215 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-13 11:06:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1998 transitions. [2024-10-13 11:06:32,218 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1998 transitions. Word has length 51 [2024-10-13 11:06:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:32,218 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1998 transitions. [2024-10-13 11:06:32,219 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-13 11:06:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1998 transitions. [2024-10-13 11:06:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 11:06:32,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:32,219 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-13 11:06:32,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 11:06:32,219 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:32,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash -38488064, now seen corresponding path program 1 times [2024-10-13 11:06:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:32,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232615218] [2024-10-13 11:06:32,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:32,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:32,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:32,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:32,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 11:06:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:32,878 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-13 11:06:32,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:32,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232615218] [2024-10-13 11:06:32,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232615218] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:06:32,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743165105] [2024-10-13 11:06:32,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:32,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:06:32,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:06:32,882 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-13 11:06:32,882 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-13 11:06:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:33,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-13 11:06:33,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:06:33,046 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-13 11:06:33,052 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-13 11:06:33,062 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 30 treesize of output 14 [2024-10-13 11:06:33,097 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:06:33,098 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 82 treesize of output 75 [2024-10-13 11:06:33,102 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 31 treesize of output 21 [2024-10-13 11:06:33,104 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 42 treesize of output 25 [2024-10-13 11:06:33,125 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 47 treesize of output 29 [2024-10-13 11:06:33,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-10-13 11:06:33,131 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 37 treesize of output 25 [2024-10-13 11:06:33,139 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 51 treesize of output 29 [2024-10-13 11:06:33,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-10-13 11:06:33,145 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 41 treesize of output 25 [2024-10-13 11:06:33,153 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 51 treesize of output 29 [2024-10-13 11:06:33,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-10-13 11:06:33,158 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 41 treesize of output 25 [2024-10-13 11:06:33,207 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 20 [2024-10-13 11:06:33,210 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 15 treesize of output 9 [2024-10-13 11:06:33,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-13 11:06:33,260 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 47 treesize of output 29 [2024-10-13 11:06:33,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-10-13 11:06:33,269 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 37 treesize of output 25 [2024-10-13 11:06:33,288 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 41 treesize of output 23 [2024-10-13 11:06:33,291 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 25 treesize of output 13 [2024-10-13 11:06:33,301 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-13 11:06:33,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:06:33,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743165105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:33,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 11:06:33,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 18 [2024-10-13 11:06:33,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942779692] [2024-10-13 11:06:33,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:33,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 11:06:33,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:33,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 11:06:33,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-10-13 11:06:33,302 INFO L87 Difference]: Start difference. First operand 1177 states and 1998 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-13 11:06:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:33,784 INFO L93 Difference]: Finished difference Result 1175 states and 1983 transitions. [2024-10-13 11:06:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 11:06:33,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-13 11:06:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:33,789 INFO L225 Difference]: With dead ends: 1175 [2024-10-13 11:06:33,789 INFO L226 Difference]: Without dead ends: 1175 [2024-10-13 11:06:33,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-10-13 11:06:33,790 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 386 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:33,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1587 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 11:06:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2024-10-13 11:06:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1161. [2024-10-13 11:06:33,829 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-13 11:06:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1970 transitions. [2024-10-13 11:06:33,833 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1970 transitions. Word has length 51 [2024-10-13 11:06:33,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:33,833 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1970 transitions. [2024-10-13 11:06:33,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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-13 11:06:33,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1970 transitions. [2024-10-13 11:06:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 11:06:33,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:33,834 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-13 11:06:33,849 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-13 11:06:34,037 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-13 11:06:34,038 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:34,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:34,038 INFO L85 PathProgramCache]: Analyzing trace with hash 374565685, now seen corresponding path program 1 times [2024-10-13 11:06:34,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:34,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939180402] [2024-10-13 11:06:34,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:34,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:34,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 11:06:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:34,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-13 11:06:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:34,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 11:06:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:06:34,125 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-13 11:06:34,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:06:34,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939180402] [2024-10-13 11:06:34,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939180402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:06:34,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:06:34,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:06:34,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408837386] [2024-10-13 11:06:34,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:06:34,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:06:34,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:06:34,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:06:34,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:06:34,128 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-13 11:06:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:06:34,437 INFO L93 Difference]: Finished difference Result 1162 states and 1971 transitions. [2024-10-13 11:06:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:06:34,437 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-13 11:06:34,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:06:34,441 INFO L225 Difference]: With dead ends: 1162 [2024-10-13 11:06:34,441 INFO L226 Difference]: Without dead ends: 1162 [2024-10-13 11:06:34,441 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-13 11:06:34,441 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 127 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:06:34,442 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.3s Time] [2024-10-13 11:06:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2024-10-13 11:06:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1159. [2024-10-13 11:06:34,466 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-13 11:06:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1968 transitions. [2024-10-13 11:06:34,470 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1968 transitions. Word has length 52 [2024-10-13 11:06:34,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:06:34,470 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1968 transitions. [2024-10-13 11:06:34,470 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-13 11:06:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1968 transitions. [2024-10-13 11:06:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 11:06:34,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:06:34,471 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-13 11:06:34,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 11:06:34,471 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-10-13 11:06:34,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:06:34,471 INFO L85 PathProgramCache]: Analyzing trace with hash 374565686, now seen corresponding path program 1 times [2024-10-13 11:06:34,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:06:34,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327350339] [2024-10-13 11:06:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:06:34,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:06:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 11:06:34,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 11:06:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 11:06:34,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 11:06:34,533 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 11:06:34,533 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 158 remaining) [2024-10-13 11:06:34,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 158 remaining) [2024-10-13 11:06:34,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 158 remaining) [2024-10-13 11:06:34,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 158 remaining) [2024-10-13 11:06:34,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 158 remaining) [2024-10-13 11:06:34,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 158 remaining) [2024-10-13 11:06:34,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 158 remaining) [2024-10-13 11:06:34,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 158 remaining) [2024-10-13 11:06:34,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 158 remaining) [2024-10-13 11:06:34,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 158 remaining) [2024-10-13 11:06:34,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 158 remaining) [2024-10-13 11:06:34,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 158 remaining) [2024-10-13 11:06:34,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 158 remaining) [2024-10-13 11:06:34,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 158 remaining) [2024-10-13 11:06:34,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 158 remaining) [2024-10-13 11:06:34,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 158 remaining) [2024-10-13 11:06:34,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 158 remaining) [2024-10-13 11:06:34,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 158 remaining) [2024-10-13 11:06:34,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 158 remaining) [2024-10-13 11:06:34,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 158 remaining) [2024-10-13 11:06:34,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 158 remaining) [2024-10-13 11:06:34,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 158 remaining) [2024-10-13 11:06:34,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 158 remaining) [2024-10-13 11:06:34,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 158 remaining) [2024-10-13 11:06:34,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 158 remaining) [2024-10-13 11:06:34,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 158 remaining) [2024-10-13 11:06:34,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 158 remaining) [2024-10-13 11:06:34,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 158 remaining) [2024-10-13 11:06:34,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 158 remaining) [2024-10-13 11:06:34,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 158 remaining) [2024-10-13 11:06:34,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 158 remaining) [2024-10-13 11:06:34,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 158 remaining) [2024-10-13 11:06:34,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 158 remaining) [2024-10-13 11:06:34,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 158 remaining) [2024-10-13 11:06:34,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 158 remaining) [2024-10-13 11:06:34,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 158 remaining) [2024-10-13 11:06:34,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 158 remaining) [2024-10-13 11:06:34,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 158 remaining) [2024-10-13 11:06:34,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 158 remaining) [2024-10-13 11:06:34,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 158 remaining) [2024-10-13 11:06:34,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 158 remaining) [2024-10-13 11:06:34,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 158 remaining) [2024-10-13 11:06:34,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 158 remaining) [2024-10-13 11:06:34,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 158 remaining) [2024-10-13 11:06:34,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 158 remaining) [2024-10-13 11:06:34,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 158 remaining) [2024-10-13 11:06:34,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 158 remaining) [2024-10-13 11:06:34,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 158 remaining) [2024-10-13 11:06:34,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 158 remaining) [2024-10-13 11:06:34,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 158 remaining) [2024-10-13 11:06:34,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 158 remaining) [2024-10-13 11:06:34,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 158 remaining) [2024-10-13 11:06:34,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 158 remaining) [2024-10-13 11:06:34,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 158 remaining) [2024-10-13 11:06:34,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 158 remaining) [2024-10-13 11:06:34,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 158 remaining) [2024-10-13 11:06:34,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 158 remaining) [2024-10-13 11:06:34,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 158 remaining) [2024-10-13 11:06:34,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 158 remaining) [2024-10-13 11:06:34,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 158 remaining) [2024-10-13 11:06:34,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 158 remaining) [2024-10-13 11:06:34,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 158 remaining) [2024-10-13 11:06:34,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 158 remaining) [2024-10-13 11:06:34,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 158 remaining) [2024-10-13 11:06:34,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 158 remaining) [2024-10-13 11:06:34,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 158 remaining) [2024-10-13 11:06:34,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 158 remaining) [2024-10-13 11:06:34,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 158 remaining) [2024-10-13 11:06:34,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 158 remaining) [2024-10-13 11:06:34,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 158 remaining) [2024-10-13 11:06:34,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 158 remaining) [2024-10-13 11:06:34,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 158 remaining) [2024-10-13 11:06:34,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 158 remaining) [2024-10-13 11:06:34,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 158 remaining) [2024-10-13 11:06:34,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 158 remaining) [2024-10-13 11:06:34,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 158 remaining) [2024-10-13 11:06:34,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 158 remaining) [2024-10-13 11:06:34,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 158 remaining) [2024-10-13 11:06:34,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 158 remaining) [2024-10-13 11:06:34,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 158 remaining) [2024-10-13 11:06:34,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 158 remaining) [2024-10-13 11:06:34,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 158 remaining) [2024-10-13 11:06:34,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 158 remaining) [2024-10-13 11:06:34,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 158 remaining) [2024-10-13 11:06:34,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 158 remaining) [2024-10-13 11:06:34,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 158 remaining) [2024-10-13 11:06:34,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 158 remaining) [2024-10-13 11:06:34,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 158 remaining) [2024-10-13 11:06:34,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 158 remaining) [2024-10-13 11:06:34,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 158 remaining) [2024-10-13 11:06:34,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 158 remaining) [2024-10-13 11:06:34,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (33 of 158 remaining) [2024-10-13 11:06:34,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (32 of 158 remaining) [2024-10-13 11:06:34,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 158 remaining) [2024-10-13 11:06:34,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 158 remaining) [2024-10-13 11:06:34,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 158 remaining) [2024-10-13 11:06:34,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 158 remaining) [2024-10-13 11:06:34,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 158 remaining) [2024-10-13 11:06:34,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 158 remaining) [2024-10-13 11:06:34,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 158 remaining) [2024-10-13 11:06:34,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 158 remaining) [2024-10-13 11:06:34,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 158 remaining) [2024-10-13 11:06:34,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 158 remaining) [2024-10-13 11:06:34,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 158 remaining) [2024-10-13 11:06:34,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 158 remaining) [2024-10-13 11:06:34,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 158 remaining) [2024-10-13 11:06:34,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 11:06:34,550 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-13 11:06:34,572 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 11:06:34,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:06:34 BoogieIcfgContainer [2024-10-13 11:06:34,575 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 11:06:34,575 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 11:06:34,575 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 11:06:34,579 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 11:06:34,579 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:06:12" (3/4) ... [2024-10-13 11:06:34,580 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 11:06:34,623 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 11:06:34,624 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 11:06:34,624 INFO L158 Benchmark]: Toolchain (without parser) took 23270.57ms. Allocated memory was 130.0MB in the beginning and 408.9MB in the end (delta: 278.9MB). Free memory was 56.5MB in the beginning and 198.6MB in the end (delta: -142.2MB). Peak memory consumption was 139.0MB. Max. memory is 16.1GB. [2024-10-13 11:06:34,624 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 130.0MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:06:34,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.06ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 56.2MB in the beginning and 131.0MB in the end (delta: -74.7MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-10-13 11:06:34,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.75ms. Allocated memory is still 178.3MB. Free memory was 131.0MB in the beginning and 128.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 11:06:34,624 INFO L158 Benchmark]: Boogie Preprocessor took 92.41ms. Allocated memory is still 178.3MB. Free memory was 128.0MB in the beginning and 122.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 11:06:34,624 INFO L158 Benchmark]: RCFGBuilder took 954.22ms. Allocated memory is still 178.3MB. Free memory was 122.6MB in the beginning and 111.3MB in the end (delta: 11.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-13 11:06:34,625 INFO L158 Benchmark]: TraceAbstraction took 21650.18ms. Allocated memory was 178.3MB in the beginning and 408.9MB in the end (delta: 230.7MB). Free memory was 110.2MB in the beginning and 201.8MB in the end (delta: -91.6MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. [2024-10-13 11:06:34,625 INFO L158 Benchmark]: Witness Printer took 48.18ms. Allocated memory is still 408.9MB. Free memory was 201.8MB in the beginning and 198.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 11:06:34,625 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.54ms. Allocated memory is still 130.0MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.06ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 56.2MB in the beginning and 131.0MB in the end (delta: -74.7MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.75ms. Allocated memory is still 178.3MB. Free memory was 131.0MB in the beginning and 128.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.41ms. Allocated memory is still 178.3MB. Free memory was 128.0MB in the beginning and 122.6MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 954.22ms. Allocated memory is still 178.3MB. Free memory was 122.6MB in the beginning and 111.3MB in the end (delta: 11.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 21650.18ms. Allocated memory was 178.3MB in the beginning and 408.9MB in the end (delta: 230.7MB). Free memory was 110.2MB in the beginning and 201.8MB in the end (delta: -91.6MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. * Witness Printer took 48.18ms. Allocated memory is still 408.9MB. Free memory was 201.8MB in the beginning and 198.6MB in the end (delta: 3.1MB). 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)={7:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [\old(e)={7:0}, e={7:0}, rc=-1, status=1, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: VAL [\old(e)={7:0}, e={7:0}, rc=-1, status=1, user={-1:0}] [L948] CALL ASNull(e) VAL [\old(e)={7:0}, user={-1:0}] [L838] EXPR e->primitive [L838] e_primitive_t primitive = e->primitive; [L839] COND TRUE primitive == _EVENT_START VAL [\old(e)={7: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)={7: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={6:0}, user={-1:0}] [L830] EXPR user->info VAL [e={6:0}, user={-1:0}] [L830] EXPR user->info->is_valid VAL [e={6:0}, user={-1:0}] [L830] COND TRUE !user->info->is_valid [L831] e.primitive = _EVENT_CLOSE VAL [e={6:0}, user={-1:0}] [L835] CALL event_precess(&e) VAL [\old(e)={6:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [\old(e)={6:0}, e={6: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)={6:0}, e={6:0}, rc=-1, status=2, user={-1:0}] [L951] CALL ASStart(e) VAL [\old(e)={6: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)={6:0}, e={6:0}, primitive=3, rc=-1, user={-1:0}] [L884] case _EVENT_OPEN: [L898] case _EVENT_CLOSE: VAL [\old(e)={6:0}, e={6: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)={6:0}, e={6: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: 21.6s, OverallIterations: 28, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9358 SdHoareTripleChecker+Valid, 12.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9349 mSDsluCounter, 31800 SdHoareTripleChecker+Invalid, 10.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23956 mSDsCounter, 2817 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19984 IncrementalHoareTripleChecker+Invalid, 22801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2817 mSolverCounterUnsat, 7844 mSDtfsCounter, 19984 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1179occurred in iteration=24, InterpolantAutomatonStates: 244, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 1467 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 972 NumberOfCodeBlocks, 972 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 891 ConstructedInterpolants, 0 QuantifiedInterpolants, 4785 SizeOfPredicates, 20 NumberOfNonLiveVariables, 926 ConjunctsInSsa, 81 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-13 11:06:34,659 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)