./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test21-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test21-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd --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 05085beafc13f38fbda38ea415197838c6c50810d8ce271072546e893cc1f1e6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:58:55,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:58:55,328 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 12:58:55,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:58:55,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:58:55,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:58:55,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:58:55,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:58:55,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:58:55,392 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:58:55,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:58:55,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:58:55,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:58:55,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:58:55,394 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:58:55,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:58:55,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:58:55,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:58:55,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:58:55,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:58:55,395 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 12:58:55,395 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 12:58:55,395 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 12:58:55,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:58:55,395 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:58:55,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:58:55,395 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:58:55,395 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:58:55,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:58:55,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:58:55,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:58:55,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:58:55,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:58:55,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:58:55,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:58:55,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:58:55,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:58:55,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:58:55,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:58:55,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:58:55,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:58:55,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:58:55,398 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_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd 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 -> 05085beafc13f38fbda38ea415197838c6c50810d8ce271072546e893cc1f1e6 [2024-11-13 12:58:55,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:58:55,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:58:55,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:58:55,834 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:58:55,835 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:58:55,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/ldv-regression/test21-1.c Unable to find full path for "g++" [2024-11-13 12:58:58,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:58:58,629 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:58:58,630 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/sv-benchmarks/c/ldv-regression/test21-1.c [2024-11-13 12:58:58,645 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/data/3760cc546/9d6dd5f5095e4f6b8dc4e36b03a4be74/FLAG061f43f80 [2024-11-13 12:58:58,664 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/data/3760cc546/9d6dd5f5095e4f6b8dc4e36b03a4be74 [2024-11-13 12:58:58,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:58:58,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:58:58,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:58:58,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:58:58,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:58:58,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:58:58" (1/1) ... [2024-11-13 12:58:58,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7907b9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:58, skipping insertion in model container [2024-11-13 12:58:58,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:58:58" (1/1) ... [2024-11-13 12:58:58,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:58:58,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:58:58,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:58:58,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:58:59,004 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:58:59,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59 WrapperNode [2024-11-13 12:58:59,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:58:59,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:58:59,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:58:59,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:58:59,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59" (1/1) ... [2024-11-13 12:58:59,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59" (1/1) ... [2024-11-13 12:58:59,063 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 65 [2024-11-13 12:58:59,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:58:59,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:58:59,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:58:59,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:58:59,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59" (1/1) ... [2024-11-13 12:58:59,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59" (1/1) ... [2024-11-13 12:58:59,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59" (1/1) ... [2024-11-13 12:58:59,111 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 4 writes are split as follows [0, 4]. [2024-11-13 12:58:59,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59" (1/1) ... [2024-11-13 12:58:59,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59" (1/1) ... [2024-11-13 12:58:59,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59" (1/1) ... [2024-11-13 12:58:59,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59" (1/1) ... [2024-11-13 12:58:59,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59" (1/1) ... [2024-11-13 12:58:59,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59" (1/1) ... [2024-11-13 12:58:59,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:58:59,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:58:59,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:58:59,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:58:59,132 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59" (1/1) ... [2024-11-13 12:58:59,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:58:59,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:58:59,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:58:59,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:58:59,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:58:59,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:58:59,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 12:58:59,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 12:58:59,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 12:58:59,209 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2024-11-13 12:58:59,209 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2024-11-13 12:58:59,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:58:59,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:58:59,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 12:58:59,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 12:58:59,338 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:58:59,341 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:58:59,722 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-13 12:58:59,722 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:58:59,740 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:58:59,740 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 12:58:59,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:58:59 BoogieIcfgContainer [2024-11-13 12:58:59,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:58:59,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:58:59,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:58:59,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:58:59,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:58:58" (1/3) ... [2024-11-13 12:58:59,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bcb40e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:58:59, skipping insertion in model container [2024-11-13 12:58:59,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:58:59" (2/3) ... [2024-11-13 12:58:59,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bcb40e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:58:59, skipping insertion in model container [2024-11-13 12:58:59,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:58:59" (3/3) ... [2024-11-13 12:58:59,756 INFO L112 eAbstractionObserver]: Analyzing ICFG test21-1.c [2024-11-13 12:58:59,778 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:58:59,782 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG test21-1.c that has 2 procedures, 45 locations, 1 initial locations, 0 loop locations, and 14 error locations. [2024-11-13 12:58:59,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:58:59,872 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;@24ea724c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:58:59,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-13 12:58:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 41 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:58:59,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 12:58:59,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:58:59,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 12:58:59,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-13 12:58:59,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:58:59,901 INFO L85 PathProgramCache]: Analyzing trace with hash 31843, now seen corresponding path program 1 times [2024-11-13 12:58:59,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:58:59,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567118804] [2024-11-13 12:58:59,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:58:59,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:00,219 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-13 12:59:00,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:00,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567118804] [2024-11-13 12:59:00,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567118804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:00,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:00,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 12:59:00,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713415389] [2024-11-13 12:59:00,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:00,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:59:00,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:00,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:59:00,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:00,269 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 41 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-13 12:59:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:00,370 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-11-13 12:59:00,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:59:00,373 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-13 12:59:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:00,381 INFO L225 Difference]: With dead ends: 42 [2024-11-13 12:59:00,381 INFO L226 Difference]: Without dead ends: 40 [2024-11-13 12:59:00,384 INFO L431 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-13 12:59:00,388 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:00,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 27 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:59:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-13 12:59:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-13 12:59:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-11-13 12:59:00,447 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 3 [2024-11-13 12:59:00,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:00,448 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-11-13 12:59:00,448 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-13 12:59:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-11-13 12:59:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 12:59:00,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:00,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-13 12:59:00,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:59:00,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-13 12:59:00,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash 31844, now seen corresponding path program 1 times [2024-11-13 12:59:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:00,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800431392] [2024-11-13 12:59:00,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:00,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:00,677 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-13 12:59:00,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:00,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800431392] [2024-11-13 12:59:00,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800431392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:00,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:00,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 12:59:00,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8702608] [2024-11-13 12:59:00,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:00,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:59:00,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:00,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:59:00,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:00,682 INFO L87 Difference]: Start difference. First operand 40 states and 41 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-13 12:59:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:00,745 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2024-11-13 12:59:00,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:59:00,746 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-13 12:59:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:00,747 INFO L225 Difference]: With dead ends: 38 [2024-11-13 12:59:00,749 INFO L226 Difference]: Without dead ends: 38 [2024-11-13 12:59:00,749 INFO L431 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-13 12:59:00,750 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:00,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 28 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:59:00,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-13 12:59:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-13 12:59:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.4) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-11-13 12:59:00,762 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 3 [2024-11-13 12:59:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:00,763 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-11-13 12:59:00,763 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-13 12:59:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-11-13 12:59:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 12:59:00,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:00,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:00,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:59:00,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-13 12:59:00,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash -657768027, now seen corresponding path program 1 times [2024-11-13 12:59:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:00,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432806696] [2024-11-13 12:59:00,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:00,897 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-13 12:59:00,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:00,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432806696] [2024-11-13 12:59:00,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432806696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:00,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:00,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 12:59:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172465224] [2024-11-13 12:59:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:00,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:59:00,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:00,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:59:00,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:00,900 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-13 12:59:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:00,940 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-11-13 12:59:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:59:00,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-11-13 12:59:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:00,942 INFO L225 Difference]: With dead ends: 36 [2024-11-13 12:59:00,942 INFO L226 Difference]: Without dead ends: 36 [2024-11-13 12:59:00,942 INFO L431 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-13 12:59:00,943 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:00,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 24 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:59:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-13 12:59:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-13 12:59:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.32) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-13 12:59:00,949 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 7 [2024-11-13 12:59:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:00,950 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-13 12:59:00,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-13 12:59:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-13 12:59:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 12:59:00,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:00,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:00,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:59:00,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-13 12:59:00,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:00,952 INFO L85 PathProgramCache]: Analyzing trace with hash -657768026, now seen corresponding path program 1 times [2024-11-13 12:59:00,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:00,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348151625] [2024-11-13 12:59:00,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:00,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:01,129 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-13 12:59:01,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:01,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348151625] [2024-11-13 12:59:01,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348151625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:01,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:01,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 12:59:01,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636147656] [2024-11-13 12:59:01,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:01,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:59:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:01,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:59:01,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:01,135 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-13 12:59:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:01,178 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-13 12:59:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:59:01,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-11-13 12:59:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:01,180 INFO L225 Difference]: With dead ends: 34 [2024-11-13 12:59:01,180 INFO L226 Difference]: Without dead ends: 34 [2024-11-13 12:59:01,180 INFO L431 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-13 12:59:01,181 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:01,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 26 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:59:01,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-13 12:59:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-13 12:59:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.24) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-13 12:59:01,188 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 7 [2024-11-13 12:59:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:01,188 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-13 12:59:01,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-13 12:59:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-11-13 12:59:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 12:59:01,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:01,190 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:01,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:59:01,190 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-13 12:59:01,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:01,191 INFO L85 PathProgramCache]: Analyzing trace with hash -406027572, now seen corresponding path program 1 times [2024-11-13 12:59:01,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:01,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044197087] [2024-11-13 12:59:01,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:01,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:01,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:59:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:01,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:59:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:02,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:02,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044197087] [2024-11-13 12:59:02,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044197087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:02,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:02,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:59:02,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145737586] [2024-11-13 12:59:02,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:02,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:59:02,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:02,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:59:02,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:59:02,120 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:02,454 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-11-13 12:59:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:59:02,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-13 12:59:02,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:02,456 INFO L225 Difference]: With dead ends: 33 [2024-11-13 12:59:02,456 INFO L226 Difference]: Without dead ends: 33 [2024-11-13 12:59:02,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:59:02,461 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:02,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 86 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:59:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-13 12:59:02,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-13 12:59:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-13 12:59:02,472 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2024-11-13 12:59:02,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:02,474 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-13 12:59:02,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:02,475 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-13 12:59:02,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 12:59:02,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:02,479 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:02,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:59:02,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-13 12:59:02,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:02,480 INFO L85 PathProgramCache]: Analyzing trace with hash -406027573, now seen corresponding path program 1 times [2024-11-13 12:59:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:02,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609843928] [2024-11-13 12:59:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:02,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:02,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:59:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:02,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:59:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:02,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:02,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609843928] [2024-11-13 12:59:02,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609843928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:59:02,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435750600] [2024-11-13 12:59:02,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:02,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:59:02,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:59:02,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:59:02,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:59:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:03,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 12:59:03,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:59:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:03,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:59:03,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435750600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:03,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:59:03,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2024-11-13 12:59:03,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103828229] [2024-11-13 12:59:03,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:03,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:59:03,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:03,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:59:03,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:59:03,796 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:04,022 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2024-11-13 12:59:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:59:04,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-13 12:59:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:04,025 INFO L225 Difference]: With dead ends: 32 [2024-11-13 12:59:04,025 INFO L226 Difference]: Without dead ends: 32 [2024-11-13 12:59:04,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-13 12:59:04,028 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:04,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 78 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:59:04,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-13 12:59:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-13 12:59:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 28 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-13 12:59:04,036 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 23 [2024-11-13 12:59:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:04,036 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-13 12:59:04,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-13 12:59:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 12:59:04,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:04,037 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:04,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:59:04,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 12:59:04,238 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-13 12:59:04,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash 298047128, now seen corresponding path program 1 times [2024-11-13 12:59:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572359754] [2024-11-13 12:59:04,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:04,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:59:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:04,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:59:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 12:59:04,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:04,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572359754] [2024-11-13 12:59:04,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572359754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:04,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:04,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:59:04,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792772468] [2024-11-13 12:59:04,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:04,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:59:04,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:04,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:59:04,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:59:04,375 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:04,415 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-13 12:59:04,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:59:04,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-13 12:59:04,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:04,416 INFO L225 Difference]: With dead ends: 31 [2024-11-13 12:59:04,416 INFO L226 Difference]: Without dead ends: 31 [2024-11-13 12:59:04,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:59:04,417 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 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-13 12:59:04,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:59:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-13 12:59:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-13 12:59:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-11-13 12:59:04,427 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 24 [2024-11-13 12:59:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:04,428 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-13 12:59:04,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-11-13 12:59:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 12:59:04,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:04,429 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:04,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:59:04,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-13 12:59:04,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 298047129, now seen corresponding path program 1 times [2024-11-13 12:59:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:04,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650076395] [2024-11-13 12:59:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:05,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:59:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:05,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:59:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:59:05,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:05,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650076395] [2024-11-13 12:59:05,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650076395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:05,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:05,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 12:59:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865141147] [2024-11-13 12:59:05,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:05,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 12:59:05,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:05,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 12:59:05,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:59:05,719 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:06,304 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-11-13 12:59:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:59:06,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-13 12:59:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:06,306 INFO L225 Difference]: With dead ends: 30 [2024-11-13 12:59:06,306 INFO L226 Difference]: Without dead ends: 30 [2024-11-13 12:59:06,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:59:06,307 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:06,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 117 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:59:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-13 12:59:06,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-13 12:59:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:06,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-13 12:59:06,312 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2024-11-13 12:59:06,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:06,313 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-13 12:59:06,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:06,313 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-13 12:59:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 12:59:06,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:06,314 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:06,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:59:06,315 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-13 12:59:06,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:06,316 INFO L85 PathProgramCache]: Analyzing trace with hash 298063052, now seen corresponding path program 1 times [2024-11-13 12:59:06,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:06,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829972593] [2024-11-13 12:59:06,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:06,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:06,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:59:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:06,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:59:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:06,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 12:59:06,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:06,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829972593] [2024-11-13 12:59:06,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829972593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:06,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:06,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:59:06,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136974252] [2024-11-13 12:59:06,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:06,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:59:06,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:06,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:59:06,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:59:06,377 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:06,402 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2024-11-13 12:59:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:59:06,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-13 12:59:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:06,404 INFO L225 Difference]: With dead ends: 29 [2024-11-13 12:59:06,404 INFO L226 Difference]: Without dead ends: 27 [2024-11-13 12:59:06,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-13 12:59:06,405 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:06,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 26 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:59:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-13 12:59:06,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-13 12:59:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.0) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 12:59:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-13 12:59:06,414 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2024-11-13 12:59:06,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:06,414 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-13 12:59:06,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:06,414 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-13 12:59:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 12:59:06,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:59:06,415 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:06,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 12:59:06,415 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-13 12:59:06,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:59:06,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1058348015, now seen corresponding path program 1 times [2024-11-13 12:59:06,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:59:06,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343301991] [2024-11-13 12:59:06,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:59:06,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:59:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:06,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:59:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:06,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:59:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:59:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 12:59:06,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:59:06,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343301991] [2024-11-13 12:59:06,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343301991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:59:06,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:59:06,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 12:59:06,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35380245] [2024-11-13 12:59:06,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:59:06,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 12:59:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:59:06,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:59:06,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:59:06,675 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:59:06,718 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2024-11-13 12:59:06,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:59:06,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-13 12:59:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:59:06,719 INFO L225 Difference]: With dead ends: 24 [2024-11-13 12:59:06,719 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 12:59:06,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:59:06,720 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:59:06,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:59:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 12:59:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 12:59:06,722 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-13 12:59:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 12:59:06,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2024-11-13 12:59:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:59:06,723 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 12:59:06,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 12:59:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 12:59:06,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 12:59:06,727 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2024-11-13 12:59:06,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-13 12:59:06,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-13 12:59:06,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-13 12:59:06,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-13 12:59:06,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-13 12:59:06,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-13 12:59:06,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2024-11-13 12:59:06,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2024-11-13 12:59:06,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2024-11-13 12:59:06,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-11-13 12:59:06,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-11-13 12:59:06,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (1 of 14 remaining) [2024-11-13 12:59:06,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2024-11-13 12:59:06,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:59:06,739 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:59:06,743 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:59:06,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:59:06 BoogieIcfgContainer [2024-11-13 12:59:06,750 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:59:06,751 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:59:06,751 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:59:06,751 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:59:06,752 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:58:59" (3/4) ... [2024-11-13 12:59:06,759 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 12:59:06,767 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2024-11-13 12:59:06,775 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-13 12:59:06,776 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-13 12:59:06,776 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 12:59:06,777 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 12:59:06,878 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 12:59:06,878 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 12:59:06,879 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:59:06,880 INFO L158 Benchmark]: Toolchain (without parser) took 8211.61ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 92.2MB in the beginning and 108.6MB in the end (delta: -16.4MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-13 12:59:06,880 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:59:06,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.98ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 81.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:59:06,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.05ms. Allocated memory is still 117.4MB. Free memory was 81.2MB in the beginning and 79.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:59:06,882 INFO L158 Benchmark]: Boogie Preprocessor took 64.24ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:59:06,882 INFO L158 Benchmark]: RCFGBuilder took 612.05ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 65.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:59:06,882 INFO L158 Benchmark]: TraceAbstraction took 7004.11ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 64.8MB in the beginning and 113.5MB in the end (delta: -48.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:59:06,883 INFO L158 Benchmark]: Witness Printer took 128.08ms. Allocated memory is still 159.4MB. Free memory was 113.5MB in the beginning and 108.6MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:59:06,885 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.41ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.98ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 81.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.05ms. Allocated memory is still 117.4MB. Free memory was 81.2MB in the beginning and 79.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.24ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 612.05ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 65.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7004.11ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 64.8MB in the beginning and 113.5MB in the end (delta: -48.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 128.08ms. Allocated memory is still 159.4MB. Free memory was 113.5MB in the beginning and 108.6MB in the end (delta: 4.9MB). 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: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 32]: 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 2 procedures, 45 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 217 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 598 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 359 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 386 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 239 mSDtfsCounter, 386 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 50, 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 1565 SizeOfPredicates, 2 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 19/21 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 - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-13 12:59:06,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df4fa3c-1c1f-412f-b45b-929b814d7e25/bin/uautomizer-verify-qhAvR1uOyd/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