./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB --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 fc3b64420d7066ddae343a06976c60db80b11c9064160fc3a579002ff9231727 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:20:47,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:20:47,828 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:20:47,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:20:47,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:20:47,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:20:47,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:20:47,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:20:47,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:20:47,892 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:20:47,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:20:47,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:20:47,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:20:47,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:20:47,896 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:20:47,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:20:47,896 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:20:47,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:20:47,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:20:47,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:20:47,897 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:20:47,897 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:20:47,897 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:20:47,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:20:47,897 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:20:47,897 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:20:47,897 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:20:47,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:20:47,898 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:20:47,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:20:47,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:20:47,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:20:47,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:20:47,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:20:47,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:20:47,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:20:47,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:20:47,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:20:47,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:20:47,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:20:47,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:20:47,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:20:47,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:20:47,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:20:47,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:20:47,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:20:47,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:20:47,902 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB 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 -> fc3b64420d7066ddae343a06976c60db80b11c9064160fc3a579002ff9231727 [2024-11-28 04:20:48,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:20:48,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:20:48,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:20:48,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:20:48,386 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:20:48,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/ldv-regression/test05.c [2024-11-28 04:20:52,461 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/data/795425c99/3552506273694aad8de5f153fbb7a595/FLAG7ef24bf17 [2024-11-28 04:20:52,798 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:20:52,799 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/sv-benchmarks/c/ldv-regression/test05.c [2024-11-28 04:20:52,808 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/data/795425c99/3552506273694aad8de5f153fbb7a595/FLAG7ef24bf17 [2024-11-28 04:20:52,828 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/data/795425c99/3552506273694aad8de5f153fbb7a595 [2024-11-28 04:20:52,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:20:52,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:20:52,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:20:52,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:20:52,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:20:52,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:20:52" (1/1) ... [2024-11-28 04:20:52,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb2de40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:52, skipping insertion in model container [2024-11-28 04:20:52,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:20:52" (1/1) ... [2024-11-28 04:20:52,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:20:53,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:20:53,101 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:20:53,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:20:53,156 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:20:53,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53 WrapperNode [2024-11-28 04:20:53,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:20:53,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:20:53,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:20:53,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:20:53,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (1/1) ... [2024-11-28 04:20:53,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (1/1) ... [2024-11-28 04:20:53,208 INFO L138 Inliner]: procedures = 16, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 91 [2024-11-28 04:20:53,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:20:53,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:20:53,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:20:53,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:20:53,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (1/1) ... [2024-11-28 04:20:53,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (1/1) ... [2024-11-28 04:20:53,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (1/1) ... [2024-11-28 04:20:53,250 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 9, 3, 3]. 53 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 8 writes are split as follows [0, 5, 1, 2]. [2024-11-28 04:20:53,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (1/1) ... [2024-11-28 04:20:53,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (1/1) ... [2024-11-28 04:20:53,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (1/1) ... [2024-11-28 04:20:53,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (1/1) ... [2024-11-28 04:20:53,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (1/1) ... [2024-11-28 04:20:53,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (1/1) ... [2024-11-28 04:20:53,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (1/1) ... [2024-11-28 04:20:53,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:20:53,292 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:20:53,292 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:20:53,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:20:53,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (1/1) ... [2024-11-28 04:20:53,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:20:53,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:20:53,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:20:53,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:20:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 04:20:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 04:20:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 04:20:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-28 04:20:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:20:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:20:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:20:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 04:20:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-28 04:20:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:20:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 04:20:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 04:20:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 04:20:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-28 04:20:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:20:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:20:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 04:20:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-28 04:20:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:20:53,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:20:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:20:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:20:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 04:20:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-28 04:20:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:20:53,522 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:20:53,524 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:20:54,076 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-28 04:20:54,076 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:20:54,097 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:20:54,098 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 04:20:54,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:20:54 BoogieIcfgContainer [2024-11-28 04:20:54,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:20:54,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:20:54,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:20:54,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:20:54,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:20:52" (1/3) ... [2024-11-28 04:20:54,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a07bc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:20:54, skipping insertion in model container [2024-11-28 04:20:54,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:20:53" (2/3) ... [2024-11-28 04:20:54,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a07bc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:20:54, skipping insertion in model container [2024-11-28 04:20:54,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:20:54" (3/3) ... [2024-11-28 04:20:54,118 INFO L128 eAbstractionObserver]: Analyzing ICFG test05.c [2024-11-28 04:20:54,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:20:54,151 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test05.c that has 1 procedures, 66 locations, 1 initial locations, 0 loop locations, and 32 error locations. [2024-11-28 04:20:54,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:20:54,242 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;@57fc3b65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:20:54,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-11-28 04:20:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 65 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:54,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:20:54,256 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:20:54,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:20:54,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:20:54,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:20:54,266 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-28 04:20:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:20:54,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120677217] [2024-11-28 04:20:54,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:20:54,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:20:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:20:54,793 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-28 04:20:54,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:20:54,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120677217] [2024-11-28 04:20:54,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120677217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:20:54,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:20:54,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:20:54,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91616163] [2024-11-28 04:20:54,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:20:54,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:20:54,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:20:54,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:20:54,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:20:54,852 INFO L87 Difference]: Start difference. First operand has 66 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 65 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:20:55,005 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2024-11-28 04:20:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:20:55,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 04:20:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:20:55,021 INFO L225 Difference]: With dead ends: 63 [2024-11-28 04:20:55,022 INFO L226 Difference]: Without dead ends: 61 [2024-11-28 04:20:55,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:20:55,032 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 56 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:20:55,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:20:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-28 04:20:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-28 04:20:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 31 states have (on average 2.0) internal successors, (62), 60 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2024-11-28 04:20:55,081 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 3 [2024-11-28 04:20:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:20:55,081 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2024-11-28 04:20:55,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2024-11-28 04:20:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:20:55,083 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:20:55,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:20:55,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:20:55,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:20:55,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:20:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-28 04:20:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:20:55,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974067820] [2024-11-28 04:20:55,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:20:55,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:20:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:20:55,358 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-28 04:20:55,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:20:55,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974067820] [2024-11-28 04:20:55,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974067820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:20:55,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:20:55,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:20:55,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542954729] [2024-11-28 04:20:55,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:20:55,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:20:55,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:20:55,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:20:55,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:20:55,362 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:20:55,492 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2024-11-28 04:20:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:20:55,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 04:20:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:20:55,495 INFO L225 Difference]: With dead ends: 62 [2024-11-28 04:20:55,495 INFO L226 Difference]: Without dead ends: 62 [2024-11-28 04:20:55,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:20:55,497 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 51 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:20:55,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 38 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:20:55,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-28 04:20:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-11-28 04:20:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 31 states have (on average 1.935483870967742) internal successors, (60), 58 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2024-11-28 04:20:55,510 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 3 [2024-11-28 04:20:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:20:55,511 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2024-11-28 04:20:55,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2024-11-28 04:20:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:20:55,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:20:55,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:20:55,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:20:55,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:20:55,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:20:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2024-11-28 04:20:55,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:20:55,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853280955] [2024-11-28 04:20:55,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:20:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:20:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:20:55,647 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-28 04:20:55,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:20:55,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853280955] [2024-11-28 04:20:55,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853280955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:20:55,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:20:55,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:20:55,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941030976] [2024-11-28 04:20:55,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:20:55,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:20:55,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:20:55,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:20:55,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:20:55,651 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:20:55,748 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2024-11-28 04:20:55,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:20:55,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-28 04:20:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:20:55,750 INFO L225 Difference]: With dead ends: 58 [2024-11-28 04:20:55,751 INFO L226 Difference]: Without dead ends: 58 [2024-11-28 04:20:55,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:20:55,752 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:20:55,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:20:55,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-28 04:20:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-28 04:20:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.903225806451613) internal successors, (59), 57 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2024-11-28 04:20:55,760 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 4 [2024-11-28 04:20:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:20:55,761 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2024-11-28 04:20:55,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2024-11-28 04:20:55,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:20:55,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:20:55,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:20:55,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:20:55,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:20:55,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:20:55,763 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2024-11-28 04:20:55,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:20:55,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734498699] [2024-11-28 04:20:55,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:20:55,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:20:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:20:55,987 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-28 04:20:55,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:20:55,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734498699] [2024-11-28 04:20:55,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734498699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:20:55,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:20:55,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:20:55,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658185115] [2024-11-28 04:20:55,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:20:55,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:20:55,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:20:55,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:20:55,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:20:55,992 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:20:56,107 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2024-11-28 04:20:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:20:56,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-28 04:20:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:20:56,111 INFO L225 Difference]: With dead ends: 57 [2024-11-28 04:20:56,111 INFO L226 Difference]: Without dead ends: 57 [2024-11-28 04:20:56,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:20:56,113 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:20:56,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 65 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:20:56,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-28 04:20:56,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-28 04:20:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 56 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-11-28 04:20:56,126 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2024-11-28 04:20:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:20:56,126 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-11-28 04:20:56,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-11-28 04:20:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-28 04:20:56,127 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:20:56,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-28 04:20:56,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:20:56,127 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:20:56,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:20:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2024-11-28 04:20:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:20:56,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466615302] [2024-11-28 04:20:56,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:20:56,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:20:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:20:56,380 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-28 04:20:56,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:20:56,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466615302] [2024-11-28 04:20:56,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466615302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:20:56,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:20:56,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:20:56,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715935182] [2024-11-28 04:20:56,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:20:56,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:20:56,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:20:56,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:20:56,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:20:56,383 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:56,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:20:56,496 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2024-11-28 04:20:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:20:56,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-28 04:20:56,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:20:56,498 INFO L225 Difference]: With dead ends: 56 [2024-11-28 04:20:56,498 INFO L226 Difference]: Without dead ends: 56 [2024-11-28 04:20:56,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:20:56,499 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:20:56,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 29 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:20:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-28 04:20:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-28 04:20:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2024-11-28 04:20:56,510 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 5 [2024-11-28 04:20:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:20:56,510 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2024-11-28 04:20:56,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2024-11-28 04:20:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-28 04:20:56,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:20:56,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-28 04:20:56,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:20:56,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:20:56,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:20:56,513 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2024-11-28 04:20:56,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:20:56,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749311159] [2024-11-28 04:20:56,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:20:56,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:20:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:20:56,808 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-28 04:20:56,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:20:56,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749311159] [2024-11-28 04:20:56,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749311159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:20:56,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:20:56,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:20:56,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136313379] [2024-11-28 04:20:56,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:20:56,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:20:56,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:20:56,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:20:56,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:20:56,817 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:20:56,945 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2024-11-28 04:20:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:20:56,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-28 04:20:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:20:56,949 INFO L225 Difference]: With dead ends: 55 [2024-11-28 04:20:56,949 INFO L226 Difference]: Without dead ends: 55 [2024-11-28 04:20:56,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:20:56,950 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:20:56,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 106 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:20:56,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-28 04:20:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-28 04:20:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2024-11-28 04:20:56,962 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 5 [2024-11-28 04:20:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:20:56,962 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2024-11-28 04:20:56,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2024-11-28 04:20:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:20:56,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:20:56,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:20:56,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:20:56,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:20:56,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:20:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2024-11-28 04:20:56,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:20:56,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894351304] [2024-11-28 04:20:56,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:20:56,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:20:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:20:57,220 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-28 04:20:57,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:20:57,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894351304] [2024-11-28 04:20:57,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894351304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:20:57,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:20:57,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:20:57,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310658841] [2024-11-28 04:20:57,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:20:57,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:20:57,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:20:57,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:20:57,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:20:57,223 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:20:57,358 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2024-11-28 04:20:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:20:57,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:20:57,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:20:57,360 INFO L225 Difference]: With dead ends: 49 [2024-11-28 04:20:57,361 INFO L226 Difference]: Without dead ends: 49 [2024-11-28 04:20:57,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:20:57,362 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:20:57,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 23 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:20:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-28 04:20:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-28 04:20:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 48 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2024-11-28 04:20:57,370 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 6 [2024-11-28 04:20:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:20:57,370 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2024-11-28 04:20:57,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2024-11-28 04:20:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 04:20:57,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:20:57,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 04:20:57,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:20:57,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:20:57,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:20:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2024-11-28 04:20:57,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:20:57,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639036440] [2024-11-28 04:20:57,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:20:57,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:20:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:20:57,779 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-28 04:20:57,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:20:57,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639036440] [2024-11-28 04:20:57,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639036440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:20:57,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:20:57,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:20:57,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359096421] [2024-11-28 04:20:57,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:20:57,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:20:57,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:20:57,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:20:57,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:20:57,783 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:20:57,861 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2024-11-28 04:20:57,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:20:57,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 04:20:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:20:57,863 INFO L225 Difference]: With dead ends: 43 [2024-11-28 04:20:57,863 INFO L226 Difference]: Without dead ends: 43 [2024-11-28 04:20:57,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:20:57,864 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:20:57,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 33 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:20:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-28 04:20:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-28 04:20:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2024-11-28 04:20:57,871 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 6 [2024-11-28 04:20:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:20:57,871 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2024-11-28 04:20:57,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2024-11-28 04:20:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 04:20:57,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:20:57,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:20:57,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:20:57,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:20:57,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:20:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1160479829, now seen corresponding path program 1 times [2024-11-28 04:20:57,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:20:57,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410839758] [2024-11-28 04:20:57,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:20:57,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:20:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:20:58,218 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-28 04:20:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:20:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410839758] [2024-11-28 04:20:58,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410839758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:20:58,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:20:58,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:20:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018888686] [2024-11-28 04:20:58,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:20:58,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:20:58,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:20:58,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:20:58,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:20:58,222 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:20:58,365 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-11-28 04:20:58,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:20:58,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-28 04:20:58,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:20:58,366 INFO L225 Difference]: With dead ends: 42 [2024-11-28 04:20:58,366 INFO L226 Difference]: Without dead ends: 42 [2024-11-28 04:20:58,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:20:58,367 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:20:58,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:20:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-28 04:20:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-28 04:20:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-28 04:20:58,373 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 14 [2024-11-28 04:20:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:20:58,374 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-28 04:20:58,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-28 04:20:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 04:20:58,376 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:20:58,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:20:58,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:20:58,376 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:20:58,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:20:58,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1160479828, now seen corresponding path program 1 times [2024-11-28 04:20:58,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:20:58,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893687175] [2024-11-28 04:20:58,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:20:58,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:20:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:20:58,542 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-28 04:20:58,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:20:58,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893687175] [2024-11-28 04:20:58,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893687175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:20:58,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:20:58,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:20:58,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426011423] [2024-11-28 04:20:58,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:20:58,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:20:58,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:20:58,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:20:58,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:20:58,546 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:20:58,679 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-11-28 04:20:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:20:58,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-28 04:20:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:20:58,681 INFO L225 Difference]: With dead ends: 40 [2024-11-28 04:20:58,681 INFO L226 Difference]: Without dead ends: 40 [2024-11-28 04:20:58,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:20:58,682 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:20:58,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 47 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:20:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-28 04:20:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-28 04:20:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-28 04:20:58,688 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 14 [2024-11-28 04:20:58,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:20:58,688 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-28 04:20:58,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-28 04:20:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 04:20:58,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:20:58,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:20:58,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:20:58,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:20:58,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:20:58,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1662793458, now seen corresponding path program 1 times [2024-11-28 04:20:58,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:20:58,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063140127] [2024-11-28 04:20:58,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:20:58,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:20:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:20:58,869 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-28 04:20:58,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:20:58,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063140127] [2024-11-28 04:20:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063140127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:20:58,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:20:58,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:20:58,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111283177] [2024-11-28 04:20:58,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:20:58,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:20:58,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:20:58,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:20:58,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:20:58,872 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:59,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:20:59,019 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-11-28 04:20:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:20:59,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-28 04:20:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:20:59,020 INFO L225 Difference]: With dead ends: 39 [2024-11-28 04:20:59,020 INFO L226 Difference]: Without dead ends: 39 [2024-11-28 04:20:59,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:20:59,022 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:20:59,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 44 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:20:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-28 04:20:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-28 04:20:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-28 04:20:59,029 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 17 [2024-11-28 04:20:59,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:20:59,034 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-28 04:20:59,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-11-28 04:20:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 04:20:59,035 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:20:59,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:20:59,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:20:59,036 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:20:59,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:20:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1662793459, now seen corresponding path program 1 times [2024-11-28 04:20:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:20:59,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245073405] [2024-11-28 04:20:59,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:20:59,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:20:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:20:59,325 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-28 04:20:59,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:20:59,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245073405] [2024-11-28 04:20:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245073405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:20:59,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:20:59,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:20:59,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542838070] [2024-11-28 04:20:59,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:20:59,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:20:59,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:20:59,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:20:59,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:20:59,328 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:20:59,478 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2024-11-28 04:20:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:20:59,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-28 04:20:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:20:59,479 INFO L225 Difference]: With dead ends: 41 [2024-11-28 04:20:59,480 INFO L226 Difference]: Without dead ends: 41 [2024-11-28 04:20:59,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:20:59,481 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:20:59,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:20:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-28 04:20:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-28 04:20:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-11-28 04:20:59,485 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 17 [2024-11-28 04:20:59,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:20:59,485 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-11-28 04:20:59,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:20:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-11-28 04:20:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 04:20:59,491 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:20:59,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:20:59,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 04:20:59,492 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:20:59,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:20:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash 216679347, now seen corresponding path program 1 times [2024-11-28 04:20:59,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:20:59,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408711288] [2024-11-28 04:20:59,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:20:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:20:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:20:59,899 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-28 04:20:59,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:20:59,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408711288] [2024-11-28 04:20:59,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408711288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:20:59,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:20:59,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 04:20:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176287538] [2024-11-28 04:20:59,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:20:59,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:20:59,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:20:59,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:20:59,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:20:59,901 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:00,122 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-28 04:21:00,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:21:00,123 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-28 04:21:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:00,123 INFO L225 Difference]: With dead ends: 37 [2024-11-28 04:21:00,124 INFO L226 Difference]: Without dead ends: 37 [2024-11-28 04:21:00,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:21:00,125 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:00,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 100 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:21:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-28 04:21:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-11-28 04:21:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-28 04:21:00,128 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 19 [2024-11-28 04:21:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:00,129 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-28 04:21:00,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-28 04:21:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 04:21:00,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:00,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:00,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 04:21:00,130 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:21:00,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash 216679348, now seen corresponding path program 1 times [2024-11-28 04:21:00,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:00,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303221170] [2024-11-28 04:21:00,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:00,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:00,716 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-28 04:21:00,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:00,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303221170] [2024-11-28 04:21:00,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303221170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:00,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:00,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:21:00,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386518495] [2024-11-28 04:21:00,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:00,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:21:00,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:00,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:21:00,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:21:00,720 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:00,936 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-11-28 04:21:00,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:21:00,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-28 04:21:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:00,938 INFO L225 Difference]: With dead ends: 36 [2024-11-28 04:21:00,938 INFO L226 Difference]: Without dead ends: 36 [2024-11-28 04:21:00,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:21:00,939 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:00,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 110 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:21:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-28 04:21:00,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-28 04:21:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-28 04:21:00,943 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 19 [2024-11-28 04:21:00,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:00,943 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-28 04:21:00,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-28 04:21:00,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 04:21:00,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:00,945 INFO L218 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-28 04:21:00,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 04:21:00,945 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:21:00,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:00,946 INFO L85 PathProgramCache]: Analyzing trace with hash -379590883, now seen corresponding path program 1 times [2024-11-28 04:21:00,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:00,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945326552] [2024-11-28 04:21:00,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:00,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:01,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-28 04:21:01,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:01,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945326552] [2024-11-28 04:21:01,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945326552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:01,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:01,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:21:01,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188330528] [2024-11-28 04:21:01,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:01,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:21:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:01,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:21:01,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:21:01,346 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:01,480 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2024-11-28 04:21:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:21:01,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-28 04:21:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:01,481 INFO L225 Difference]: With dead ends: 35 [2024-11-28 04:21:01,481 INFO L226 Difference]: Without dead ends: 35 [2024-11-28 04:21:01,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:21:01,482 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:01,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 167 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:21:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-28 04:21:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-28 04:21:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-11-28 04:21:01,488 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 20 [2024-11-28 04:21:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:01,489 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-11-28 04:21:01,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-11-28 04:21:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 04:21:01,491 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:01,492 INFO L218 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-28 04:21:01,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:21:01,492 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:21:01,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1049185247, now seen corresponding path program 1 times [2024-11-28 04:21:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:01,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77692040] [2024-11-28 04:21:01,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:01,686 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-28 04:21:01,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:01,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77692040] [2024-11-28 04:21:01,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77692040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:01,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:01,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:21:01,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414431038] [2024-11-28 04:21:01,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:01,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:21:01,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:01,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:21:01,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:21:01,690 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:01,747 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2024-11-28 04:21:01,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:21:01,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-28 04:21:01,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:01,748 INFO L225 Difference]: With dead ends: 35 [2024-11-28 04:21:01,748 INFO L226 Difference]: Without dead ends: 35 [2024-11-28 04:21:01,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:21:01,749 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:01,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:21:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-28 04:21:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-28 04:21:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 34 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2024-11-28 04:21:01,754 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 27 [2024-11-28 04:21:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:01,754 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2024-11-28 04:21:01,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2024-11-28 04:21:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 04:21:01,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:01,755 INFO L218 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-28 04:21:01,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 04:21:01,755 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:21:01,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:01,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1049186788, now seen corresponding path program 1 times [2024-11-28 04:21:01,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:01,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483470541] [2024-11-28 04:21:01,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:01,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:02,210 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-28 04:21:02,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:02,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483470541] [2024-11-28 04:21:02,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483470541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:02,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:02,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:21:02,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492853704] [2024-11-28 04:21:02,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:02,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:21:02,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:02,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:21:02,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:21:02,212 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:02,367 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2024-11-28 04:21:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:21:02,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-28 04:21:02,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:02,369 INFO L225 Difference]: With dead ends: 34 [2024-11-28 04:21:02,369 INFO L226 Difference]: Without dead ends: 34 [2024-11-28 04:21:02,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:21:02,370 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:02,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:21:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-28 04:21:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-28 04:21:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.064516129032258) internal successors, (33), 33 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2024-11-28 04:21:02,376 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 27 [2024-11-28 04:21:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:02,376 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2024-11-28 04:21:02,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:02,377 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2024-11-28 04:21:02,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 04:21:02,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:02,378 INFO L218 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-28 04:21:02,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 04:21:02,378 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:21:02,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:02,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1049186789, now seen corresponding path program 1 times [2024-11-28 04:21:02,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:02,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414524998] [2024-11-28 04:21:02,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:02,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:03,426 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-28 04:21:03,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414524998] [2024-11-28 04:21:03,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414524998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:03,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:03,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-28 04:21:03,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537907217] [2024-11-28 04:21:03,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:03,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:21:03,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:03,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:21:03,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:21:03,429 INFO L87 Difference]: Start difference. First operand 34 states and 33 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:03,685 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2024-11-28 04:21:03,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:21:03,686 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-28 04:21:03,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:03,687 INFO L225 Difference]: With dead ends: 33 [2024-11-28 04:21:03,687 INFO L226 Difference]: Without dead ends: 33 [2024-11-28 04:21:03,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:21:03,688 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:03,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:21:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-28 04:21:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-28 04:21:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2024-11-28 04:21:03,692 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 27 [2024-11-28 04:21:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:03,692 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2024-11-28 04:21:03,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2024-11-28 04:21:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 04:21:03,693 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:03,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:03,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 04:21:03,695 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:21:03,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:03,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1048809941, now seen corresponding path program 1 times [2024-11-28 04:21:03,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:03,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249103259] [2024-11-28 04:21:03,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:03,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:04,456 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-28 04:21:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:04,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249103259] [2024-11-28 04:21:04,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249103259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:04,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:04,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:21:04,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979964211] [2024-11-28 04:21:04,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:04,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:21:04,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:04,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:21:04,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:21:04,459 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:04,547 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2024-11-28 04:21:04,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:21:04,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-28 04:21:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:04,549 INFO L225 Difference]: With dead ends: 32 [2024-11-28 04:21:04,549 INFO L226 Difference]: Without dead ends: 31 [2024-11-28 04:21:04,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-28 04:21:04,550 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:04,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:21:04,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-28 04:21:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-28 04:21:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0) internal successors, (30), 30 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 30 transitions. [2024-11-28 04:21:04,553 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 30 transitions. Word has length 29 [2024-11-28 04:21:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:04,554 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 30 transitions. [2024-11-28 04:21:04,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2024-11-28 04:21:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 04:21:04,555 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:21:04,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:04,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 04:21:04,556 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-11-28 04:21:04,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:21:04,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1846628164, now seen corresponding path program 1 times [2024-11-28 04:21:04,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:21:04,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679259731] [2024-11-28 04:21:04,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:21:04,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:21:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:21:05,712 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-28 04:21:05,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:21:05,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679259731] [2024-11-28 04:21:05,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679259731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:21:05,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:21:05,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 04:21:05,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478160622] [2024-11-28 04:21:05,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:21:05,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 04:21:05,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:21:05,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 04:21:05,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:21:05,716 INFO L87 Difference]: Start difference. First operand 31 states and 30 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:21:06,301 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2024-11-28 04:21:06,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:21:06,301 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-28 04:21:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:21:06,302 INFO L225 Difference]: With dead ends: 28 [2024-11-28 04:21:06,302 INFO L226 Difference]: Without dead ends: 0 [2024-11-28 04:21:06,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2024-11-28 04:21:06,304 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:21:06,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 81 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:21:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-28 04:21:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-28 04:21:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-28 04:21:06,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2024-11-28 04:21:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:21:06,306 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-28 04:21:06,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:21:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-28 04:21:06,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-28 04:21:06,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 32 remaining) [2024-11-28 04:21:06,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2024-11-28 04:21:06,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2024-11-28 04:21:06,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2024-11-28 04:21:06,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2024-11-28 04:21:06,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 32 remaining) [2024-11-28 04:21:06,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2024-11-28 04:21:06,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2024-11-28 04:21:06,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2024-11-28 04:21:06,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2024-11-28 04:21:06,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2024-11-28 04:21:06,314 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2024-11-28 04:21:06,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2024-11-28 04:21:06,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2024-11-28 04:21:06,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2024-11-28 04:21:06,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2024-11-28 04:21:06,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2024-11-28 04:21:06,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2024-11-28 04:21:06,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2024-11-28 04:21:06,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2024-11-28 04:21:06,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2024-11-28 04:21:06,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2024-11-28 04:21:06,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2024-11-28 04:21:06,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2024-11-28 04:21:06,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2024-11-28 04:21:06,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2024-11-28 04:21:06,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2024-11-28 04:21:06,317 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2024-11-28 04:21:06,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2024-11-28 04:21:06,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2024-11-28 04:21:06,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (1 of 32 remaining) [2024-11-28 04:21:06,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK (0 of 32 remaining) [2024-11-28 04:21:06,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 04:21:06,324 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:21:06,328 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 04:21:06,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:21:06 BoogieIcfgContainer [2024-11-28 04:21:06,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 04:21:06,347 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 04:21:06,347 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 04:21:06,349 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 04:21:06,350 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:20:54" (3/4) ... [2024-11-28 04:21:06,354 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 04:21:06,378 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-11-28 04:21:06,379 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-28 04:21:06,379 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 04:21:06,379 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 04:21:06,526 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 04:21:06,527 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 04:21:06,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 04:21:06,528 INFO L158 Benchmark]: Toolchain (without parser) took 13694.54ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 75.3MB in the beginning and 168.0MB in the end (delta: -92.7MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-11-28 04:21:06,528 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 83.9MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:21:06,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.73ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 64.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:21:06,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.31ms. Allocated memory is still 100.7MB. Free memory was 64.3MB in the beginning and 63.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:21:06,530 INFO L158 Benchmark]: Boogie Preprocessor took 78.71ms. Allocated memory is still 100.7MB. Free memory was 63.2MB in the beginning and 61.1MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:21:06,530 INFO L158 Benchmark]: RCFGBuilder took 806.76ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 43.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 04:21:06,531 INFO L158 Benchmark]: TraceAbstraction took 12244.50ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 43.1MB in the beginning and 172.4MB in the end (delta: -129.3MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. [2024-11-28 04:21:06,531 INFO L158 Benchmark]: Witness Printer took 179.87ms. Allocated memory is still 201.3MB. Free memory was 172.4MB in the beginning and 168.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:21:06,534 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 83.9MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.73ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 64.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.31ms. Allocated memory is still 100.7MB. Free memory was 64.3MB in the beginning and 63.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 78.71ms. Allocated memory is still 100.7MB. Free memory was 63.2MB in the beginning and 61.1MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 806.76ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 43.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12244.50ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 43.1MB in the beginning and 172.4MB in the end (delta: -129.3MB). Peak memory consumption was 82.9MB. Max. memory is 16.1GB. * Witness Printer took 179.87ms. Allocated memory is still 201.3MB. Free memory was 172.4MB in the beginning and 168.0MB in the end (delta: 4.4MB). There was no memory consumed. 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 22]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 575 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 575 mSDsluCounter, 1433 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 906 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1433 IncrementalHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 527 mSDtfsCounter, 1433 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 12 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 2856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-28 04:21:06,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97077b6-b9af-495d-ad0b-ed32592bd98a/bin/uautomizer-verify-aQ6SnzHsRB/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 Result: TRUE