./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0158-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0158-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 be381633e08917ff7523167eb47da4558cd865b57872b34c3877295f48e457c8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:44:49,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:44:49,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:44:49,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:44:49,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:44:49,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:44:49,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:44:49,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:44:49,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:44:49,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:44:49,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:44:49,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:44:49,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:44:49,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:44:49,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:44:49,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:44:49,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:44:49,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:44:49,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:44:49,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:44:49,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:44:49,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:44:49,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:44:49,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:44:49,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:44:49,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:44:49,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:44:49,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:44:49,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:44:49,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:44:49,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:44:49,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:44:49,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:44:49,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:44:49,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:44:49,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:44:49,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:44:49,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:44:49,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:44:49,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:44:49,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:44:49,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:44:49,682 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:44:49,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:44:49,683 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:44:49,683 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:44:49,684 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:44:49,684 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:44:49,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:44:49,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:44:49,685 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:44:49,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:44:49,685 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:44:49,685 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:44:49,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:44:49,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:44:49,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:44:49,686 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:44:49,687 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:44:49,687 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:44:49,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:44:49,687 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:44:49,687 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:44:49,688 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:44:49,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:44:49,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:44:49,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:44:49,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:49,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:44:49,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:44:49,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:44:49,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:44:49,690 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> be381633e08917ff7523167eb47da4558cd865b57872b34c3877295f48e457c8 [2022-02-20 23:44:49,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:44:49,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:44:49,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:44:49,923 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:44:49,924 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:44:49,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0158-1.i [2022-02-20 23:44:49,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf235058/2da9e1f9fe264266aa38675ecbd45a21/FLAG33b753be1 [2022-02-20 23:44:50,331 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:44:50,332 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0158-1.i [2022-02-20 23:44:50,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf235058/2da9e1f9fe264266aa38675ecbd45a21/FLAG33b753be1 [2022-02-20 23:44:50,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf235058/2da9e1f9fe264266aa38675ecbd45a21 [2022-02-20 23:44:50,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:44:50,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:44:50,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:50,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:44:50,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:44:50,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:50" (1/1) ... [2022-02-20 23:44:50,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ad7a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:50, skipping insertion in model container [2022-02-20 23:44:50,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:50" (1/1) ... [2022-02-20 23:44:50,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:44:50,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:44:50,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:51,008 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:44:51,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:51,097 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:44:51,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:51 WrapperNode [2022-02-20 23:44:51,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:51,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:51,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:44:51,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:44:51,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:51" (1/1) ... [2022-02-20 23:44:51,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:51" (1/1) ... [2022-02-20 23:44:51,141 INFO L137 Inliner]: procedures = 123, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-02-20 23:44:51,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:51,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:44:51,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:44:51,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:44:51,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:51" (1/1) ... [2022-02-20 23:44:51,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:51" (1/1) ... [2022-02-20 23:44:51,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:51" (1/1) ... [2022-02-20 23:44:51,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:51" (1/1) ... [2022-02-20 23:44:51,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:51" (1/1) ... [2022-02-20 23:44:51,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:51" (1/1) ... [2022-02-20 23:44:51,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:51" (1/1) ... [2022-02-20 23:44:51,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:44:51,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:44:51,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:44:51,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:44:51,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:51" (1/1) ... [2022-02-20 23:44:51,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:51,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:51,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:44:51,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:44:51,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:44:51,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:44:51,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:44:51,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:44:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:44:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:44:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:44:51,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:44:51,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:44:51,320 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:44:51,321 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:44:51,442 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:44:51,448 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:44:51,448 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:44:51,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:51 BoogieIcfgContainer [2022-02-20 23:44:51,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:44:51,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:44:51,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:44:51,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:44:51,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:44:50" (1/3) ... [2022-02-20 23:44:51,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0a8a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:51, skipping insertion in model container [2022-02-20 23:44:51,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:51" (2/3) ... [2022-02-20 23:44:51,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0a8a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:51, skipping insertion in model container [2022-02-20 23:44:51,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:51" (3/3) ... [2022-02-20 23:44:51,457 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0158-1.i [2022-02-20 23:44:51,461 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:44:51,461 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-02-20 23:44:51,501 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:44:51,506 INFO L339 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:44:51,506 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-02-20 23:44:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 21 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) [2022-02-20 23:44:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:51,551 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:51,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:51,552 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:44:51,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:51,558 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:44:51,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:51,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318488431] [2022-02-20 23:44:51,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:51,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:51,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {25#true} is VALID [2022-02-20 23:44:51,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {27#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} is VALID [2022-02-20 23:44:51,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} assume !(1 == #valid[main_~#data~0#1.base]); {26#false} is VALID [2022-02-20 23:44:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:51,783 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:51,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318488431] [2022-02-20 23:44:51,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318488431] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:51,785 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:51,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:51,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714380003] [2022-02-20 23:44:51,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:51,796 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 [2022-02-20 23:44:51,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:51,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 23:44:51,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:51,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:51,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:51,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:51,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:51,842 INFO L87 Difference]: Start difference. First operand has 22 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 21 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) 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) [2022-02-20 23:44:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:51,928 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-02-20 23:44:51,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:51,928 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 [2022-02-20 23:44:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 23:44:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-02-20 23:44:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 23:44:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-02-20 23:44:51,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2022-02-20 23:44:51,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:51,978 INFO L225 Difference]: With dead ends: 19 [2022-02-20 23:44:51,979 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 23:44:51,982 INFO L932 BasicCegarLoop]: 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 [2022-02-20 23:44:51,997 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:52,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 11 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 23:44:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 23:44:52,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:52,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.6) internal successors, (16), 16 states have internal predecessors, (16), 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) [2022-02-20 23:44:52,034 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.6) internal successors, (16), 16 states have internal predecessors, (16), 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) [2022-02-20 23:44:52,034 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.6) internal successors, (16), 16 states have internal predecessors, (16), 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) [2022-02-20 23:44:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,042 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2022-02-20 23:44:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-02-20 23:44:52,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:52,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:52,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.6) internal successors, (16), 16 states have internal predecessors, (16), 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 17 states. [2022-02-20 23:44:52,045 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.6) internal successors, (16), 16 states have internal predecessors, (16), 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 17 states. [2022-02-20 23:44:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,049 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2022-02-20 23:44:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-02-20 23:44:52,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:52,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:52,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:52,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.6) internal successors, (16), 16 states have internal predecessors, (16), 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) [2022-02-20 23:44:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2022-02-20 23:44:52,055 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 3 [2022-02-20 23:44:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:52,056 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2022-02-20 23:44:52,056 INFO L471 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) [2022-02-20 23:44:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-02-20 23:44:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:52,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:52,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:52,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:44:52,058 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:44:52,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:52,061 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:44:52,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:52,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767978017] [2022-02-20 23:44:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:52,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {100#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {100#true} is VALID [2022-02-20 23:44:52,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {102#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 10 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:52,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {102#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 10 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} assume !(4 + main_~#data~0#1.offset <= #length[main_~#data~0#1.base] && 0 <= main_~#data~0#1.offset); {101#false} is VALID [2022-02-20 23:44:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:52,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:52,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767978017] [2022-02-20 23:44:52,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767978017] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:52,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:52,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:52,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007711235] [2022-02-20 23:44:52,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:52,131 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 [2022-02-20 23:44:52,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:52,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 23:44:52,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:52,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:52,137 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:52,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:52,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:52,138 INFO L87 Difference]: Start difference. First operand 17 states and 16 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) [2022-02-20 23:44:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,166 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2022-02-20 23:44:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:52,166 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 [2022-02-20 23:44:52,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 23:44:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 23:44:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 23:44:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-02-20 23:44:52,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2022-02-20 23:44:52,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:52,204 INFO L225 Difference]: With dead ends: 14 [2022-02-20 23:44:52,205 INFO L226 Difference]: Without dead ends: 14 [2022-02-20 23:44:52,206 INFO L932 BasicCegarLoop]: 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 [2022-02-20 23:44:52,207 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:52,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:52,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-20 23:44:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-20 23:44:52,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:52,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 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) [2022-02-20 23:44:52,214 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 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) [2022-02-20 23:44:52,215 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 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) [2022-02-20 23:44:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,216 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2022-02-20 23:44:52,216 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2022-02-20 23:44:52,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:52,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:52,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 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 14 states. [2022-02-20 23:44:52,217 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 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 14 states. [2022-02-20 23:44:52,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,218 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2022-02-20 23:44:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2022-02-20 23:44:52,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:52,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:52,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:52,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 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) [2022-02-20 23:44:52,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2022-02-20 23:44:52,220 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 3 [2022-02-20 23:44:52,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:52,221 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2022-02-20 23:44:52,221 INFO L471 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) [2022-02-20 23:44:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2022-02-20 23:44:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:44:52,222 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:52,222 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:52,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:44:52,222 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:44:52,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:52,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1803024996, now seen corresponding path program 1 times [2022-02-20 23:44:52,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:52,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64580798] [2022-02-20 23:44:52,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:52,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:52,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {161#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {161#true} is VALID [2022-02-20 23:44:52,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {163#(= |ULTIMATE.start_main_#t~malloc3#1.offset| 0)} is VALID [2022-02-20 23:44:52,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#(= |ULTIMATE.start_main_#t~malloc3#1.offset| 0)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L533 {164#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:44:52,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {164#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {164#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:44:52,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {164#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} SUMMARY for call write~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L534 {164#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:44:52,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L534-1 {165#(= |ULTIMATE.start_main_#t~mem4#1.offset| 0)} is VALID [2022-02-20 23:44:52,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {165#(= |ULTIMATE.start_main_#t~mem4#1.offset| 0)} assume !(0 == main_#t~mem4#1.offset); {162#false} is VALID [2022-02-20 23:44:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:52,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:52,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64580798] [2022-02-20 23:44:52,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64580798] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:52,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:52,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:44:52,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562372849] [2022-02-20 23:44:52,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:52,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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 [2022-02-20 23:44:52,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:52,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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) [2022-02-20 23:44:52,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:52,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:44:52,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:52,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:44:52,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:52,365 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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) [2022-02-20 23:44:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,439 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2022-02-20 23:44:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:44:52,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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 [2022-02-20 23:44:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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) [2022-02-20 23:44:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-02-20 23:44:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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) [2022-02-20 23:44:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-02-20 23:44:52,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2022-02-20 23:44:52,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:52,457 INFO L225 Difference]: With dead ends: 13 [2022-02-20 23:44:52,457 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 23:44:52,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:44:52,464 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:52,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 17 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 23:44:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-20 23:44:52,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:52,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 12 states have internal predecessors, (12), 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) [2022-02-20 23:44:52,469 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 12 states have internal predecessors, (12), 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) [2022-02-20 23:44:52,470 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 12 states have internal predecessors, (12), 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) [2022-02-20 23:44:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,472 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2022-02-20 23:44:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-20 23:44:52,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:52,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:52,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 12 states have internal predecessors, (12), 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 13 states. [2022-02-20 23:44:52,476 INFO L87 Difference]: Start difference. First operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 12 states have internal predecessors, (12), 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 13 states. [2022-02-20 23:44:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,479 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2022-02-20 23:44:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-20 23:44:52,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:52,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:52,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:52,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.2) internal successors, (12), 12 states have internal predecessors, (12), 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) [2022-02-20 23:44:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2022-02-20 23:44:52,481 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 7 [2022-02-20 23:44:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:52,482 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2022-02-20 23:44:52,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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) [2022-02-20 23:44:52,482 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2022-02-20 23:44:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:52,483 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:52,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:52,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:44:52,483 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:44:52,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash 59200074, now seen corresponding path program 1 times [2022-02-20 23:44:52,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:52,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675804652] [2022-02-20 23:44:52,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:52,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:52,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {224#true} is VALID [2022-02-20 23:44:52,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {226#(<= (+ |ULTIMATE.start_main_#t~malloc3#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:52,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#(<= (+ |ULTIMATE.start_main_#t~malloc3#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L533 {227#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:52,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {227#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {227#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:52,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {227#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L534 {227#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:52,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L534-1 {228#(<= (+ |ULTIMATE.start_main_#t~mem4#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:52,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {228#(<= (+ |ULTIMATE.start_main_#t~mem4#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem4#1.offset; {228#(<= (+ |ULTIMATE.start_main_#t~mem4#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:52,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {228#(<= (+ |ULTIMATE.start_main_#t~mem4#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem4#1.base < #StackHeapBarrier); {225#false} is VALID [2022-02-20 23:44:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:52,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:52,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675804652] [2022-02-20 23:44:52,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675804652] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:52,576 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:52,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:44:52,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737295359] [2022-02-20 23:44:52,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:52,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2022-02-20 23:44:52,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:52,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-02-20 23:44:52,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:52,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:44:52,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:52,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:44:52,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:52,587 INFO L87 Difference]: Start difference. First operand 13 states and 12 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-02-20 23:44:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,660 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-20 23:44:52,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:44:52,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2022-02-20 23:44:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-02-20 23:44:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-02-20 23:44:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-02-20 23:44:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-02-20 23:44:52,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 12 transitions. [2022-02-20 23:44:52,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:52,676 INFO L225 Difference]: With dead ends: 12 [2022-02-20 23:44:52,676 INFO L226 Difference]: Without dead ends: 12 [2022-02-20 23:44:52,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:44:52,677 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:52,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 10 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-20 23:44:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-20 23:44:52,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:52,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 10 states have (on average 1.1) internal successors, (11), 11 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) [2022-02-20 23:44:52,680 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 10 states have (on average 1.1) internal successors, (11), 11 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) [2022-02-20 23:44:52,680 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 10 states have (on average 1.1) internal successors, (11), 11 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) [2022-02-20 23:44:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,681 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-20 23:44:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-20 23:44:52,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:52,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:52,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 10 states have (on average 1.1) internal successors, (11), 11 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) Second operand 12 states. [2022-02-20 23:44:52,682 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.1) internal successors, (11), 11 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) Second operand 12 states. [2022-02-20 23:44:52,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,683 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2022-02-20 23:44:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-20 23:44:52,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:52,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:52,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:52,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.1) internal successors, (11), 11 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) [2022-02-20 23:44:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2022-02-20 23:44:52,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 8 [2022-02-20 23:44:52,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:52,685 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2022-02-20 23:44:52,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-02-20 23:44:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2022-02-20 23:44:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:44:52,686 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:52,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:52,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:44:52,687 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:44:52,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:52,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1835202342, now seen corresponding path program 1 times [2022-02-20 23:44:52,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:52,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967526024] [2022-02-20 23:44:52,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:52,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:52,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {283#true} is VALID [2022-02-20 23:44:52,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {285#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} is VALID [2022-02-20 23:44:52,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L533 {286#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:44:52,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {286#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {286#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:44:52,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {286#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} SUMMARY for call write~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L534 {286#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:44:52,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {286#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L534-1 {287#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} is VALID [2022-02-20 23:44:52,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} assume 0 == main_#t~mem4#1.offset; {287#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} is VALID [2022-02-20 23:44:52,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {287#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} assume main_#t~mem4#1.base < #StackHeapBarrier; {287#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} is VALID [2022-02-20 23:44:52,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {287#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} assume !(0 == main_#t~mem4#1.base || 1 == #valid[main_#t~mem4#1.base]); {284#false} is VALID [2022-02-20 23:44:52,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:52,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:52,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967526024] [2022-02-20 23:44:52,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967526024] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:52,781 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:52,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:44:52,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735736450] [2022-02-20 23:44:52,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:52,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:44:52,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:52,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:52,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:52,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:44:52,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:52,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:44:52,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:52,792 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,846 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2022-02-20 23:44:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:44:52,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:44:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2022-02-20 23:44:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2022-02-20 23:44:52,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2022-02-20 23:44:52,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:52,859 INFO L225 Difference]: With dead ends: 11 [2022-02-20 23:44:52,859 INFO L226 Difference]: Without dead ends: 11 [2022-02-20 23:44:52,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:44:52,860 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:52,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 7 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-20 23:44:52,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-20 23:44:52,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:52,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:52,863 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:52,863 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,864 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2022-02-20 23:44:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2022-02-20 23:44:52,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:52,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:52,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 23:44:52,865 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 23:44:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:52,866 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2022-02-20 23:44:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2022-02-20 23:44:52,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:52,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:52,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:52,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 10 transitions. [2022-02-20 23:44:52,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 10 transitions. Word has length 9 [2022-02-20 23:44:52,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:52,868 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 10 transitions. [2022-02-20 23:44:52,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2022-02-20 23:44:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:44:52,869 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:52,869 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:52,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:44:52,870 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 6 more)] === [2022-02-20 23:44:52,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1056697805, now seen corresponding path program 1 times [2022-02-20 23:44:52,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:52,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126521168] [2022-02-20 23:44:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:52,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:53,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {338#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {338#true} is VALID [2022-02-20 23:44:53,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {338#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {340#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~malloc3#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_main_#t~malloc3#1.base| 2) |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:53,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~malloc3#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_main_#t~malloc3#1.base| 2) |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L533 {341#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 2) |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:53,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {341#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 2) |ULTIMATE.start_main_~#data~0#1.base|))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {341#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 2) |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:53,044 INFO L290 TraceCheckUtils]: 4: Hoare triple {341#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 2) |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L534 {341#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 2) |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:53,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {341#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 2) |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L534-1 {342#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~mem4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:53,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {342#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~mem4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~#data~0#1.base|)))} assume 0 == main_#t~mem4#1.offset; {342#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~mem4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:53,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~mem4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~#data~0#1.base|)))} assume main_#t~mem4#1.base < #StackHeapBarrier; {342#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~mem4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:53,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~mem4#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~#data~0#1.base|)))} assume 0 == main_#t~mem4#1.base || 1 == #valid[main_#t~mem4#1.base];call ULTIMATE.dealloc(main_#t~mem4#1.base, main_#t~mem4#1.offset);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;main_#res#1 := 0;call ULTIMATE.dealloc(main_~#data~0#1.base, main_~#data~0#1.offset);havoc main_~#data~0#1.base, main_~#data~0#1.offset; {343#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:44:53,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {343#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {339#false} is VALID [2022-02-20 23:44:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:53,049 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:53,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126521168] [2022-02-20 23:44:53,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126521168] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:53,049 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:53,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:44:53,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465488284] [2022-02-20 23:44:53,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:53,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:44:53,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:53,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:53,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:44:53,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:53,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:44:53,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:44:53,063 INFO L87 Difference]: Start difference. First operand 11 states and 10 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:53,165 INFO L93 Difference]: Finished difference Result 10 states and 9 transitions. [2022-02-20 23:44:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:44:53,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:44:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2022-02-20 23:44:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2022-02-20 23:44:53,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 10 transitions. [2022-02-20 23:44:53,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:53,179 INFO L225 Difference]: With dead ends: 10 [2022-02-20 23:44:53,179 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 23:44:53,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:44:53,181 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:53,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 23:44:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 23:44:53,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:53,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-02-20 23:44:53,182 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-02-20 23:44:53,182 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-02-20 23:44:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:53,183 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:44:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:44:53,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:53,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:53,183 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-02-20 23:44:53,184 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-02-20 23:44:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:53,184 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:44:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:44:53,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:53,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:53,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:53,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:53,185 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) [2022-02-20 23:44:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 23:44:53,185 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2022-02-20 23:44:53,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:53,185 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 23:44:53,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:44:53,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:53,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION (9 of 10 remaining) [2022-02-20 23:44:53,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (8 of 10 remaining) [2022-02-20 23:44:53,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (7 of 10 remaining) [2022-02-20 23:44:53,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION (6 of 10 remaining) [2022-02-20 23:44:53,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION (5 of 10 remaining) [2022-02-20 23:44:53,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION (4 of 10 remaining) [2022-02-20 23:44:53,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (3 of 10 remaining) [2022-02-20 23:44:53,190 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 10 remaining) [2022-02-20 23:44:53,190 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (1 of 10 remaining) [2022-02-20 23:44:53,190 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-02-20 23:44:53,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:44:53,193 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 23:44:53,195 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:44:53,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:44:53 BoogieIcfgContainer [2022-02-20 23:44:53,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:44:53,198 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:44:53,198 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:44:53,198 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:44:53,199 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:51" (3/4) ... [2022-02-20 23:44:53,201 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 23:44:53,209 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 23:44:53,209 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 23:44:53,209 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-20 23:44:53,209 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 23:44:53,233 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:44:53,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:44:53,235 INFO L158 Benchmark]: Toolchain (without parser) took 2515.63ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 54.9MB in the beginning and 75.8MB in the end (delta: -20.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:53,235 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory was 72.3MB in the beginning and 72.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:53,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.53ms. Allocated memory is still 92.3MB. Free memory was 54.7MB in the beginning and 59.9MB in the end (delta: -5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:44:53,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.81ms. Allocated memory is still 92.3MB. Free memory was 59.9MB in the beginning and 57.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:53,236 INFO L158 Benchmark]: Boogie Preprocessor took 32.22ms. Allocated memory is still 92.3MB. Free memory was 57.8MB in the beginning and 56.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:53,236 INFO L158 Benchmark]: RCFGBuilder took 274.87ms. Allocated memory is still 92.3MB. Free memory was 56.5MB in the beginning and 44.9MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:44:53,237 INFO L158 Benchmark]: TraceAbstraction took 1746.15ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 44.6MB in the beginning and 78.0MB in the end (delta: -33.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:53,237 INFO L158 Benchmark]: Witness Printer took 35.72ms. Allocated memory is still 111.1MB. Free memory was 78.0MB in the beginning and 75.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:53,243 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory was 72.3MB in the beginning and 72.2MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.53ms. Allocated memory is still 92.3MB. Free memory was 54.7MB in the beginning and 59.9MB in the end (delta: -5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.81ms. Allocated memory is still 92.3MB. Free memory was 59.9MB in the beginning and 57.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.22ms. Allocated memory is still 92.3MB. Free memory was 57.8MB in the beginning and 56.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 274.87ms. Allocated memory is still 92.3MB. Free memory was 56.5MB in the beginning and 44.9MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1746.15ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 44.6MB in the beginning and 78.0MB in the end (delta: -33.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 35.72ms. Allocated memory is still 111.1MB. Free memory was 78.0MB in the beginning and 75.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. 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: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 535]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 535]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 523]: 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, 22 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 40 mSDtfsCounter, 102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 31, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 23:44:53,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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