./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.16-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.16-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ce057761c66e7025e367ba93d275e71dea4e6dc273a0ba7c5cecd0f774a5d453 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:22:34,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:22:34,125 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-27 23:22:34,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:22:34,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:22:34,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:22:34,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:22:34,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:22:34,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:22:34,171 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:22:34,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:22:34,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:22:34,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:22:34,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:22:34,172 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:22:34,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:22:34,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:22:34,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:22:34,173 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 23:22:34,173 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 23:22:34,173 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 23:22:34,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:22:34,173 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 23:22:34,173 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 23:22:34,174 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:22:34,174 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:22:34,174 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:22:34,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:22:34,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:22:34,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:22:34,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:22:34,175 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:22:34,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:22:34,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:22:34,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:22:34,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:22:34,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:22:34,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:22:34,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:22:34,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:22:34,176 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:22:34,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:22:34,176 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:22:34,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:22:34,177 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_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce057761c66e7025e367ba93d275e71dea4e6dc273a0ba7c5cecd0f774a5d453 [2024-11-27 23:22:34,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:22:34,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:22:34,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:22:34,518 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:22:34,518 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:22:34,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/termination-memory-alloca/b.16-alloca.i [2024-11-27 23:22:37,625 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/data/b094ecdb5/9340182dbdad4a839a4166415358d691/FLAG0e3e773f6 [2024-11-27 23:22:38,004 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:22:38,005 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/sv-benchmarks/c/termination-memory-alloca/b.16-alloca.i [2024-11-27 23:22:38,021 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/data/b094ecdb5/9340182dbdad4a839a4166415358d691/FLAG0e3e773f6 [2024-11-27 23:22:38,233 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/data/b094ecdb5/9340182dbdad4a839a4166415358d691 [2024-11-27 23:22:38,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:22:38,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:22:38,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:22:38,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:22:38,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:22:38,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0aad91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38, skipping insertion in model container [2024-11-27 23:22:38,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:22:38,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:22:38,749 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:22:38,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:22:38,867 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:22:38,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38 WrapperNode [2024-11-27 23:22:38,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:22:38,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:22:38,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:22:38,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:22:38,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,923 INFO L138 Inliner]: procedures = 111, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-11-27 23:22:38,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:22:38,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:22:38,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:22:38,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:22:38,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,963 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [4, 2, 4]. 40 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [2, 1, 2]. [2024-11-27 23:22:38,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,973 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:38,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:22:38,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:22:38,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:22:38,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:22:38,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (1/1) ... [2024-11-27 23:22:39,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:22:39,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:22:39,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:22:39,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:22:39,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 23:22:39,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 23:22:39,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 23:22:39,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 23:22:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 23:22:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 23:22:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 23:22:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 23:22:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:22:39,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:22:39,239 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:22:39,242 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:22:39,573 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-27 23:22:39,573 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:22:39,589 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:22:39,589 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 23:22:39,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:22:39 BoogieIcfgContainer [2024-11-27 23:22:39,590 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:22:39,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:22:39,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:22:39,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:22:39,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:22:38" (1/3) ... [2024-11-27 23:22:39,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e7153a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:22:39, skipping insertion in model container [2024-11-27 23:22:39,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:22:38" (2/3) ... [2024-11-27 23:22:39,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e7153a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:22:39, skipping insertion in model container [2024-11-27 23:22:39,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:22:39" (3/3) ... [2024-11-27 23:22:39,608 INFO L128 eAbstractionObserver]: Analyzing ICFG b.16-alloca.i [2024-11-27 23:22:39,630 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:22:39,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.16-alloca.i that has 1 procedures, 42 locations, 1 initial locations, 2 loop locations, and 21 error locations. [2024-11-27 23:22:39,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:22:39,717 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;@517223e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:22:39,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-27 23:22:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 20 states have (on average 2.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 23:22:39,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:22:39,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 23:22:39,731 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 23:22:39,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:22:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-27 23:22:39,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:22:39,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969546192] [2024-11-27 23:22:39,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:22:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:22:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:22:40,322 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-27 23:22:40,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:22:40,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969546192] [2024-11-27 23:22:40,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969546192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:22:40,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:22:40,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:22:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642250348] [2024-11-27 23:22:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:22:40,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:22:40,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:22:40,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:22:40,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:22:40,357 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 2.25) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:22:40,435 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2024-11-27 23:22:40,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:22:40,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-27 23:22:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:22:40,445 INFO L225 Difference]: With dead ends: 38 [2024-11-27 23:22:40,445 INFO L226 Difference]: Without dead ends: 36 [2024-11-27 23:22:40,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:22:40,450 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:22:40,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 19 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:22:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-27 23:22:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-27 23:22:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-27 23:22:40,485 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 3 [2024-11-27 23:22:40,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:22:40,486 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-27 23:22:40,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-27 23:22:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 23:22:40,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:22:40,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 23:22:40,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:22:40,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 23:22:40,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:22:40,488 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-27 23:22:40,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:22:40,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744714566] [2024-11-27 23:22:40,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:22:40,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:22:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:22:40,802 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-27 23:22:40,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:22:40,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744714566] [2024-11-27 23:22:40,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744714566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:22:40,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:22:40,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:22:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526234117] [2024-11-27 23:22:40,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:22:40,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:22:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:22:40,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:22:40,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:22:40,808 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:22:40,884 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2024-11-27 23:22:40,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:22:40,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-27 23:22:40,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:22:40,885 INFO L225 Difference]: With dead ends: 32 [2024-11-27 23:22:40,885 INFO L226 Difference]: Without dead ends: 32 [2024-11-27 23:22:40,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:22:40,886 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:22:40,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:22:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-27 23:22:40,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-27 23:22:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.736842105263158) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-27 23:22:40,894 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 3 [2024-11-27 23:22:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:22:40,894 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-27 23:22:40,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-27 23:22:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-27 23:22:40,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:22:40,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-27 23:22:40,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:22:40,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 23:22:40,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:22:40,897 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2024-11-27 23:22:40,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:22:40,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136344266] [2024-11-27 23:22:40,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:22:40,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:22:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:22:40,990 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-27 23:22:40,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:22:40,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136344266] [2024-11-27 23:22:40,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136344266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:22:40,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:22:40,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:22:40,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999756883] [2024-11-27 23:22:40,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:22:40,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:22:40,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:22:40,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:22:40,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:22:40,992 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:22:41,057 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-27 23:22:41,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:22:41,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-27 23:22:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:22:41,059 INFO L225 Difference]: With dead ends: 28 [2024-11-27 23:22:41,059 INFO L226 Difference]: Without dead ends: 28 [2024-11-27 23:22:41,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:22:41,060 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:22:41,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:22:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-27 23:22:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-27 23:22:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-11-27 23:22:41,065 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 4 [2024-11-27 23:22:41,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:22:41,065 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-11-27 23:22:41,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-11-27 23:22:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-27 23:22:41,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:22:41,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-27 23:22:41,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:22:41,067 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 23:22:41,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:22:41,067 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2024-11-27 23:22:41,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:22:41,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458653378] [2024-11-27 23:22:41,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:22:41,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:22:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:22:41,176 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-27 23:22:41,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:22:41,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458653378] [2024-11-27 23:22:41,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458653378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:22:41,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:22:41,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:22:41,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942470075] [2024-11-27 23:22:41,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:22:41,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:22:41,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:22:41,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:22:41,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:22:41,179 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:41,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:22:41,227 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-11-27 23:22:41,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:22:41,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-27 23:22:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:22:41,228 INFO L225 Difference]: With dead ends: 24 [2024-11-27 23:22:41,228 INFO L226 Difference]: Without dead ends: 24 [2024-11-27 23:22:41,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:22:41,229 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:22:41,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:22:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-27 23:22:41,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-27 23:22:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-11-27 23:22:41,233 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 4 [2024-11-27 23:22:41,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:22:41,233 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-11-27 23:22:41,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-11-27 23:22:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-27 23:22:41,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:22:41,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 23:22:41,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 23:22:41,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 23:22:41,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:22:41,235 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2024-11-27 23:22:41,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:22:41,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673982567] [2024-11-27 23:22:41,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:22:41,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:22:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:22:41,288 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-27 23:22:41,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:22:41,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673982567] [2024-11-27 23:22:41,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673982567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:22:41,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:22:41,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:22:41,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677416243] [2024-11-27 23:22:41,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:22:41,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:22:41,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:22:41,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:22:41,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:22:41,290 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:22:41,367 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-27 23:22:41,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:22:41,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-27 23:22:41,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:22:41,369 INFO L225 Difference]: With dead ends: 22 [2024-11-27 23:22:41,369 INFO L226 Difference]: Without dead ends: 22 [2024-11-27 23:22:41,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:22:41,372 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:22:41,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:22:41,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-27 23:22:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-27 23:22:41,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-27 23:22:41,379 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 5 [2024-11-27 23:22:41,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:22:41,379 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-27 23:22:41,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-11-27 23:22:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-27 23:22:41,379 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:22:41,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 23:22:41,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 23:22:41,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 23:22:41,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:22:41,381 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2024-11-27 23:22:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:22:41,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395320268] [2024-11-27 23:22:41,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:22:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:22:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:22:41,467 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-27 23:22:41,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:22:41,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395320268] [2024-11-27 23:22:41,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395320268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:22:41,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:22:41,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 23:22:41,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553288434] [2024-11-27 23:22:41,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:22:41,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:22:41,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:22:41,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:22:41,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:22:41,469 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:22:41,499 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-27 23:22:41,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:22:41,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-27 23:22:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:22:41,500 INFO L225 Difference]: With dead ends: 20 [2024-11-27 23:22:41,500 INFO L226 Difference]: Without dead ends: 20 [2024-11-27 23:22:41,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:22:41,501 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:22:41,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:22:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-27 23:22:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-27 23:22:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-11-27 23:22:41,505 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 5 [2024-11-27 23:22:41,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:22:41,505 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-11-27 23:22:41,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 23:22:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-11-27 23:22:41,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-27 23:22:41,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:22:41,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:22:41,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 23:22:41,507 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-27 23:22:41,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:22:41,507 INFO L85 PathProgramCache]: Analyzing trace with hash 324636463, now seen corresponding path program 1 times [2024-11-27 23:22:41,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:22:41,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652751148] [2024-11-27 23:22:41,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:22:41,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:22:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:22:41,816 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-27 23:22:41,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:22:41,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652751148] [2024-11-27 23:22:41,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652751148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:22:41,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:22:41,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:22:41,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430680473] [2024-11-27 23:22:41,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:22:41,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:22:41,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:22:41,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:22:41,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:22:41,818 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-27 23:22:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:22:41,882 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-11-27 23:22:41,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:22:41,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-27 23:22:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:22:41,884 INFO L225 Difference]: With dead ends: 19 [2024-11-27 23:22:41,884 INFO L226 Difference]: Without dead ends: 0 [2024-11-27 23:22:41,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:22:41,885 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:22:41,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 15 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:22:41,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-27 23:22:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-27 23:22:41,886 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-27 23:22:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-27 23:22:41,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2024-11-27 23:22:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:22:41,886 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-27 23:22:41,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-27 23:22:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-27 23:22:41,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-27 23:22:41,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2024-11-27 23:22:41,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-27 23:22:41,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-27 23:22:41,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2024-11-27 23:22:41,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2024-11-27 23:22:41,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-27 23:22:41,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-27 23:22:41,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-27 23:22:41,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-27 23:22:41,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-27 23:22:41,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-27 23:22:41,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-27 23:22:41,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-27 23:22:41,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-27 23:22:41,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-27 23:22:41,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-27 23:22:41,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-11-27 23:22:41,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-11-27 23:22:41,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-11-27 23:22:41,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-11-27 23:22:41,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2024-11-27 23:22:41,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 23:22:41,905 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:22:41,908 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:22:41,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:22:41 BoogieIcfgContainer [2024-11-27 23:22:41,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:22:41,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:22:41,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:22:41,914 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:22:41,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:22:39" (3/4) ... [2024-11-27 23:22:41,918 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-27 23:22:41,930 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-27 23:22:41,931 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-27 23:22:41,931 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-27 23:22:41,931 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-27 23:22:42,037 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 23:22:42,037 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 23:22:42,037 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:22:42,039 INFO L158 Benchmark]: Toolchain (without parser) took 3798.96ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 33.0MB in the end (delta: 57.5MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2024-11-27 23:22:42,040 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 83.9MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:22:42,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.02ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 74.2MB in the end (delta: 16.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:22:42,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.30ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 72.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:22:42,042 INFO L158 Benchmark]: Boogie Preprocessor took 66.73ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 71.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:22:42,042 INFO L158 Benchmark]: RCFGBuilder took 596.09ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 57.4MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 23:22:42,043 INFO L158 Benchmark]: TraceAbstraction took 2317.81ms. Allocated memory is still 117.4MB. Free memory was 56.7MB in the beginning and 38.0MB in the end (delta: 18.7MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-27 23:22:42,043 INFO L158 Benchmark]: Witness Printer took 123.87ms. Allocated memory is still 117.4MB. Free memory was 38.0MB in the beginning and 33.0MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:22:42,046 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.42ms. Allocated memory is still 83.9MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 627.02ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 74.2MB in the end (delta: 16.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.30ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 72.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.73ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 71.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 596.09ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 57.4MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2317.81ms. Allocated memory is still 117.4MB. Free memory was 56.7MB in the beginning and 38.0MB in the end (delta: 18.7MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * Witness Printer took 123.87ms. Allocated memory is still 117.4MB. Free memory was 38.0MB in the beginning and 33.0MB 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: -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: 563]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 142 IncrementalHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 91 mSDtfsCounter, 142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-27 23:22:42,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b65e2f51-6989-4bb2-9e01-f6b4846262e3/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE