./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test07.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_db482d3c-8ba4-4b1e-83ef-307ea6699897/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/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_db482d3c-8ba4-4b1e-83ef-307ea6699897/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test07.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/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_db482d3c-8ba4-4b1e-83ef-307ea6699897/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 e03ee78d6fb8fed8d925fa146d2fbaeda58a8eee93c250fd17f0234d1b1c9cb7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:16:08,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:16:08,082 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:16:08,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:16:08,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:16:08,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:16:08,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:16:08,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:16:08,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:16:08,120 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:16:08,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:16:08,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:16:08,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:16:08,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:16:08,121 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:16:08,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:16:08,121 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:16:08,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:16:08,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:16:08,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:16:08,122 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:16:08,122 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:16:08,122 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:16:08,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:16:08,125 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:16:08,125 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:16:08,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:16:08,125 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:16:08,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:16:08,125 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:16:08,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:16:08,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:16:08,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:16:08,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:16:08,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:16:08,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:16:08,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:16:08,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:16:08,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:16:08,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:16:08,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:16:08,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:16:08,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:16:08,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:16:08,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:16:08,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:16:08,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:16:08,128 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_db482d3c-8ba4-4b1e-83ef-307ea6699897/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 -> e03ee78d6fb8fed8d925fa146d2fbaeda58a8eee93c250fd17f0234d1b1c9cb7 [2024-11-28 04:16:08,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:16:08,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:16:08,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:16:08,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:16:08,476 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:16:08,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/ldv-regression/test07.c [2024-11-28 04:16:11,593 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/bin/uautomizer-verify-aQ6SnzHsRB/data/76346abc9/e5ed9dd19c26409eb15e02a77227a0a5/FLAG4937f84f7 [2024-11-28 04:16:11,890 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:16:11,891 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/sv-benchmarks/c/ldv-regression/test07.c [2024-11-28 04:16:11,897 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/bin/uautomizer-verify-aQ6SnzHsRB/data/76346abc9/e5ed9dd19c26409eb15e02a77227a0a5/FLAG4937f84f7 [2024-11-28 04:16:11,916 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/bin/uautomizer-verify-aQ6SnzHsRB/data/76346abc9/e5ed9dd19c26409eb15e02a77227a0a5 [2024-11-28 04:16:11,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:16:11,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:16:11,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:16:11,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:16:11,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:16:11,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:16:11" (1/1) ... [2024-11-28 04:16:11,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@775a15a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:11, skipping insertion in model container [2024-11-28 04:16:11,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:16:11" (1/1) ... [2024-11-28 04:16:11,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:16:12,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:16:12,167 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:16:12,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:16:12,210 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:16:12,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:12 WrapperNode [2024-11-28 04:16:12,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:16:12,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:16:12,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:16:12,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:16:12,221 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:16:12" (1/1) ... [2024-11-28 04:16:12,228 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:16:12" (1/1) ... [2024-11-28 04:16:12,247 INFO L138 Inliner]: procedures = 12, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2024-11-28 04:16:12,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:16:12,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:16:12,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:16:12,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:16:12,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:12" (1/1) ... [2024-11-28 04:16:12,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:12" (1/1) ... [2024-11-28 04:16:12,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:12" (1/1) ... [2024-11-28 04:16:12,285 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 4 writes are split as follows [0, 4]. [2024-11-28 04:16:12,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:12" (1/1) ... [2024-11-28 04:16:12,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:12" (1/1) ... [2024-11-28 04:16:12,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:12" (1/1) ... [2024-11-28 04:16:12,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:12" (1/1) ... [2024-11-28 04:16:12,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:12" (1/1) ... [2024-11-28 04:16:12,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:12" (1/1) ... [2024-11-28 04:16:12,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:12" (1/1) ... [2024-11-28 04:16:12,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:16:12,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:16:12,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:16:12,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:16:12,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:12" (1/1) ... [2024-11-28 04:16:12,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:16:12,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:16:12,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/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:16:12,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/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:16:12,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 04:16:12,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 04:16:12,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:16:12,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:16:12,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:16:12,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 04:16:12,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 04:16:12,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:16:12,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:16:12,495 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:16:12,497 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:16:12,720 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-28 04:16:12,720 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:16:12,731 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:16:12,732 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 04:16:12,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:16:12 BoogieIcfgContainer [2024-11-28 04:16:12,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:16:12,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:16:12,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:16:12,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:16:12,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:16:11" (1/3) ... [2024-11-28 04:16:12,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6112fa0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:16:12, skipping insertion in model container [2024-11-28 04:16:12,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:16:12" (2/3) ... [2024-11-28 04:16:12,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6112fa0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:16:12, skipping insertion in model container [2024-11-28 04:16:12,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:16:12" (3/3) ... [2024-11-28 04:16:12,747 INFO L128 eAbstractionObserver]: Analyzing ICFG test07.c [2024-11-28 04:16:12,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:16:12,769 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test07.c that has 1 procedures, 44 locations, 1 initial locations, 0 loop locations, and 20 error locations. [2024-11-28 04:16:12,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:16:12,832 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;@4565d657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:16:12,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-28 04:16:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 43 states have internal predecessors, (45), 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:16:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:16:12,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:12,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:16:12,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-28 04:16:12,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-28 04:16:12,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:12,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635615468] [2024-11-28 04:16:12,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:12,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:16:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:13,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635615468] [2024-11-28 04:16:13,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635615468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:13,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:13,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 04:16:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218126577] [2024-11-28 04:16:13,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:13,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:16:13,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:13,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:16:13,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:16:13,222 INFO L87 Difference]: Start difference. First operand has 44 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 43 states have internal predecessors, (45), 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), 2 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:16:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:13,306 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2024-11-28 04:16:13,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:16:13,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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:16:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:13,317 INFO L225 Difference]: With dead ends: 42 [2024-11-28 04:16:13,317 INFO L226 Difference]: Without dead ends: 40 [2024-11-28 04:16:13,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:16:13,323 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:13,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 21 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:16:13,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-28 04:16:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-28 04:16:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 39 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:16:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2024-11-28 04:16:13,363 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 3 [2024-11-28 04:16:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:13,364 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2024-11-28 04:16:13,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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:16:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2024-11-28 04:16:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:16:13,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:13,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:16:13,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:16:13,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-28 04:16:13,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:13,366 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-28 04:16:13,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:13,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199664158] [2024-11-28 04:16:13,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:13,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:13,489 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:16:13,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:13,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199664158] [2024-11-28 04:16:13,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199664158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:13,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:13,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 04:16:13,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562973021] [2024-11-28 04:16:13,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:13,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:16:13,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:13,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:16:13,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:16:13,493 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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:16:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:13,536 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2024-11-28 04:16:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:16:13,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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:16:13,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:13,537 INFO L225 Difference]: With dead ends: 39 [2024-11-28 04:16:13,537 INFO L226 Difference]: Without dead ends: 39 [2024-11-28 04:16:13,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:16:13,538 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:13,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 21 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:16:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-28 04:16:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-28 04:16:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 38 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:16:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-11-28 04:16:13,548 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 3 [2024-11-28 04:16:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:13,548 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2024-11-28 04:16:13,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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:16:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-11-28 04:16:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:16:13,549 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:13,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:16:13,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:16:13,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-28 04:16:13,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:13,551 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2024-11-28 04:16:13,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:13,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631872235] [2024-11-28 04:16:13,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:13,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:13,634 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:16:13,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:13,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631872235] [2024-11-28 04:16:13,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631872235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:13,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:13,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 04:16:13,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521054154] [2024-11-28 04:16:13,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:13,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:16:13,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:13,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:16:13,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:16:13,636 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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:16:13,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:13,689 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2024-11-28 04:16:13,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:16:13,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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:16:13,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:13,691 INFO L225 Difference]: With dead ends: 33 [2024-11-28 04:16:13,691 INFO L226 Difference]: Without dead ends: 33 [2024-11-28 04:16:13,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:16:13,692 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:13,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 14 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:16:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-28 04:16:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-28 04:16:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 32 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:16:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2024-11-28 04:16:13,700 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 4 [2024-11-28 04:16:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:13,701 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2024-11-28 04:16:13,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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:16:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2024-11-28 04:16:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-28 04:16:13,703 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:13,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-28 04:16:13,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:16:13,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-28 04:16:13,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2024-11-28 04:16:13,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:13,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736293406] [2024-11-28 04:16:13,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:13,836 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:16:13,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:13,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736293406] [2024-11-28 04:16:13,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736293406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:13,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:13,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 04:16:13,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202286370] [2024-11-28 04:16:13,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:13,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:16:13,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:13,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:16:13,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:16:13,839 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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:16:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:13,895 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-11-28 04:16:13,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:16:13,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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:16:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:13,897 INFO L225 Difference]: With dead ends: 27 [2024-11-28 04:16:13,897 INFO L226 Difference]: Without dead ends: 27 [2024-11-28 04:16:13,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:16:13,899 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:13,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 15 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:16:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-28 04:16:13,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-28 04:16:13,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 26 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:16:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-28 04:16:13,906 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 4 [2024-11-28 04:16:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:13,906 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-28 04:16:13,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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:16:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-28 04:16:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 04:16:13,907 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:13,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:16:13,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:16:13,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-28 04:16:13,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:13,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1837108006, now seen corresponding path program 1 times [2024-11-28 04:16:13,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:13,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068707344] [2024-11-28 04:16:13,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:13,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:14,074 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:16:14,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:14,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068707344] [2024-11-28 04:16:14,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068707344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:14,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:14,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:16:14,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687462045] [2024-11-28 04:16:14,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:14,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:16:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:14,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:16:14,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:16:14,077 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:16:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:14,132 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2024-11-28 04:16:14,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:16:14,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2024-11-28 04:16:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:14,134 INFO L225 Difference]: With dead ends: 36 [2024-11-28 04:16:14,134 INFO L226 Difference]: Without dead ends: 36 [2024-11-28 04:16:14,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:16:14,135 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 55 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:14,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 29 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:16:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-28 04:16:14,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2024-11-28 04:16:14,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 25 states have internal predecessors, (26), 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:16:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-11-28 04:16:14,139 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 9 [2024-11-28 04:16:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:14,139 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-11-28 04:16:14,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:16:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-11-28 04:16:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-28 04:16:14,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:14,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:16:14,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 04:16:14,141 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-28 04:16:14,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:14,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1837108007, now seen corresponding path program 1 times [2024-11-28 04:16:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:14,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962914820] [2024-11-28 04:16:14,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:14,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:14,323 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:16:14,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:14,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962914820] [2024-11-28 04:16:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962914820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:14,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:14,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:16:14,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252971731] [2024-11-28 04:16:14,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:14,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:16:14,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:14,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:16:14,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:16:14,328 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:16:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:14,406 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2024-11-28 04:16:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:16:14,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-28 04:16:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:14,408 INFO L225 Difference]: With dead ends: 35 [2024-11-28 04:16:14,408 INFO L226 Difference]: Without dead ends: 35 [2024-11-28 04:16:14,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:16:14,409 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:14,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 24 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:16:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-28 04:16:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2024-11-28 04:16:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 24 states have internal predecessors, (25), 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:16:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-11-28 04:16:14,413 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 9 [2024-11-28 04:16:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:14,414 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-11-28 04:16:14,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:16:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-11-28 04:16:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:16:14,414 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:14,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:16:14,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:16:14,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-28 04:16:14,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1115773328, now seen corresponding path program 1 times [2024-11-28 04:16:14,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:14,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329434309] [2024-11-28 04:16:14,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:14,489 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:16:14,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:14,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329434309] [2024-11-28 04:16:14,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329434309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:14,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:14,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:16:14,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201656985] [2024-11-28 04:16:14,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:14,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:16:14,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:14,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:16:14,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:16:14,492 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:16:14,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:14,538 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2024-11-28 04:16:14,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:16:14,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-28 04:16:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:14,540 INFO L225 Difference]: With dead ends: 24 [2024-11-28 04:16:14,540 INFO L226 Difference]: Without dead ends: 24 [2024-11-28 04:16:14,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:16:14,541 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:14,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 10 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:16:14,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-28 04:16:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-28 04:16:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 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:16:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-11-28 04:16:14,545 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 10 [2024-11-28 04:16:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:14,545 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-11-28 04:16:14,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:16:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-11-28 04:16:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-28 04:16:14,546 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:14,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:16:14,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:16:14,546 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-28 04:16:14,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1115773329, now seen corresponding path program 1 times [2024-11-28 04:16:14,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:14,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538927224] [2024-11-28 04:16:14,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:14,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:14,708 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:16:14,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:14,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538927224] [2024-11-28 04:16:14,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538927224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:14,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:14,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:16:14,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520770211] [2024-11-28 04:16:14,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:14,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:16:14,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:14,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:16:14,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:16:14,711 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:16:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:14,762 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2024-11-28 04:16:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:16:14,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-28 04:16:14,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:14,763 INFO L225 Difference]: With dead ends: 23 [2024-11-28 04:16:14,763 INFO L226 Difference]: Without dead ends: 23 [2024-11-28 04:16:14,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:16:14,764 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:14,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 10 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:16:14,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-28 04:16:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-28 04:16:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 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:16:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-11-28 04:16:14,772 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 10 [2024-11-28 04:16:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:14,772 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-11-28 04:16:14,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:16:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-11-28 04:16:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 04:16:14,773 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:14,773 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:16:14,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:16:14,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-28 04:16:14,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:14,776 INFO L85 PathProgramCache]: Analyzing trace with hash 324183829, now seen corresponding path program 1 times [2024-11-28 04:16:14,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:14,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181921893] [2024-11-28 04:16:14,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:14,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:14,842 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:16:14,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:14,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181921893] [2024-11-28 04:16:14,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181921893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:14,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:14,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:16:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452909790] [2024-11-28 04:16:14,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:14,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:16:14,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:14,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:16:14,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:16:14,848 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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:16:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:14,874 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-11-28 04:16:14,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:16:14,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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:16:14,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:14,875 INFO L225 Difference]: With dead ends: 22 [2024-11-28 04:16:14,877 INFO L226 Difference]: Without dead ends: 21 [2024-11-28 04:16:14,877 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:16:14,878 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:14,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:16:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-28 04:16:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-28 04:16:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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:16:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-28 04:16:14,885 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2024-11-28 04:16:14,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:14,885 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-28 04:16:14,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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:16:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-28 04:16:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 04:16:14,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:14,886 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:16:14,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:16:14,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-28 04:16:14,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1459762047, now seen corresponding path program 1 times [2024-11-28 04:16:14,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:14,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548119733] [2024-11-28 04:16:14,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:15,199 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:16:15,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:15,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548119733] [2024-11-28 04:16:15,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548119733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:15,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:16:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902425351] [2024-11-28 04:16:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:15,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:16:15,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:15,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:16:15,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:16:15,204 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:16:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:15,293 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2024-11-28 04:16:15,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:16:15,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:16:15,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:15,297 INFO L225 Difference]: With dead ends: 26 [2024-11-28 04:16:15,297 INFO L226 Difference]: Without dead ends: 21 [2024-11-28 04:16:15,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:16:15,298 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:15,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:16:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-28 04:16:15,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-28 04:16:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.0) internal successors, (20), 20 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:16:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2024-11-28 04:16:15,302 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 20 [2024-11-28 04:16:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:15,302 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2024-11-28 04:16:15,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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:16:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2024-11-28 04:16:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 04:16:15,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:16:15,303 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:16:15,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:16:15,304 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-11-28 04:16:15,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:16:15,305 INFO L85 PathProgramCache]: Analyzing trace with hash 650415421, now seen corresponding path program 1 times [2024-11-28 04:16:15,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:16:15,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873993431] [2024-11-28 04:16:15,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:16:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:16:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:16:15,947 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:16:15,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:16:15,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873993431] [2024-11-28 04:16:15,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873993431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:16:15,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:16:15,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:16:15,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118149302] [2024-11-28 04:16:15,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:16:15,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:16:15,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:16:15,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:16:15,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:16:15,950 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:16:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:16:16,222 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2024-11-28 04:16:16,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:16:16,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:16:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:16:16,223 INFO L225 Difference]: With dead ends: 13 [2024-11-28 04:16:16,223 INFO L226 Difference]: Without dead ends: 0 [2024-11-28 04:16:16,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:16:16,224 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:16:16,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 9 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:16:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-28 04:16:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-28 04:16:16,225 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:16:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-28 04:16:16,226 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2024-11-28 04:16:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:16:16,226 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-28 04:16:16,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 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:16:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-28 04:16:16,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-28 04:16:16,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 20 remaining) [2024-11-28 04:16:16,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-11-28 04:16:16,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-11-28 04:16:16,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-11-28 04:16:16,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-11-28 04:16:16,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-11-28 04:16:16,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-11-28 04:16:16,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-11-28 04:16:16,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-11-28 04:16:16,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-11-28 04:16:16,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-11-28 04:16:16,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2024-11-28 04:16:16,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2024-11-28 04:16:16,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2024-11-28 04:16:16,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2024-11-28 04:16:16,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2024-11-28 04:16:16,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2024-11-28 04:16:16,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 20 remaining) [2024-11-28 04:16:16,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (1 of 20 remaining) [2024-11-28 04:16:16,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (0 of 20 remaining) [2024-11-28 04:16:16,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:16:16,237 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:16:16,240 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 04:16:16,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:16:16 BoogieIcfgContainer [2024-11-28 04:16:16,244 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 04:16:16,244 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 04:16:16,245 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 04:16:16,245 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 04:16:16,245 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:16:12" (3/4) ... [2024-11-28 04:16:16,248 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 04:16:16,261 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-28 04:16:16,261 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-28 04:16:16,261 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 04:16:16,261 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 04:16:16,344 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 04:16:16,344 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 04:16:16,344 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 04:16:16,345 INFO L158 Benchmark]: Toolchain (without parser) took 4424.46ms. Allocated memory is still 142.6MB. Free memory was 116.7MB in the beginning and 84.7MB in the end (delta: 32.0MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-28 04:16:16,345 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:16:16,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.96ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 106.1MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:16:16,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.49ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 104.9MB in the end (delta: 955.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:16:16,346 INFO L158 Benchmark]: Boogie Preprocessor took 59.41ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 103.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:16:16,347 INFO L158 Benchmark]: RCFGBuilder took 424.16ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 90.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:16:16,347 INFO L158 Benchmark]: TraceAbstraction took 3508.59ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 89.4MB in the end (delta: 256.1kB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2024-11-28 04:16:16,347 INFO L158 Benchmark]: Witness Printer took 100.07ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 84.7MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:16:16,349 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.96ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 106.1MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.49ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 104.9MB in the end (delta: 955.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.41ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 103.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 424.16ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 90.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3508.59ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 89.4MB in the end (delta: 256.1kB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Witness Printer took 100.07ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 84.7MB in the end (delta: 4.7MB). 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: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 19]: 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, 44 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 331 mSDsluCounter, 224 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 165 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 47, 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, 11 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-28 04:16:16,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db482d3c-8ba4-4b1e-83ef-307ea6699897/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE