./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:34:52,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:34:52,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:34:52,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:34:52,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:34:52,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:34:52,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:34:52,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:34:52,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:34:52,376 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:34:52,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:34:52,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:34:52,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:34:52,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:34:52,380 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:34:52,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:34:52,380 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:34:52,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:34:52,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:34:52,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:34:52,381 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:34:52,383 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:34:52,383 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:34:52,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:34:52,383 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:34:52,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:34:52,384 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:34:52,384 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:34:52,384 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:34:52,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:34:52,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:34:52,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:34:52,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:34:52,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:34:52,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:34:52,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:34:52,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:34:52,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:34:52,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:34:52,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:34:52,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:34:52,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:34:52,389 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-11-10 15:34:52,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:34:52,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:34:52,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:34:52,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:34:52,664 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:34:52,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2024-11-10 15:34:54,182 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:34:54,481 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:34:54,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2024-11-10 15:34:54,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241a50eb0/2dfbebb6458c4ddca033c152f88e1567/FLAGf7f52f061 [2024-11-10 15:34:54,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241a50eb0/2dfbebb6458c4ddca033c152f88e1567 [2024-11-10 15:34:54,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:34:54,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:34:54,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:34:54,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:34:54,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:34:54,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:34:54" (1/1) ... [2024-11-10 15:34:54,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eef5f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:54, skipping insertion in model container [2024-11-10 15:34:54,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:34:54" (1/1) ... [2024-11-10 15:34:54,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:34:55,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:34:55,284 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:34:55,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:34:55,391 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:34:55,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55 WrapperNode [2024-11-10 15:34:55,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:34:55,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:34:55,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:34:55,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:34:55,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55" (1/1) ... [2024-11-10 15:34:55,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55" (1/1) ... [2024-11-10 15:34:55,457 INFO L138 Inliner]: procedures = 184, calls = 145, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 236 [2024-11-10 15:34:55,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:34:55,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:34:55,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:34:55,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:34:55,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55" (1/1) ... [2024-11-10 15:34:55,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55" (1/1) ... [2024-11-10 15:34:55,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55" (1/1) ... [2024-11-10 15:34:55,507 INFO L175 MemorySlicer]: Split 91 memory accesses to 3 slices as follows [2, 70, 19]. 77 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 0, 9]. The 44 writes are split as follows [0, 38, 6]. [2024-11-10 15:34:55,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55" (1/1) ... [2024-11-10 15:34:55,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55" (1/1) ... [2024-11-10 15:34:55,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55" (1/1) ... [2024-11-10 15:34:55,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55" (1/1) ... [2024-11-10 15:34:55,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55" (1/1) ... [2024-11-10 15:34:55,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55" (1/1) ... [2024-11-10 15:34:55,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:34:55,559 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:34:55,559 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:34:55,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:34:55,560 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55" (1/1) ... [2024-11-10 15:34:55,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:34:55,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:34:55,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:34:55,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:34:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:34:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:34:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 15:34:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-10 15:34:55,663 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-10 15:34:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2024-11-10 15:34:55,663 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2024-11-10 15:34:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:34:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:34:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 15:34:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:34:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2024-11-10 15:34:55,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2024-11-10 15:34:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:34:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:34:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:34:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 15:34:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:34:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2024-11-10 15:34:55,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2024-11-10 15:34:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2024-11-10 15:34:55,666 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2024-11-10 15:34:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2024-11-10 15:34:55,667 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2024-11-10 15:34:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:34:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:34:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 15:34:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2024-11-10 15:34:55,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2024-11-10 15:34:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:34:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2024-11-10 15:34:55,667 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2024-11-10 15:34:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:34:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:34:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 15:34:55,668 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2024-11-10 15:34:55,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2024-11-10 15:34:55,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:34:55,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:34:55,878 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:34:55,881 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:34:56,181 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L835: havoc #t~ret37;call ULTIMATE.dealloc(~#e~1.base, ~#e~1.offset);havoc ~#e~1.base, ~#e~1.offset; [2024-11-10 15:34:56,582 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L805: call ULTIMATE.dealloc(~#e~0.base, ~#e~0.offset);havoc ~#e~0.base, ~#e~0.offset;havoc ~#e~0.base, ~#e~0.offset;havoc #t~ret32; [2024-11-10 15:34:56,682 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L841: havoc #t~ret40; [2024-11-10 15:34:56,819 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L977: call ULTIMATE.dealloc(main_~#e~2#1.base, main_~#e~2#1.offset);havoc main_~#e~2#1.base, main_~#e~2#1.offset; [2024-11-10 15:34:56,871 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2024-11-10 15:34:56,871 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:34:56,904 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:34:56,905 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:34:56,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:34:56 BoogieIcfgContainer [2024-11-10 15:34:56,906 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:34:56,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:34:56,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:34:56,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:34:56,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:34:54" (1/3) ... [2024-11-10 15:34:56,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2a46e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:34:56, skipping insertion in model container [2024-11-10 15:34:56,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:34:55" (2/3) ... [2024-11-10 15:34:56,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2a46e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:34:56, skipping insertion in model container [2024-11-10 15:34:56,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:34:56" (3/3) ... [2024-11-10 15:34:56,915 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2024-11-10 15:34:56,932 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:34:56,932 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 158 error locations. [2024-11-10 15:34:56,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:34:56,993 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;@e52e537, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:34:56,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 158 error locations. [2024-11-10 15:34:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 391 states, 194 states have (on average 1.9639175257731958) internal successors, (381), 352 states have internal predecessors, (381), 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-11-10 15:34:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:34:57,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:34:57,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:34:57,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:34:57,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:34:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash -662902103, now seen corresponding path program 1 times [2024-11-10 15:34:57,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:34:57,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141095761] [2024-11-10 15:34:57,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:34:57,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:34:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:34:57,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:34:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:34:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:34:57,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:34:57,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141095761] [2024-11-10 15:34:57,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141095761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:34:57,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:34:57,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:34:57,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903014041] [2024-11-10 15:34:57,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:34:57,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:34:57,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:34:57,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:34:57,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:34:57,424 INFO L87 Difference]: Start difference. First operand has 391 states, 194 states have (on average 1.9639175257731958) internal successors, (381), 352 states have internal predecessors, (381), 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.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:34:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:34:58,228 INFO L93 Difference]: Finished difference Result 477 states and 583 transitions. [2024-11-10 15:34:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:34:58,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 7 [2024-11-10 15:34:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:34:58,246 INFO L225 Difference]: With dead ends: 477 [2024-11-10 15:34:58,246 INFO L226 Difference]: Without dead ends: 474 [2024-11-10 15:34:58,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:34:58,251 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 585 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:34:58,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 382 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:34:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-10 15:34:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 383. [2024-11-10 15:34:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 205 states have (on average 1.829268292682927) internal successors, (375), 339 states have internal predecessors, (375), 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-11-10 15:34:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 444 transitions. [2024-11-10 15:34:58,338 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 444 transitions. Word has length 7 [2024-11-10 15:34:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:34:58,339 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 444 transitions. [2024-11-10 15:34:58,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:34:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 444 transitions. [2024-11-10 15:34:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:34:58,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:34:58,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:34:58,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:34:58,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:34:58,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:34:58,342 INFO L85 PathProgramCache]: Analyzing trace with hash -662902102, now seen corresponding path program 1 times [2024-11-10 15:34:58,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:34:58,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59148742] [2024-11-10 15:34:58,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:34:58,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:34:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:34:58,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:34:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:34:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:34:58,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:34:58,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59148742] [2024-11-10 15:34:58,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59148742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:34:58,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:34:58,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:34:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415102821] [2024-11-10 15:34:58,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:34:58,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:34:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:34:58,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:34:58,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:34:58,552 INFO L87 Difference]: Start difference. First operand 383 states and 444 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:34:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:34:59,003 INFO L93 Difference]: Finished difference Result 425 states and 512 transitions. [2024-11-10 15:34:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:34:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 7 [2024-11-10 15:34:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:34:59,007 INFO L225 Difference]: With dead ends: 425 [2024-11-10 15:34:59,007 INFO L226 Difference]: Without dead ends: 425 [2024-11-10 15:34:59,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-10 15:34:59,009 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 170 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:34:59,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 754 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:34:59,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-10 15:34:59,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 380. [2024-11-10 15:34:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 207 states have (on average 1.7922705314009661) internal successors, (371), 335 states have internal predecessors, (371), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-10 15:34:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 440 transitions. [2024-11-10 15:34:59,039 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 440 transitions. Word has length 7 [2024-11-10 15:34:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:34:59,040 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 440 transitions. [2024-11-10 15:34:59,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:34:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 440 transitions. [2024-11-10 15:34:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:34:59,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:34:59,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:34:59,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:34:59,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:34:59,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:34:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash 638387300, now seen corresponding path program 1 times [2024-11-10 15:34:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:34:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364503890] [2024-11-10 15:34:59,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:34:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:34:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:34:59,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:34:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:34:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:34:59,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:34:59,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364503890] [2024-11-10 15:34:59,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364503890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:34:59,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:34:59,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:34:59,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163041772] [2024-11-10 15:34:59,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:34:59,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:34:59,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:34:59,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:34:59,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:34:59,347 INFO L87 Difference]: Start difference. First operand 380 states and 440 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:34:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:34:59,916 INFO L93 Difference]: Finished difference Result 424 states and 511 transitions. [2024-11-10 15:34:59,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:34:59,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-11-10 15:34:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:34:59,919 INFO L225 Difference]: With dead ends: 424 [2024-11-10 15:34:59,920 INFO L226 Difference]: Without dead ends: 424 [2024-11-10 15:34:59,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 15:34:59,924 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 159 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:34:59,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1201 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:34:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-10 15:34:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 379. [2024-11-10 15:34:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 207 states have (on average 1.78743961352657) internal successors, (370), 334 states have internal predecessors, (370), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-10 15:34:59,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 439 transitions. [2024-11-10 15:34:59,949 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 439 transitions. Word has length 11 [2024-11-10 15:34:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:34:59,949 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 439 transitions. [2024-11-10 15:34:59,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:34:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 439 transitions. [2024-11-10 15:34:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:34:59,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:34:59,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:34:59,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:34:59,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:34:59,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:34:59,952 INFO L85 PathProgramCache]: Analyzing trace with hash 638387299, now seen corresponding path program 1 times [2024-11-10 15:34:59,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:34:59,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318487395] [2024-11-10 15:34:59,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:34:59,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:34:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:00,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:00,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318487395] [2024-11-10 15:35:00,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318487395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:00,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:00,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:35:00,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338640840] [2024-11-10 15:35:00,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:00,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:35:00,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:00,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:35:00,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:35:00,081 INFO L87 Difference]: Start difference. First operand 379 states and 439 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:35:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:00,637 INFO L93 Difference]: Finished difference Result 423 states and 510 transitions. [2024-11-10 15:35:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:35:00,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-11-10 15:35:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:00,639 INFO L225 Difference]: With dead ends: 423 [2024-11-10 15:35:00,640 INFO L226 Difference]: Without dead ends: 423 [2024-11-10 15:35:00,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 15:35:00,642 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 158 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:00,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1223 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:35:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-10 15:35:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 378. [2024-11-10 15:35:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 207 states have (on average 1.7826086956521738) internal successors, (369), 333 states have internal predecessors, (369), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-10 15:35:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 438 transitions. [2024-11-10 15:35:00,655 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 438 transitions. Word has length 11 [2024-11-10 15:35:00,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:00,655 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 438 transitions. [2024-11-10 15:35:00,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:35:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 438 transitions. [2024-11-10 15:35:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:35:00,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:00,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:00,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:35:00,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:00,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1847853574, now seen corresponding path program 1 times [2024-11-10 15:35:00,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:00,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887590698] [2024-11-10 15:35:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:00,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:00,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:00,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887590698] [2024-11-10 15:35:00,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887590698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:00,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:00,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:35:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329684738] [2024-11-10 15:35:00,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:00,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:35:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:00,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:35:00,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:35:00,725 INFO L87 Difference]: Start difference. First operand 378 states and 438 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:35:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:01,075 INFO L93 Difference]: Finished difference Result 422 states and 509 transitions. [2024-11-10 15:35:01,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:35:01,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-10 15:35:01,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:01,078 INFO L225 Difference]: With dead ends: 422 [2024-11-10 15:35:01,078 INFO L226 Difference]: Without dead ends: 422 [2024-11-10 15:35:01,078 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-11-10 15:35:01,079 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 158 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:01,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 773 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:35:01,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-10 15:35:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 377. [2024-11-10 15:35:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 207 states have (on average 1.7777777777777777) internal successors, (368), 332 states have internal predecessors, (368), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-10 15:35:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 437 transitions. [2024-11-10 15:35:01,098 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 437 transitions. Word has length 17 [2024-11-10 15:35:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:01,099 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 437 transitions. [2024-11-10 15:35:01,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:35:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 437 transitions. [2024-11-10 15:35:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:35:01,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:01,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:01,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:35:01,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:01,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1847853573, now seen corresponding path program 1 times [2024-11-10 15:35:01,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:01,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978494534] [2024-11-10 15:35:01,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:01,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:01,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:01,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978494534] [2024-11-10 15:35:01,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978494534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:01,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:01,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:35:01,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664345341] [2024-11-10 15:35:01,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:01,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:35:01,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:01,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:35:01,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:35:01,216 INFO L87 Difference]: Start difference. First operand 377 states and 437 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:35:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:01,575 INFO L93 Difference]: Finished difference Result 421 states and 508 transitions. [2024-11-10 15:35:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:35:01,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-10 15:35:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:01,578 INFO L225 Difference]: With dead ends: 421 [2024-11-10 15:35:01,578 INFO L226 Difference]: Without dead ends: 421 [2024-11-10 15:35:01,579 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-11-10 15:35:01,579 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 158 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:01,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 759 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:35:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-10 15:35:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 376. [2024-11-10 15:35:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 207 states have (on average 1.7729468599033817) internal successors, (367), 331 states have internal predecessors, (367), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-10 15:35:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 436 transitions. [2024-11-10 15:35:01,622 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 436 transitions. Word has length 17 [2024-11-10 15:35:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:01,622 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 436 transitions. [2024-11-10 15:35:01,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:35:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 436 transitions. [2024-11-10 15:35:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:35:01,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:01,623 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-11-10 15:35:01,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:35:01,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:01,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash -809513397, now seen corresponding path program 1 times [2024-11-10 15:35:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595776633] [2024-11-10 15:35:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:01,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:01,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:01,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595776633] [2024-11-10 15:35:01,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595776633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:01,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:01,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:35:01,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861023605] [2024-11-10 15:35:01,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:01,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:35:01,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:01,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:35:01,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:35:01,859 INFO L87 Difference]: Start difference. First operand 376 states and 436 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:35:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:02,757 INFO L93 Difference]: Finished difference Result 447 states and 551 transitions. [2024-11-10 15:35:02,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:35:02,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-10 15:35:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:02,760 INFO L225 Difference]: With dead ends: 447 [2024-11-10 15:35:02,760 INFO L226 Difference]: Without dead ends: 447 [2024-11-10 15:35:02,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:35:02,763 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1342 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:02,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 392 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 15:35:02,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-10 15:35:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 357. [2024-11-10 15:35:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 207 states have (on average 1.671497584541063) internal successors, (346), 312 states have internal predecessors, (346), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-10 15:35:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 415 transitions. [2024-11-10 15:35:02,779 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 415 transitions. Word has length 20 [2024-11-10 15:35:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:02,780 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 415 transitions. [2024-11-10 15:35:02,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:35:02,780 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 415 transitions. [2024-11-10 15:35:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:35:02,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:02,781 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] [2024-11-10 15:35:02,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:35:02,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:02,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:02,783 INFO L85 PathProgramCache]: Analyzing trace with hash 813318278, now seen corresponding path program 1 times [2024-11-10 15:35:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:02,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007245607] [2024-11-10 15:35:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:02,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:03,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:03,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-11-10 15:35:03,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007245607] [2024-11-10 15:35:03,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007245607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:03,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:03,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:35:03,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942087139] [2024-11-10 15:35:03,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:03,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:35:03,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:03,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:35:03,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:35:03,014 INFO L87 Difference]: Start difference. First operand 357 states and 415 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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-11-10 15:35:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:03,627 INFO L93 Difference]: Finished difference Result 435 states and 541 transitions. [2024-11-10 15:35:03,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:35:03,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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 26 [2024-11-10 15:35:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:03,630 INFO L225 Difference]: With dead ends: 435 [2024-11-10 15:35:03,631 INFO L226 Difference]: Without dead ends: 435 [2024-11-10 15:35:03,631 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-11-10 15:35:03,632 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 222 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:03,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1517 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:35:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-10 15:35:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 378. [2024-11-10 15:35:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 225 states have (on average 1.6533333333333333) internal successors, (372), 330 states have internal predecessors, (372), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2024-11-10 15:35:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 445 transitions. [2024-11-10 15:35:03,644 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 445 transitions. Word has length 26 [2024-11-10 15:35:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:03,644 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 445 transitions. [2024-11-10 15:35:03,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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-11-10 15:35:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 445 transitions. [2024-11-10 15:35:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:35:03,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:03,645 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] [2024-11-10 15:35:03,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:35:03,645 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:03,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:03,646 INFO L85 PathProgramCache]: Analyzing trace with hash 813318279, now seen corresponding path program 1 times [2024-11-10 15:35:03,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:03,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777996215] [2024-11-10 15:35:03,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:03,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:03,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:03,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:03,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777996215] [2024-11-10 15:35:03,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777996215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:03,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:03,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:35:03,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20692363] [2024-11-10 15:35:03,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:03,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:35:03,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:03,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:35:03,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:35:03,915 INFO L87 Difference]: Start difference. First operand 378 states and 445 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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-11-10 15:35:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:04,652 INFO L93 Difference]: Finished difference Result 434 states and 540 transitions. [2024-11-10 15:35:04,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:35:04,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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 26 [2024-11-10 15:35:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:04,655 INFO L225 Difference]: With dead ends: 434 [2024-11-10 15:35:04,655 INFO L226 Difference]: Without dead ends: 434 [2024-11-10 15:35:04,655 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-11-10 15:35:04,657 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 220 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:04,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1546 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:35:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-10 15:35:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 378. [2024-11-10 15:35:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 225 states have (on average 1.6488888888888888) internal successors, (371), 330 states have internal predecessors, (371), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2024-11-10 15:35:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 444 transitions. [2024-11-10 15:35:04,672 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 444 transitions. Word has length 26 [2024-11-10 15:35:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:04,672 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 444 transitions. [2024-11-10 15:35:04,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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-11-10 15:35:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 444 transitions. [2024-11-10 15:35:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:35:04,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:04,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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:04,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:35:04,674 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:04,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash -560933817, now seen corresponding path program 1 times [2024-11-10 15:35:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:04,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786061349] [2024-11-10 15:35:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:04,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:04,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:04,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786061349] [2024-11-10 15:35:04,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786061349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:04,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:04,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:35:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558958064] [2024-11-10 15:35:04,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:04,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:35:04,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:04,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:35:04,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:35:04,928 INFO L87 Difference]: Start difference. First operand 378 states and 444 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-11-10 15:35:05,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:05,335 INFO L93 Difference]: Finished difference Result 472 states and 566 transitions. [2024-11-10 15:35:05,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:35:05,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 27 [2024-11-10 15:35:05,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:05,338 INFO L225 Difference]: With dead ends: 472 [2024-11-10 15:35:05,338 INFO L226 Difference]: Without dead ends: 472 [2024-11-10 15:35:05,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:35:05,339 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 239 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:05,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1798 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:35:05,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-10 15:35:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 455. [2024-11-10 15:35:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 282 states have (on average 1.5425531914893618) internal successors, (435), 385 states have internal predecessors, (435), 41 states have call successors, (41), 18 states have call predecessors, (41), 26 states have return successors, (82), 51 states have call predecessors, (82), 41 states have call successors, (82) [2024-11-10 15:35:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 558 transitions. [2024-11-10 15:35:05,357 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 558 transitions. Word has length 27 [2024-11-10 15:35:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:05,358 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 558 transitions. [2024-11-10 15:35:05,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-11-10 15:35:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 558 transitions. [2024-11-10 15:35:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:35:05,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:05,360 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:05,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:35:05,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:05,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:05,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1449085478, now seen corresponding path program 1 times [2024-11-10 15:35:05,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:05,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155432746] [2024-11-10 15:35:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:05,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:05,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:05,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 15:35:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:05,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-11-10 15:35:05,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:05,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155432746] [2024-11-10 15:35:05,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155432746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:05,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:05,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:35:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561588398] [2024-11-10 15:35:05,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:05,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:35:05,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:05,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:35:05,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:35:05,507 INFO L87 Difference]: Start difference. First operand 455 states and 558 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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-11-10 15:35:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:05,859 INFO L93 Difference]: Finished difference Result 471 states and 573 transitions. [2024-11-10 15:35:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:35:05,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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 38 [2024-11-10 15:35:05,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:05,862 INFO L225 Difference]: With dead ends: 471 [2024-11-10 15:35:05,862 INFO L226 Difference]: Without dead ends: 469 [2024-11-10 15:35:05,863 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-11-10 15:35:05,863 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 161 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:05,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1334 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:35:05,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-10 15:35:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 465. [2024-11-10 15:35:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 290 states have (on average 1.5310344827586206) internal successors, (444), 394 states have internal predecessors, (444), 41 states have call successors, (41), 19 states have call predecessors, (41), 28 states have return successors, (82), 51 states have call predecessors, (82), 41 states have call successors, (82) [2024-11-10 15:35:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 567 transitions. [2024-11-10 15:35:05,876 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 567 transitions. Word has length 38 [2024-11-10 15:35:05,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:05,876 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 567 transitions. [2024-11-10 15:35:05,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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-11-10 15:35:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 567 transitions. [2024-11-10 15:35:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:35:05,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:05,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:05,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:35:05,878 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:05,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1836091015, now seen corresponding path program 1 times [2024-11-10 15:35:05,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:05,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920265039] [2024-11-10 15:35:05,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:06,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:06,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:35:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:06,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-10 15:35:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:06,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:06,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920265039] [2024-11-10 15:35:06,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920265039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:06,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:06,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:35:06,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25367962] [2024-11-10 15:35:06,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:06,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:35:06,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:06,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:35:06,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:35:06,231 INFO L87 Difference]: Start difference. First operand 465 states and 567 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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-11-10 15:35:07,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:07,144 INFO L93 Difference]: Finished difference Result 496 states and 619 transitions. [2024-11-10 15:35:07,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:35:07,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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 38 [2024-11-10 15:35:07,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:07,147 INFO L225 Difference]: With dead ends: 496 [2024-11-10 15:35:07,147 INFO L226 Difference]: Without dead ends: 489 [2024-11-10 15:35:07,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-10 15:35:07,148 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 315 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:07,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 2345 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:35:07,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-10 15:35:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 465. [2024-11-10 15:35:07,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 290 states have (on average 1.5275862068965518) internal successors, (443), 394 states have internal predecessors, (443), 41 states have call successors, (41), 19 states have call predecessors, (41), 28 states have return successors, (82), 51 states have call predecessors, (82), 41 states have call successors, (82) [2024-11-10 15:35:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 566 transitions. [2024-11-10 15:35:07,162 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 566 transitions. Word has length 38 [2024-11-10 15:35:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:07,162 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 566 transitions. [2024-11-10 15:35:07,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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-11-10 15:35:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 566 transitions. [2024-11-10 15:35:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 15:35:07,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:07,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:07,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:35:07,164 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:07,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash -723591875, now seen corresponding path program 1 times [2024-11-10 15:35:07,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:07,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843447193] [2024-11-10 15:35:07,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:07,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:07,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 15:35:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:07,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:07,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843447193] [2024-11-10 15:35:07,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843447193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:07,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:07,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:35:07,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512553659] [2024-11-10 15:35:07,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:07,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:35:07,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:07,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:35:07,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:35:07,531 INFO L87 Difference]: Start difference. First operand 465 states and 566 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 6 states have internal predecessors, (33), 3 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-11-10 15:35:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:08,208 INFO L93 Difference]: Finished difference Result 444 states and 529 transitions. [2024-11-10 15:35:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:35:08,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 6 states have internal predecessors, (33), 3 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 40 [2024-11-10 15:35:08,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:08,211 INFO L225 Difference]: With dead ends: 444 [2024-11-10 15:35:08,212 INFO L226 Difference]: Without dead ends: 442 [2024-11-10 15:35:08,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-10 15:35:08,212 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 191 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:08,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1791 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:35:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-10 15:35:08,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 392. [2024-11-10 15:35:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 235 states have (on average 1.6) internal successors, (376), 340 states have internal predecessors, (376), 35 states have call successors, (35), 16 states have call predecessors, (35), 16 states have return successors, (44), 35 states have call predecessors, (44), 35 states have call successors, (44) [2024-11-10 15:35:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 455 transitions. [2024-11-10 15:35:08,223 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 455 transitions. Word has length 40 [2024-11-10 15:35:08,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:08,223 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 455 transitions. [2024-11-10 15:35:08,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 6 states have internal predecessors, (33), 3 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-11-10 15:35:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 455 transitions. [2024-11-10 15:35:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:35:08,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:08,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:08,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:35:08,224 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:08,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash 817765791, now seen corresponding path program 1 times [2024-11-10 15:35:08,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:08,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448320574] [2024-11-10 15:35:08,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:08,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:08,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:08,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 15:35:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:08,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:08,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448320574] [2024-11-10 15:35:08,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448320574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:08,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:08,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:35:08,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595599845] [2024-11-10 15:35:08,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:08,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:35:08,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:08,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:35:08,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:35:08,902 INFO L87 Difference]: Start difference. First operand 392 states and 455 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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-11-10 15:35:10,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:10,132 INFO L93 Difference]: Finished difference Result 638 states and 822 transitions. [2024-11-10 15:35:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:35:10,137 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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 42 [2024-11-10 15:35:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:10,145 INFO L225 Difference]: With dead ends: 638 [2024-11-10 15:35:10,145 INFO L226 Difference]: Without dead ends: 638 [2024-11-10 15:35:10,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 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-11-10 15:35:10,146 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1216 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:10,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 1583 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 15:35:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-10 15:35:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 498. [2024-11-10 15:35:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 318 states have (on average 1.5660377358490567) internal successors, (498), 427 states have internal predecessors, (498), 49 states have call successors, (49), 24 states have call predecessors, (49), 25 states have return successors, (70), 46 states have call predecessors, (70), 49 states have call successors, (70) [2024-11-10 15:35:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 617 transitions. [2024-11-10 15:35:10,164 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 617 transitions. Word has length 42 [2024-11-10 15:35:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:10,165 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 617 transitions. [2024-11-10 15:35:10,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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-11-10 15:35:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 617 transitions. [2024-11-10 15:35:10,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:35:10,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:10,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:10,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:35:10,166 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:10,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:10,166 INFO L85 PathProgramCache]: Analyzing trace with hash 817765792, now seen corresponding path program 1 times [2024-11-10 15:35:10,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:10,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262664126] [2024-11-10 15:35:10,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:10,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:11,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:11,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 15:35:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:11,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:11,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262664126] [2024-11-10 15:35:11,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262664126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:11,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:11,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 15:35:11,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934194440] [2024-11-10 15:35:11,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:11,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:35:11,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:11,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:35:11,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:35:11,312 INFO L87 Difference]: Start difference. First operand 498 states and 617 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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-11-10 15:35:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:12,586 INFO L93 Difference]: Finished difference Result 686 states and 858 transitions. [2024-11-10 15:35:12,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:35:12,587 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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 42 [2024-11-10 15:35:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:12,590 INFO L225 Difference]: With dead ends: 686 [2024-11-10 15:35:12,590 INFO L226 Difference]: Without dead ends: 686 [2024-11-10 15:35:12,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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-11-10 15:35:12,592 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 1280 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:12,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 1260 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 15:35:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-10 15:35:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 532. [2024-11-10 15:35:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 345 states have (on average 1.5217391304347827) internal successors, (525), 448 states have internal predecessors, (525), 49 states have call successors, (49), 24 states have call predecessors, (49), 32 states have return successors, (91), 59 states have call predecessors, (91), 49 states have call successors, (91) [2024-11-10 15:35:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 665 transitions. [2024-11-10 15:35:12,606 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 665 transitions. Word has length 42 [2024-11-10 15:35:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:12,607 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 665 transitions. [2024-11-10 15:35:12,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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-11-10 15:35:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 665 transitions. [2024-11-10 15:35:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 15:35:12,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:12,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:12,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:35:12,610 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:12,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash -106088164, now seen corresponding path program 1 times [2024-11-10 15:35:12,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:12,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559558653] [2024-11-10 15:35:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:12,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:12,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 15:35:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:12,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:12,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559558653] [2024-11-10 15:35:12,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559558653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:12,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:12,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:35:12,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105105772] [2024-11-10 15:35:12,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:12,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:35:12,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:12,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:35:12,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:35:12,705 INFO L87 Difference]: Start difference. First operand 532 states and 665 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-11-10 15:35:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:13,091 INFO L93 Difference]: Finished difference Result 592 states and 760 transitions. [2024-11-10 15:35:13,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:35:13,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 44 [2024-11-10 15:35:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:13,094 INFO L225 Difference]: With dead ends: 592 [2024-11-10 15:35:13,095 INFO L226 Difference]: Without dead ends: 592 [2024-11-10 15:35:13,095 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-11-10 15:35:13,095 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 151 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:13,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 881 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:35:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-10 15:35:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 530. [2024-11-10 15:35:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 345 states have (on average 1.510144927536232) internal successors, (521), 446 states have internal predecessors, (521), 49 states have call successors, (49), 24 states have call predecessors, (49), 32 states have return successors, (91), 59 states have call predecessors, (91), 49 states have call successors, (91) [2024-11-10 15:35:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 661 transitions. [2024-11-10 15:35:13,110 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 661 transitions. Word has length 44 [2024-11-10 15:35:13,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:13,110 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 661 transitions. [2024-11-10 15:35:13,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-11-10 15:35:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 661 transitions. [2024-11-10 15:35:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 15:35:13,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:13,111 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:13,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:35:13,111 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:13,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash -106088163, now seen corresponding path program 1 times [2024-11-10 15:35:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:13,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511290433] [2024-11-10 15:35:13,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:13,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:13,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 15:35:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:13,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:13,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511290433] [2024-11-10 15:35:13,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511290433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:13,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:13,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:35:13,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261498266] [2024-11-10 15:35:13,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:13,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:35:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:13,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:35:13,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:35:13,239 INFO L87 Difference]: Start difference. First operand 530 states and 661 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-11-10 15:35:13,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:13,630 INFO L93 Difference]: Finished difference Result 590 states and 756 transitions. [2024-11-10 15:35:13,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:35:13,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 44 [2024-11-10 15:35:13,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:13,634 INFO L225 Difference]: With dead ends: 590 [2024-11-10 15:35:13,634 INFO L226 Difference]: Without dead ends: 590 [2024-11-10 15:35:13,634 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-11-10 15:35:13,635 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 149 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:13,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 890 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:35:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-10 15:35:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 528. [2024-11-10 15:35:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 345 states have (on average 1.4985507246376812) internal successors, (517), 444 states have internal predecessors, (517), 49 states have call successors, (49), 24 states have call predecessors, (49), 32 states have return successors, (91), 59 states have call predecessors, (91), 49 states have call successors, (91) [2024-11-10 15:35:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 657 transitions. [2024-11-10 15:35:13,649 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 657 transitions. Word has length 44 [2024-11-10 15:35:13,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:13,649 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 657 transitions. [2024-11-10 15:35:13,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-11-10 15:35:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 657 transitions. [2024-11-10 15:35:13,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 15:35:13,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:13,650 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:13,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:35:13,651 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:13,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:13,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1618211198, now seen corresponding path program 1 times [2024-11-10 15:35:13,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:13,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207032494] [2024-11-10 15:35:13,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:13,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:13,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 15:35:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:13,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:13,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207032494] [2024-11-10 15:35:13,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207032494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:13,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:13,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:35:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175537990] [2024-11-10 15:35:13,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:13,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:35:13,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:35:13,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:35:13,905 INFO L87 Difference]: Start difference. First operand 528 states and 657 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 8 states have internal predecessors, (44), 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-11-10 15:35:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:14,628 INFO L93 Difference]: Finished difference Result 653 states and 831 transitions. [2024-11-10 15:35:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:35:14,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 8 states have internal predecessors, (44), 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 53 [2024-11-10 15:35:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:14,632 INFO L225 Difference]: With dead ends: 653 [2024-11-10 15:35:14,632 INFO L226 Difference]: Without dead ends: 653 [2024-11-10 15:35:14,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:35:14,633 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 482 mSDsluCounter, 2297 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:14,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 2693 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:35:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-10 15:35:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 595. [2024-11-10 15:35:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 396 states have (on average 1.4292929292929293) internal successors, (566), 487 states have internal predecessors, (566), 49 states have call successors, (49), 24 states have call predecessors, (49), 48 states have return successors, (146), 83 states have call predecessors, (146), 49 states have call successors, (146) [2024-11-10 15:35:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 761 transitions. [2024-11-10 15:35:14,651 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 761 transitions. Word has length 53 [2024-11-10 15:35:14,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:14,651 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 761 transitions. [2024-11-10 15:35:14,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 8 states have internal predecessors, (44), 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-11-10 15:35:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 761 transitions. [2024-11-10 15:35:14,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:35:14,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:14,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:14,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:35:14,652 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:14,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:14,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1379057073, now seen corresponding path program 1 times [2024-11-10 15:35:14,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:14,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222153172] [2024-11-10 15:35:14,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:14,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:14,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 15:35:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:14,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:14,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222153172] [2024-11-10 15:35:14,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222153172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:14,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:14,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:35:14,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854960231] [2024-11-10 15:35:14,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:14,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:35:14,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:14,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:35:14,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:35:14,871 INFO L87 Difference]: Start difference. First operand 595 states and 761 transitions. Second operand has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-11-10 15:35:15,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:15,740 INFO L93 Difference]: Finished difference Result 752 states and 1022 transitions. [2024-11-10 15:35:15,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:35:15,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 54 [2024-11-10 15:35:15,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:15,745 INFO L225 Difference]: With dead ends: 752 [2024-11-10 15:35:15,745 INFO L226 Difference]: Without dead ends: 752 [2024-11-10 15:35:15,745 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-11-10 15:35:15,746 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 509 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:15,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1580 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:35:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-11-10 15:35:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 653. [2024-11-10 15:35:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 442 states have (on average 1.4230769230769231) internal successors, (629), 537 states have internal predecessors, (629), 57 states have call successors, (57), 30 states have call predecessors, (57), 52 states have return successors, (179), 85 states have call predecessors, (179), 57 states have call successors, (179) [2024-11-10 15:35:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 865 transitions. [2024-11-10 15:35:15,766 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 865 transitions. Word has length 54 [2024-11-10 15:35:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:15,767 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 865 transitions. [2024-11-10 15:35:15,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-11-10 15:35:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 865 transitions. [2024-11-10 15:35:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:35:15,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:15,767 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:15,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:35:15,768 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:15,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1379057072, now seen corresponding path program 1 times [2024-11-10 15:35:15,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:15,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612060938] [2024-11-10 15:35:15,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:15,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:15,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:16,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 15:35:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:16,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:16,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612060938] [2024-11-10 15:35:16,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612060938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:16,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:16,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:35:16,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537082201] [2024-11-10 15:35:16,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:16,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:35:16,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:16,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:35:16,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:35:16,037 INFO L87 Difference]: Start difference. First operand 653 states and 865 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 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-11-10 15:35:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:16,713 INFO L93 Difference]: Finished difference Result 746 states and 1009 transitions. [2024-11-10 15:35:16,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:35:16,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 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 54 [2024-11-10 15:35:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:16,717 INFO L225 Difference]: With dead ends: 746 [2024-11-10 15:35:16,717 INFO L226 Difference]: Without dead ends: 746 [2024-11-10 15:35:16,718 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-11-10 15:35:16,718 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 395 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:16,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1641 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:35:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-11-10 15:35:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 701. [2024-11-10 15:35:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 484 states have (on average 1.4132231404958677) internal successors, (684), 579 states have internal predecessors, (684), 59 states have call successors, (59), 34 states have call predecessors, (59), 56 states have return successors, (185), 87 states have call predecessors, (185), 59 states have call successors, (185) [2024-11-10 15:35:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 928 transitions. [2024-11-10 15:35:16,742 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 928 transitions. Word has length 54 [2024-11-10 15:35:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:16,742 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 928 transitions. [2024-11-10 15:35:16,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 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-11-10 15:35:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 928 transitions. [2024-11-10 15:35:16,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 15:35:16,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:16,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:16,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 15:35:16,743 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:16,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1950045463, now seen corresponding path program 1 times [2024-11-10 15:35:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:16,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213206660] [2024-11-10 15:35:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:16,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:16,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 15:35:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:16,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 15:35:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:35:16,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:16,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213206660] [2024-11-10 15:35:16,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213206660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:16,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:16,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:35:16,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29891764] [2024-11-10 15:35:16,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:16,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:35:16,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:16,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:35:16,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:35:16,858 INFO L87 Difference]: Start difference. First operand 701 states and 928 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-11-10 15:35:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:17,250 INFO L93 Difference]: Finished difference Result 726 states and 972 transitions. [2024-11-10 15:35:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:35:17,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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 62 [2024-11-10 15:35:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:17,254 INFO L225 Difference]: With dead ends: 726 [2024-11-10 15:35:17,254 INFO L226 Difference]: Without dead ends: 726 [2024-11-10 15:35:17,254 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-11-10 15:35:17,255 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 290 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:17,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 934 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:35:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-11-10 15:35:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 699. [2024-11-10 15:35:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 484 states have (on average 1.4090909090909092) internal successors, (682), 577 states have internal predecessors, (682), 59 states have call successors, (59), 34 states have call predecessors, (59), 56 states have return successors, (185), 87 states have call predecessors, (185), 59 states have call successors, (185) [2024-11-10 15:35:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 926 transitions. [2024-11-10 15:35:17,276 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 926 transitions. Word has length 62 [2024-11-10 15:35:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:17,276 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 926 transitions. [2024-11-10 15:35:17,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-11-10 15:35:17,276 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 926 transitions. [2024-11-10 15:35:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 15:35:17,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:17,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:17,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 15:35:17,277 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:17,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:17,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1950045462, now seen corresponding path program 1 times [2024-11-10 15:35:17,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:17,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804769842] [2024-11-10 15:35:17,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:17,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:17,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:17,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 15:35:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 15:35:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:35:17,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:17,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804769842] [2024-11-10 15:35:17,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804769842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:17,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:17,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:35:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670977118] [2024-11-10 15:35:17,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:17,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:35:17,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:17,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:35:17,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:35:17,585 INFO L87 Difference]: Start difference. First operand 699 states and 926 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 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-11-10 15:35:18,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:18,123 INFO L93 Difference]: Finished difference Result 910 states and 1248 transitions. [2024-11-10 15:35:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:35:18,124 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 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 62 [2024-11-10 15:35:18,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:18,128 INFO L225 Difference]: With dead ends: 910 [2024-11-10 15:35:18,128 INFO L226 Difference]: Without dead ends: 910 [2024-11-10 15:35:18,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:35:18,129 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 263 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 3000 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:18,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 3000 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:35:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-10 15:35:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 826. [2024-11-10 15:35:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 593 states have (on average 1.387858347386172) internal successors, (823), 687 states have internal predecessors, (823), 67 states have call successors, (67), 46 states have call predecessors, (67), 66 states have return successors, (211), 92 states have call predecessors, (211), 67 states have call successors, (211) [2024-11-10 15:35:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1101 transitions. [2024-11-10 15:35:18,156 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1101 transitions. Word has length 62 [2024-11-10 15:35:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:18,156 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1101 transitions. [2024-11-10 15:35:18,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 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-11-10 15:35:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1101 transitions. [2024-11-10 15:35:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 15:35:18,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:18,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:18,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 15:35:18,157 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:18,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:18,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1626704746, now seen corresponding path program 1 times [2024-11-10 15:35:18,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:18,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814079034] [2024-11-10 15:35:18,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:19,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:19,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 15:35:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:19,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 15:35:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:35:19,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:19,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814079034] [2024-11-10 15:35:19,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814079034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:35:19,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042744600] [2024-11-10 15:35:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:19,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:35:19,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:35:19,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:35:19,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:35:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:19,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-10 15:35:19,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:35:19,396 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-11-10 15:35:19,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-11-10 15:35:19,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:35:19,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-10 15:35:19,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-10 15:35:19,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-10 15:35:19,504 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:35:19,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 63 [2024-11-10 15:35:19,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2024-11-10 15:35:19,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 20 [2024-11-10 15:35:19,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-10 15:35:19,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-10 15:35:19,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-10 15:35:19,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-10 15:35:19,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-10 15:35:19,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:35:19,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-10 15:35:19,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 20 [2024-11-10 15:35:19,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-11-10 15:35:19,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-10 15:35:19,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-10 15:35:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:35:19,786 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:35:19,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042744600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:19,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:35:19,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 16 [2024-11-10 15:35:19,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919556364] [2024-11-10 15:35:19,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:19,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:35:19,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:19,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:35:19,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-10 15:35:19,789 INFO L87 Difference]: Start difference. First operand 826 states and 1101 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-11-10 15:35:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:20,588 INFO L93 Difference]: Finished difference Result 844 states and 1128 transitions. [2024-11-10 15:35:20,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:35:20,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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 62 [2024-11-10 15:35:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:20,592 INFO L225 Difference]: With dead ends: 844 [2024-11-10 15:35:20,593 INFO L226 Difference]: Without dead ends: 844 [2024-11-10 15:35:20,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:35:20,594 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 426 mSDsluCounter, 1839 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:20,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 2170 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:35:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-10 15:35:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 804. [2024-11-10 15:35:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 573 states have (on average 1.3909249563699826) internal successors, (797), 667 states have internal predecessors, (797), 66 states have call successors, (66), 45 states have call predecessors, (66), 65 states have return successors, (206), 91 states have call predecessors, (206), 66 states have call successors, (206) [2024-11-10 15:35:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1069 transitions. [2024-11-10 15:35:20,617 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1069 transitions. Word has length 62 [2024-11-10 15:35:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:20,617 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1069 transitions. [2024-11-10 15:35:20,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-11-10 15:35:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1069 transitions. [2024-11-10 15:35:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 15:35:20,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:20,618 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:20,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 15:35:20,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-10 15:35:20,823 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:20,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:20,824 INFO L85 PathProgramCache]: Analyzing trace with hash 776312534, now seen corresponding path program 1 times [2024-11-10 15:35:20,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:20,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399919294] [2024-11-10 15:35:20,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:20,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:20,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:35:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:20,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 15:35:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:20,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 15:35:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:35:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:35:20,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:35:20,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399919294] [2024-11-10 15:35:20,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399919294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:35:20,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:35:20,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:35:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433770870] [2024-11-10 15:35:20,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:35:20,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:35:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:35:20,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:35:20,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:35:20,947 INFO L87 Difference]: Start difference. First operand 804 states and 1069 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-11-10 15:35:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:35:21,391 INFO L93 Difference]: Finished difference Result 829 states and 1114 transitions. [2024-11-10 15:35:21,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:35:21,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 63 [2024-11-10 15:35:21,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:35:21,396 INFO L225 Difference]: With dead ends: 829 [2024-11-10 15:35:21,396 INFO L226 Difference]: Without dead ends: 829 [2024-11-10 15:35:21,396 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-11-10 15:35:21,397 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 290 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:35:21,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 930 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:35:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-11-10 15:35:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 802. [2024-11-10 15:35:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 573 states have (on average 1.387434554973822) internal successors, (795), 665 states have internal predecessors, (795), 66 states have call successors, (66), 45 states have call predecessors, (66), 65 states have return successors, (206), 91 states have call predecessors, (206), 66 states have call successors, (206) [2024-11-10 15:35:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1067 transitions. [2024-11-10 15:35:21,418 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1067 transitions. Word has length 63 [2024-11-10 15:35:21,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:35:21,418 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1067 transitions. [2024-11-10 15:35:21,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-11-10 15:35:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1067 transitions. [2024-11-10 15:35:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 15:35:21,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:35:21,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:35:21,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 15:35:21,421 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-10 15:35:21,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:35:21,421 INFO L85 PathProgramCache]: Analyzing trace with hash 776312535, now seen corresponding path program 1 times [2024-11-10 15:35:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:35:21,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899261920] [2024-11-10 15:35:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:35:21,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:35:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 15:35:21,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 15:35:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 15:35:21,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 15:35:21,521 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 15:35:21,522 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 158 remaining) [2024-11-10 15:35:21,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 158 remaining) [2024-11-10 15:35:21,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 158 remaining) [2024-11-10 15:35:21,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 158 remaining) [2024-11-10 15:35:21,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 158 remaining) [2024-11-10 15:35:21,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 158 remaining) [2024-11-10 15:35:21,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 158 remaining) [2024-11-10 15:35:21,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 158 remaining) [2024-11-10 15:35:21,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 158 remaining) [2024-11-10 15:35:21,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 158 remaining) [2024-11-10 15:35:21,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 158 remaining) [2024-11-10 15:35:21,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 158 remaining) [2024-11-10 15:35:21,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 158 remaining) [2024-11-10 15:35:21,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 158 remaining) [2024-11-10 15:35:21,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 158 remaining) [2024-11-10 15:35:21,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 158 remaining) [2024-11-10 15:35:21,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 158 remaining) [2024-11-10 15:35:21,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 158 remaining) [2024-11-10 15:35:21,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 158 remaining) [2024-11-10 15:35:21,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 158 remaining) [2024-11-10 15:35:21,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 158 remaining) [2024-11-10 15:35:21,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 158 remaining) [2024-11-10 15:35:21,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 158 remaining) [2024-11-10 15:35:21,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 158 remaining) [2024-11-10 15:35:21,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 158 remaining) [2024-11-10 15:35:21,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 158 remaining) [2024-11-10 15:35:21,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 158 remaining) [2024-11-10 15:35:21,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 158 remaining) [2024-11-10 15:35:21,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 158 remaining) [2024-11-10 15:35:21,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 158 remaining) [2024-11-10 15:35:21,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 158 remaining) [2024-11-10 15:35:21,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 158 remaining) [2024-11-10 15:35:21,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 158 remaining) [2024-11-10 15:35:21,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 158 remaining) [2024-11-10 15:35:21,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 158 remaining) [2024-11-10 15:35:21,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 158 remaining) [2024-11-10 15:35:21,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 158 remaining) [2024-11-10 15:35:21,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 158 remaining) [2024-11-10 15:35:21,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 158 remaining) [2024-11-10 15:35:21,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 158 remaining) [2024-11-10 15:35:21,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 158 remaining) [2024-11-10 15:35:21,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 158 remaining) [2024-11-10 15:35:21,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 158 remaining) [2024-11-10 15:35:21,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 158 remaining) [2024-11-10 15:35:21,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 158 remaining) [2024-11-10 15:35:21,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 158 remaining) [2024-11-10 15:35:21,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 158 remaining) [2024-11-10 15:35:21,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 158 remaining) [2024-11-10 15:35:21,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 158 remaining) [2024-11-10 15:35:21,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 158 remaining) [2024-11-10 15:35:21,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 158 remaining) [2024-11-10 15:35:21,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 158 remaining) [2024-11-10 15:35:21,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 158 remaining) [2024-11-10 15:35:21,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 158 remaining) [2024-11-10 15:35:21,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 158 remaining) [2024-11-10 15:35:21,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 158 remaining) [2024-11-10 15:35:21,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 158 remaining) [2024-11-10 15:35:21,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 158 remaining) [2024-11-10 15:35:21,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 158 remaining) [2024-11-10 15:35:21,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 158 remaining) [2024-11-10 15:35:21,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 158 remaining) [2024-11-10 15:35:21,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 158 remaining) [2024-11-10 15:35:21,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 158 remaining) [2024-11-10 15:35:21,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 158 remaining) [2024-11-10 15:35:21,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 158 remaining) [2024-11-10 15:35:21,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 158 remaining) [2024-11-10 15:35:21,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 158 remaining) [2024-11-10 15:35:21,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 158 remaining) [2024-11-10 15:35:21,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 158 remaining) [2024-11-10 15:35:21,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 158 remaining) [2024-11-10 15:35:21,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 158 remaining) [2024-11-10 15:35:21,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 158 remaining) [2024-11-10 15:35:21,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 158 remaining) [2024-11-10 15:35:21,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 158 remaining) [2024-11-10 15:35:21,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 158 remaining) [2024-11-10 15:35:21,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 158 remaining) [2024-11-10 15:35:21,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 158 remaining) [2024-11-10 15:35:21,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 158 remaining) [2024-11-10 15:35:21,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 158 remaining) [2024-11-10 15:35:21,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 158 remaining) [2024-11-10 15:35:21,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 158 remaining) [2024-11-10 15:35:21,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 158 remaining) [2024-11-10 15:35:21,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 158 remaining) [2024-11-10 15:35:21,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 158 remaining) [2024-11-10 15:35:21,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 158 remaining) [2024-11-10 15:35:21,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 158 remaining) [2024-11-10 15:35:21,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 158 remaining) [2024-11-10 15:35:21,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 158 remaining) [2024-11-10 15:35:21,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 158 remaining) [2024-11-10 15:35:21,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 158 remaining) [2024-11-10 15:35:21,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 158 remaining) [2024-11-10 15:35:21,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 158 remaining) [2024-11-10 15:35:21,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 158 remaining) [2024-11-10 15:35:21,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 158 remaining) [2024-11-10 15:35:21,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 158 remaining) [2024-11-10 15:35:21,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 158 remaining) [2024-11-10 15:35:21,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 158 remaining) [2024-11-10 15:35:21,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 158 remaining) [2024-11-10 15:35:21,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 158 remaining) [2024-11-10 15:35:21,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 158 remaining) [2024-11-10 15:35:21,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 158 remaining) [2024-11-10 15:35:21,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 158 remaining) [2024-11-10 15:35:21,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 158 remaining) [2024-11-10 15:35:21,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 158 remaining) [2024-11-10 15:35:21,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 158 remaining) [2024-11-10 15:35:21,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 158 remaining) [2024-11-10 15:35:21,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 158 remaining) [2024-11-10 15:35:21,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 158 remaining) [2024-11-10 15:35:21,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 158 remaining) [2024-11-10 15:35:21,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 158 remaining) [2024-11-10 15:35:21,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 158 remaining) [2024-11-10 15:35:21,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 158 remaining) [2024-11-10 15:35:21,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 158 remaining) [2024-11-10 15:35:21,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 158 remaining) [2024-11-10 15:35:21,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 158 remaining) [2024-11-10 15:35:21,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 158 remaining) [2024-11-10 15:35:21,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 158 remaining) [2024-11-10 15:35:21,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 158 remaining) [2024-11-10 15:35:21,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 158 remaining) [2024-11-10 15:35:21,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 158 remaining) [2024-11-10 15:35:21,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 158 remaining) [2024-11-10 15:35:21,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 158 remaining) [2024-11-10 15:35:21,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (35 of 158 remaining) [2024-11-10 15:35:21,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (34 of 158 remaining) [2024-11-10 15:35:21,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 158 remaining) [2024-11-10 15:35:21,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 158 remaining) [2024-11-10 15:35:21,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 158 remaining) [2024-11-10 15:35:21,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 158 remaining) [2024-11-10 15:35:21,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0ASSERT_VIOLATIONMEMORY_LEAK (29 of 158 remaining) [2024-11-10 15:35:21,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 158 remaining) [2024-11-10 15:35:21,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 158 remaining) [2024-11-10 15:35:21,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 158 remaining) [2024-11-10 15:35:21,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 158 remaining) [2024-11-10 15:35:21,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 158 remaining) [2024-11-10 15:35:21,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 158 remaining) [2024-11-10 15:35:21,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 158 remaining) [2024-11-10 15:35:21,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 158 remaining) [2024-11-10 15:35:21,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 158 remaining) [2024-11-10 15:35:21,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 158 remaining) [2024-11-10 15:35:21,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 158 remaining) [2024-11-10 15:35:21,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 158 remaining) [2024-11-10 15:35:21,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (16 of 158 remaining) [2024-11-10 15:35:21,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 158 remaining) [2024-11-10 15:35:21,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 158 remaining) [2024-11-10 15:35:21,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 158 remaining) [2024-11-10 15:35:21,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 158 remaining) [2024-11-10 15:35:21,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 158 remaining) [2024-11-10 15:35:21,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 158 remaining) [2024-11-10 15:35:21,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 158 remaining) [2024-11-10 15:35:21,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 158 remaining) [2024-11-10 15:35:21,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 158 remaining) [2024-11-10 15:35:21,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 158 remaining) [2024-11-10 15:35:21,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 158 remaining) [2024-11-10 15:35:21,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 158 remaining) [2024-11-10 15:35:21,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 158 remaining) [2024-11-10 15:35:21,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 158 remaining) [2024-11-10 15:35:21,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 158 remaining) [2024-11-10 15:35:21,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 158 remaining) [2024-11-10 15:35:21,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 15:35:21,549 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] [2024-11-10 15:35:21,597 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:35:21,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:35:21 BoogieIcfgContainer [2024-11-10 15:35:21,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:35:21,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:35:21,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:35:21,603 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:35:21,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:34:56" (3/4) ... [2024-11-10 15:35:21,604 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 15:35:21,659 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:35:21,659 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:35:21,660 INFO L158 Benchmark]: Toolchain (without parser) took 26887.31ms. Allocated memory was 165.7MB in the beginning and 388.0MB in the end (delta: 222.3MB). Free memory was 107.5MB in the beginning and 176.7MB in the end (delta: -69.2MB). Peak memory consumption was 155.3MB. Max. memory is 16.1GB. [2024-11-10 15:35:21,660 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 165.7MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:35:21,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 619.05ms. Allocated memory is still 165.7MB. Free memory was 107.5MB in the beginning and 78.2MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 15:35:21,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.40ms. Allocated memory is still 165.7MB. Free memory was 78.2MB in the beginning and 75.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:35:21,660 INFO L158 Benchmark]: Boogie Preprocessor took 98.27ms. Allocated memory is still 165.7MB. Free memory was 75.4MB in the beginning and 70.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 15:35:21,660 INFO L158 Benchmark]: IcfgBuilder took 1346.71ms. Allocated memory is still 165.7MB. Free memory was 70.2MB in the beginning and 91.5MB in the end (delta: -21.3MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2024-11-10 15:35:21,660 INFO L158 Benchmark]: TraceAbstraction took 24694.80ms. Allocated memory was 165.7MB in the beginning and 388.0MB in the end (delta: 222.3MB). Free memory was 91.1MB in the beginning and 180.9MB in the end (delta: -89.8MB). Peak memory consumption was 135.6MB. Max. memory is 16.1GB. [2024-11-10 15:35:21,661 INFO L158 Benchmark]: Witness Printer took 55.93ms. Allocated memory is still 388.0MB. Free memory was 179.9MB in the beginning and 176.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 15:35:21,662 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.53ms. Allocated memory is still 165.7MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 619.05ms. Allocated memory is still 165.7MB. Free memory was 107.5MB in the beginning and 78.2MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.40ms. Allocated memory is still 165.7MB. Free memory was 78.2MB in the beginning and 75.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.27ms. Allocated memory is still 165.7MB. Free memory was 75.4MB in the beginning and 70.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 1346.71ms. Allocated memory is still 165.7MB. Free memory was 70.2MB in the beginning and 91.5MB in the end (delta: -21.3MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24694.80ms. Allocated memory was 165.7MB in the beginning and 388.0MB in the end (delta: 222.3MB). Free memory was 91.1MB in the beginning and 180.9MB in the end (delta: -89.8MB). Peak memory consumption was 135.6MB. Max. memory is 16.1GB. * Witness Printer took 55.93ms. Allocated memory is still 388.0MB. Free memory was 179.9MB in the beginning and 176.7MB 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; VAL [user={0:0}] [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)) VAL [user={-1:0}] [L967] user->message.id = 11 VAL [user={-1:0}] [L968] EXPR user->info VAL [user={-1:0}] [L968] user->info->is_valid = 0 VAL [user={-1:0}] [L969] user->status = AS_NULL VAL [user={-1:0}] [L970] user->user_id = 11 VAL [user={-1:0}] [L971] user->timeout = 3 VAL [user={-1:0}] [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 VAL [\old(e)={7:0}, e={7:0}, user={-1:0}] [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 VAL [\old(e)={7:0}, user={-1:0}] [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 VAL [\old(status)=2, user={-1:0}] [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 VAL [\old(e)={6:0}, e={6:0}, user={-1:0}] [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 VAL [\old(e)={6:0}, e={6:0}, user={-1:0}] [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: 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: 973]: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 391 locations, 158 error locations. Started 1 CEGAR loops. OverallTime: 24.6s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9538 SdHoareTripleChecker+Valid, 13.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9529 mSDsluCounter, 33377 SdHoareTripleChecker+Invalid, 11.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25385 mSDsCounter, 2697 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15506 IncrementalHoareTripleChecker+Invalid, 18203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2697 mSolverCounterUnsat, 7992 mSDtfsCounter, 15506 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 171 SyntacticMatches, 9 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=826occurred in iteration=22, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 1412 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 992 NumberOfCodeBlocks, 992 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 4933 SizeOfPredicates, 10 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 25 InterpolantComputations, 24 PerfectInterpolantSequences, 56/58 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-11-10 15:35:21,705 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)