./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c --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-ext3/derefAfterFree2.c -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 6c5050f69dd0fe75249366946a38ba884fb5943ccf611397d2d01e0ccda347b5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:40,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:40,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:40,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:40,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:40,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:40,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:40,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:40,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:40,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:40,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:40,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:40,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:40,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:40,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:40,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:40,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:40,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:40,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:40,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:40,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:40,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:40,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:40,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:40,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:40,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:40,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:40,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:40,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:40,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:40,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:40,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:40,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:40,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:40,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:40,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:40,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:40,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:40,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:40,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:40,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:40,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-21 00:02:40,795 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:40,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:40,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:40,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:40,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:40,797 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:40,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:40,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:40,797 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:40,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:40,798 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:40,798 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:40,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:40,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:40,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:40,799 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:40,799 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:40,799 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:40,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:40,800 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:40,800 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:40,800 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:40,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:40,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:40,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:40,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:40,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:40,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:40,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:40,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:40,802 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 -> 6c5050f69dd0fe75249366946a38ba884fb5943ccf611397d2d01e0ccda347b5 [2022-02-21 00:02:41,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:41,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:41,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:41,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:41,071 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:41,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c [2022-02-21 00:02:41,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae5f86ef/414422ff283641239dfa5f0615f299f5/FLAG5a6518d21 [2022-02-21 00:02:41,491 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:41,491 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c [2022-02-21 00:02:41,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae5f86ef/414422ff283641239dfa5f0615f299f5/FLAG5a6518d21 [2022-02-21 00:02:41,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae5f86ef/414422ff283641239dfa5f0615f299f5 [2022-02-21 00:02:41,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:41,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:41,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:41,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:41,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:41,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfdf2ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41, skipping insertion in model container [2022-02-21 00:02:41,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:41,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:41,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:41,683 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:41,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:41,705 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:41,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41 WrapperNode [2022-02-21 00:02:41,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:41,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:41,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:41,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:41,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,730 INFO L137 Inliner]: procedures = 9, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2022-02-21 00:02:41,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:41,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:41,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:41,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:41,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:41,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:41,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:41,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:41,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (1/1) ... [2022-02-21 00:02:41,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:41,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:41,788 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-21 00:02:41,805 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-21 00:02:41,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 00:02:41,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 00:02:41,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:41,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 00:02:41,862 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:41,863 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:41,959 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:41,962 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:41,962 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 00:02:41,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:41 BoogieIcfgContainer [2022-02-21 00:02:41,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:41,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:41,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:41,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:41,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:41" (1/3) ... [2022-02-21 00:02:41,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6966c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:41, skipping insertion in model container [2022-02-21 00:02:41,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:41" (2/3) ... [2022-02-21 00:02:41,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6966c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:41, skipping insertion in model container [2022-02-21 00:02:41,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:41" (3/3) ... [2022-02-21 00:02:41,969 INFO L111 eAbstractionObserver]: Analyzing ICFG derefAfterFree2.c [2022-02-21 00:02:41,972 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:41,972 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 00:02:41,996 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:42,000 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-21 00:02:42,000 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 00:02:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.75) internal successors, (21), 18 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-21 00:02:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 00:02:42,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:42,012 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 00:02:42,012 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2022-02-21 00:02:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 00:02:42,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:42,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43230006] [2022-02-21 00:02:42,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {22#true} is VALID [2022-02-21 00:02:42,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; {24#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-21 00:02:42,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !!(main_~i~0#1 < 10); {24#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-21 00:02:42,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(1 == #valid[main_~p~0#1.base]); {23#false} is VALID [2022-02-21 00:02:42,131 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-21 00:02:42,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:42,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43230006] [2022-02-21 00:02:42,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43230006] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:42,132 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:42,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:42,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428069876] [2022-02-21 00:02:42,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:42,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:42,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:42,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:42,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:42,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:42,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,162 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.75) internal successors, (21), 18 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,224 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-21 00:02:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:42,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-02-21 00:02:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-02-21 00:02:42,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-02-21 00:02:42,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,266 INFO L225 Difference]: With dead ends: 27 [2022-02-21 00:02:42,266 INFO L226 Difference]: Without dead ends: 23 [2022-02-21 00:02:42,268 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-21 00:02:42,270 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:42,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 17 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-21 00:02:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2022-02-21 00:02:42,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:42,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 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-21 00:02:42,307 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 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-21 00:02:42,308 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 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-21 00:02:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,316 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-02-21 00:02:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-21 00:02:42,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 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 23 states. [2022-02-21 00:02:42,318 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 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 23 states. [2022-02-21 00:02:42,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,327 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-02-21 00:02:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-21 00:02:42,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:42,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 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-21 00:02:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-02-21 00:02:42,331 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 4 [2022-02-21 00:02:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:42,332 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-02-21 00:02:42,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-21 00:02:42,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 00:02:42,332 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:42,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 00:02:42,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:42,334 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2022-02-21 00:02:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-02-21 00:02:42,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:42,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211425275] [2022-02-21 00:02:42,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {119#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {119#true} is VALID [2022-02-21 00:02:42,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; {121#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {121#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10); {121#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4 + (main_~p~0#1.offset + 4 * main_~i~0#1) <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset + 4 * main_~i~0#1); {120#false} is VALID [2022-02-21 00:02:42,396 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-21 00:02:42,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:42,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211425275] [2022-02-21 00:02:42,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211425275] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:42,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:42,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:42,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782237765] [2022-02-21 00:02:42,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:42,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:42,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:42,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:42,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:42,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:42,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,405 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,444 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-21 00:02:42,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:42,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 00:02:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-21 00:02:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-21 00:02:42,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-02-21 00:02:42,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,475 INFO L225 Difference]: With dead ends: 23 [2022-02-21 00:02:42,475 INFO L226 Difference]: Without dead ends: 23 [2022-02-21 00:02:42,475 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-21 00:02:42,476 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:42,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-21 00:02:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-02-21 00:02:42,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:42,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,482 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,483 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,484 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-21 00:02:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-21 00:02:42,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-21 00:02:42,485 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-21 00:02:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:42,486 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-21 00:02:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-21 00:02:42,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:42,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:42,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:42,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-21 00:02:42,488 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 4 [2022-02-21 00:02:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:42,488 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-21 00:02:42,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-21 00:02:42,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 00:02:42,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:42,489 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:42,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:42,489 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2022-02-21 00:02:42,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:42,490 INFO L85 PathProgramCache]: Analyzing trace with hash 264743433, now seen corresponding path program 1 times [2022-02-21 00:02:42,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:42,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518908315] [2022-02-21 00:02:42,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {215#true} is VALID [2022-02-21 00:02:42,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; {217#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 40)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 40)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10); {217#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 40)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {217#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 40)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {217#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 40)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,569 INFO L290 TraceCheckUtils]: 4: Hoare triple {217#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 40)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(5 == main_~i~0#1); {217#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 40)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {217#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 40)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {218#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {218#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10); {219#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 9) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 40)) 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 9) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4 + (main_~p~0#1.offset + 4 * main_~i~0#1) <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset + 4 * main_~i~0#1); {216#false} is VALID [2022-02-21 00:02:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:42,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:42,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518908315] [2022-02-21 00:02:42,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518908315] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:42,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576251217] [2022-02-21 00:02:42,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:42,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:42,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:02:42,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 00:02:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 00:02:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:42,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 00:02:42,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {215#true} is VALID [2022-02-21 00:02:42,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; {226#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10); {226#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {226#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {226#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {226#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(5 == main_~i~0#1); {226#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {239#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(main_~i~0#1 < 10); {239#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-21 00:02:42,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#(and (<= 40 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4 + (main_~p~0#1.offset + 4 * main_~i~0#1) <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset + 4 * main_~i~0#1); {216#false} is VALID [2022-02-21 00:02:42,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:42,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:43,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#(and (<= (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} assume !(4 + (main_~p~0#1.offset + 4 * main_~i~0#1) <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset + 4 * main_~i~0#1); {216#false} is VALID [2022-02-21 00:02:43,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {246#(and (<= (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} assume !!(main_~i~0#1 < 10); {246#(and (<= (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} is VALID [2022-02-21 00:02:43,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {253#(and (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {246#(and (<= (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} is VALID [2022-02-21 00:02:43,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {253#(and (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} assume !(5 == main_~i~0#1); {253#(and (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} is VALID [2022-02-21 00:02:43,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#(and (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {253#(and (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} is VALID [2022-02-21 00:02:43,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#(and (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} assume !!(main_~i~0#1 < 10); {253#(and (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} is VALID [2022-02-21 00:02:43,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; {253#(and (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 8 (* |ULTIMATE.start_main_~i~0#1| 4)) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= 0 (+ |ULTIMATE.start_main_~p~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} is VALID [2022-02-21 00:02:43,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {215#true} is VALID [2022-02-21 00:02:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:43,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576251217] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:43,019 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:43,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-02-21 00:02:43,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488493470] [2022-02-21 00:02:43,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:43,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-21 00:02:43,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:43,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-21 00:02:43,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:43,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 00:02:43,039 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:43,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 00:02:43,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-21 00:02:43,041 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-21 00:02:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,196 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-21 00:02:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 00:02:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-21 00:02:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-21 00:02:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-02-21 00:02:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-21 00:02:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-02-21 00:02:43,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2022-02-21 00:02:43,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:43,230 INFO L225 Difference]: With dead ends: 30 [2022-02-21 00:02:43,230 INFO L226 Difference]: Without dead ends: 30 [2022-02-21 00:02:43,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-21 00:02:43,231 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:43,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 11 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-21 00:02:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-21 00:02:43,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:43,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,235 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,235 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,236 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-21 00:02:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-21 00:02:43,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-21 00:02:43,238 INFO L87 Difference]: Start difference. First operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-21 00:02:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,239 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-21 00:02:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-21 00:02:43,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:43,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-02-21 00:02:43,241 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 8 [2022-02-21 00:02:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:43,242 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-02-21 00:02:43,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-21 00:02:43,242 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-21 00:02:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 00:02:43,242 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:43,243 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 00:02:43,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:43,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:43,456 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2022-02-21 00:02:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:43,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1943209927, now seen corresponding path program 1 times [2022-02-21 00:02:43,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:43,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507332843] [2022-02-21 00:02:43,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:43,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:43,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {392#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {392#true} is VALID [2022-02-21 00:02:43,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {392#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:02:43,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume !!(main_~i~0#1 < 10); {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:02:43,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:02:43,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume !(5 == main_~i~0#1); {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:02:43,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:02:43,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume !!(main_~i~0#1 < 10); {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:02:43,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:02:43,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume !(5 == main_~i~0#1); {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:02:43,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:02:43,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume !!(main_~i~0#1 < 10); {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:02:43,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:02:43,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume 5 == main_~i~0#1; {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:02:43,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume 0 == main_~p~0#1.offset; {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} is VALID [2022-02-21 00:02:43,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {394#(not (<= |#StackHeapBarrier| |ULTIMATE.start_main_~p~0#1.base|))} assume !(main_~p~0#1.base < #StackHeapBarrier); {393#false} is VALID [2022-02-21 00:02:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-21 00:02:43,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:43,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507332843] [2022-02-21 00:02:43,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507332843] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:43,533 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:43,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:43,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481011531] [2022-02-21 00:02:43,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:43,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-21 00:02:43,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:43,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,541 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-21 00:02:43,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:43,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:43,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:43,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:43,542 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,554 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-21 00:02:43,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:43,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-21 00:02:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:43,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 00:02:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 00:02:43,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2022-02-21 00:02:43,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:43,568 INFO L225 Difference]: With dead ends: 29 [2022-02-21 00:02:43,568 INFO L226 Difference]: Without dead ends: 29 [2022-02-21 00:02:43,568 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-21 00:02:43,569 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:43,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-21 00:02:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-21 00:02:43,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:43,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 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-21 00:02:43,572 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 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-21 00:02:43,573 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 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-21 00:02:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,574 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-21 00:02:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-21 00:02:43,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 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 29 states. [2022-02-21 00:02:43,575 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 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 29 states. [2022-02-21 00:02:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,576 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-02-21 00:02:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-21 00:02:43,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:43,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 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-21 00:02:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-02-21 00:02:43,578 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 15 [2022-02-21 00:02:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:43,579 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-02-21 00:02:43,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-02-21 00:02:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 00:02:43,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:43,580 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:43,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:02:43,580 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2022-02-21 00:02:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:43,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1073461554, now seen corresponding path program 1 times [2022-02-21 00:02:43,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:43,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738014043] [2022-02-21 00:02:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:43,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:43,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {513#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {513#true} is VALID [2022-02-21 00:02:43,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; {515#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:43,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10); {515#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:43,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {515#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {515#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:43,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {515#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(5 == main_~i~0#1); {515#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:43,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {515#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:43,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 10); {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:43,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:43,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(5 == main_~i~0#1); {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:43,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:43,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 10); {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:43,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:43,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 5 == main_~i~0#1; {514#false} is VALID [2022-02-21 00:02:43,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {514#false} assume 0 == main_~p~0#1.offset; {514#false} is VALID [2022-02-21 00:02:43,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {514#false} assume main_~p~0#1.base < #StackHeapBarrier; {514#false} is VALID [2022-02-21 00:02:43,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {514#false} assume 0 == main_~p~0#1.base || 1 == #valid[main_~p~0#1.base];call ULTIMATE.dealloc(main_~p~0#1.base, main_~p~0#1.offset); {514#false} is VALID [2022-02-21 00:02:43,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {514#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {514#false} is VALID [2022-02-21 00:02:43,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {514#false} assume !!(main_~i~0#1 < 10); {514#false} is VALID [2022-02-21 00:02:43,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {514#false} assume !(1 == #valid[main_~p~0#1.base]); {514#false} is VALID [2022-02-21 00:02:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:43,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:43,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738014043] [2022-02-21 00:02:43,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738014043] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:43,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489613064] [2022-02-21 00:02:43,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:43,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:43,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:43,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:02:43,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 00:02:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:43,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 00:02:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:43,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:43,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {513#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {513#true} is VALID [2022-02-21 00:02:43,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; {524#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:43,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {524#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10); {524#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:43,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {524#(<= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {524#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:43,758 INFO L290 TraceCheckUtils]: 4: Hoare triple {524#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(5 == main_~i~0#1); {524#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:43,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {524#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:43,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 10); {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:43,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:43,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(5 == main_~i~0#1); {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:43,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:43,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 10); {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:43,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:43,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 5 == main_~i~0#1; {514#false} is VALID [2022-02-21 00:02:43,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {514#false} assume 0 == main_~p~0#1.offset; {514#false} is VALID [2022-02-21 00:02:43,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {514#false} assume main_~p~0#1.base < #StackHeapBarrier; {514#false} is VALID [2022-02-21 00:02:43,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {514#false} assume 0 == main_~p~0#1.base || 1 == #valid[main_~p~0#1.base];call ULTIMATE.dealloc(main_~p~0#1.base, main_~p~0#1.offset); {514#false} is VALID [2022-02-21 00:02:43,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {514#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {514#false} is VALID [2022-02-21 00:02:43,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {514#false} assume !!(main_~i~0#1 < 10); {514#false} is VALID [2022-02-21 00:02:43,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {514#false} assume !(1 == #valid[main_~p~0#1.base]); {514#false} is VALID [2022-02-21 00:02:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:43,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:43,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {514#false} assume !(1 == #valid[main_~p~0#1.base]); {514#false} is VALID [2022-02-21 00:02:43,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {514#false} assume !!(main_~i~0#1 < 10); {514#false} is VALID [2022-02-21 00:02:43,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {514#false} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {514#false} is VALID [2022-02-21 00:02:43,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {514#false} assume 0 == main_~p~0#1.base || 1 == #valid[main_~p~0#1.base];call ULTIMATE.dealloc(main_~p~0#1.base, main_~p~0#1.offset); {514#false} is VALID [2022-02-21 00:02:43,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {514#false} assume main_~p~0#1.base < #StackHeapBarrier; {514#false} is VALID [2022-02-21 00:02:43,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {514#false} assume 0 == main_~p~0#1.offset; {514#false} is VALID [2022-02-21 00:02:43,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {594#(not (<= 5 |ULTIMATE.start_main_~i~0#1|))} assume 5 == main_~i~0#1; {514#false} is VALID [2022-02-21 00:02:43,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#(not (<= 5 |ULTIMATE.start_main_~i~0#1|))} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {594#(not (<= 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:43,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#(not (<= 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < 10); {594#(not (<= 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:43,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#(< |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {594#(not (<= 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 00:02:43,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#(< |ULTIMATE.start_main_~i~0#1| 4)} assume !(5 == main_~i~0#1); {604#(< |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:43,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#(< |ULTIMATE.start_main_~i~0#1| 4)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {604#(< |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:43,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {604#(< |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 10); {604#(< |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:43,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {604#(< |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:43,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(5 == main_~i~0#1); {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:43,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:43,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 10); {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:43,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; {517#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:43,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {513#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {513#true} is VALID [2022-02-21 00:02:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:43,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489613064] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:43,862 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:43,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-02-21 00:02:43,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118766908] [2022-02-21 00:02:43,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:43,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:02:43,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:43,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:43,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 00:02:43,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:43,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 00:02:43,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 00:02:43,886 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,937 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-02-21 00:02:43,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 00:02:43,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:02:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-02-21 00:02:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-02-21 00:02:43,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-02-21 00:02:43,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:43,966 INFO L225 Difference]: With dead ends: 36 [2022-02-21 00:02:43,967 INFO L226 Difference]: Without dead ends: 36 [2022-02-21 00:02:43,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 00:02:43,968 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:43,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 31 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-21 00:02:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-02-21 00:02:43,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:43,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,971 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,971 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,972 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-02-21 00:02:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-02-21 00:02:43,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-21 00:02:43,973 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-21 00:02:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:43,974 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-02-21 00:02:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-02-21 00:02:43,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:43,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:43,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:43,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:43,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-02-21 00:02:43,976 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 19 [2022-02-21 00:02:43,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:43,976 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-02-21 00:02:43,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-02-21 00:02:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:43,977 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:43,977 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1] [2022-02-21 00:02:44,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:44,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:44,193 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2022-02-21 00:02:44,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:44,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1813320904, now seen corresponding path program 1 times [2022-02-21 00:02:44,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:44,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46017323] [2022-02-21 00:02:44,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:44,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:44,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {774#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {774#true} is VALID [2022-02-21 00:02:44,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; {776#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:44,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {776#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10); {776#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:44,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {776#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {776#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:44,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {776#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(5 == main_~i~0#1); {776#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:44,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {776#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:44,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 10); {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:44,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:44,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(5 == main_~i~0#1); {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:44,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:44,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 10); {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:44,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:44,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(5 == main_~i~0#1); {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:44,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:44,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 10); {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:44,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:44,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(5 == main_~i~0#1); {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:44,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:44,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 10); {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:44,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:44,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(5 == main_~i~0#1); {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:44,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {781#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 00:02:44,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~i~0#1 < 10); {775#false} is VALID [2022-02-21 00:02:44,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {775#false} main_#res#1 := 0; {775#false} is VALID [2022-02-21 00:02:44,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {775#false} assume !(#valid == main_old_#valid#1); {775#false} is VALID [2022-02-21 00:02:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:44,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:44,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46017323] [2022-02-21 00:02:44,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46017323] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:02:44,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109386654] [2022-02-21 00:02:44,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:44,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:44,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:44,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:02:44,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 00:02:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:44,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 00:02:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:44,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:02:44,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {774#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {774#true} is VALID [2022-02-21 00:02:44,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; {788#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:44,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10); {788#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:44,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {788#(<= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {788#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:44,430 INFO L290 TraceCheckUtils]: 4: Hoare triple {788#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(5 == main_~i~0#1); {788#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 00:02:44,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:44,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 10); {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:44,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:44,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(5 == main_~i~0#1); {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 00:02:44,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {777#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:44,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 10); {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:44,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:44,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(5 == main_~i~0#1); {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 00:02:44,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {778#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:44,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 10); {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:44,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:44,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(5 == main_~i~0#1); {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 00:02:44,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {779#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:44,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 10); {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:44,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:44,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(5 == main_~i~0#1); {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:44,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {781#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 00:02:44,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~i~0#1 < 10); {775#false} is VALID [2022-02-21 00:02:44,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {775#false} main_#res#1 := 0; {775#false} is VALID [2022-02-21 00:02:44,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {775#false} assume !(#valid == main_old_#valid#1); {775#false} is VALID [2022-02-21 00:02:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:44,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:02:44,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {775#false} assume !(#valid == main_old_#valid#1); {775#false} is VALID [2022-02-21 00:02:44,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {775#false} main_#res#1 := 0; {775#false} is VALID [2022-02-21 00:02:44,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {864#(< |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 10); {775#false} is VALID [2022-02-21 00:02:44,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {868#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {864#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 00:02:44,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {868#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(5 == main_~i~0#1); {868#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 00:02:44,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {868#(< |ULTIMATE.start_main_~i~0#1| 9)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {868#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 00:02:44,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {868#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 10); {868#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 00:02:44,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {881#(< |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {868#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 00:02:44,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {881#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !(5 == main_~i~0#1); {881#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 00:02:44,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {881#(< |ULTIMATE.start_main_~i~0#1| 8)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {881#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 00:02:44,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#(< |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 10); {881#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 00:02:44,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {894#(< |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {881#(< |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 00:02:44,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {894#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !(5 == main_~i~0#1); {894#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 00:02:44,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {894#(< |ULTIMATE.start_main_~i~0#1| 7)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {894#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 00:02:44,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {894#(< |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 10); {894#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 00:02:44,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {894#(< |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 00:02:44,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {781#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(5 == main_~i~0#1); {781#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 00:02:44,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#(<= |ULTIMATE.start_main_~i~0#1| 5)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {781#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 00:02:44,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 10); {781#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 00:02:44,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; {781#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 00:02:44,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(5 == main_~i~0#1); {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:44,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} SUMMARY for call write~int(1, main_~p~0#1.base, main_~p~0#1.offset + 4 * main_~i~0#1, 4); srcloc: L9 {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:44,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 10); {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:44,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~post3#1, main_~i~0#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnHeap(40);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;main_~i~0#1 := 0; {780#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 00:02:44,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {774#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {774#true} is VALID [2022-02-21 00:02:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:44,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109386654] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:02:44,581 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:02:44,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-02-21 00:02:44,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013434787] [2022-02-21 00:02:44,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:02:44,582 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 25 [2022-02-21 00:02:44,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:44,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-21 00:02:44,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:44,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-21 00:02:44,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:44,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 00:02:44,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:02:44,613 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-21 00:02:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,703 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-02-21 00:02:44,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:02:44,703 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 25 [2022-02-21 00:02:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-21 00:02:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-02-21 00:02:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-21 00:02:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-02-21 00:02:44,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-02-21 00:02:44,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:44,750 INFO L225 Difference]: With dead ends: 50 [2022-02-21 00:02:44,750 INFO L226 Difference]: Without dead ends: 50 [2022-02-21 00:02:44,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 00:02:44,751 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:44,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 31 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-21 00:02:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-21 00:02:44,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:44,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 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-21 00:02:44,754 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 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-21 00:02:44,755 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 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-21 00:02:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,756 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-02-21 00:02:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-02-21 00:02:44,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:44,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:44,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 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 50 states. [2022-02-21 00:02:44,757 INFO L87 Difference]: Start difference. First operand has 50 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 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 50 states. [2022-02-21 00:02:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,758 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-02-21 00:02:44,758 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-02-21 00:02:44,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:44,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:44,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:44,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 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-21 00:02:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-02-21 00:02:44,760 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 25 [2022-02-21 00:02:44,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:44,761 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-02-21 00:02:44,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-21 00:02:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-02-21 00:02:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-21 00:02:44,761 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:44,762 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:44,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 00:02:44,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:02:44,978 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2022-02-21 00:02:44,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:44,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1418335515, now seen corresponding path program 2 times [2022-02-21 00:02:44,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:44,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090898373] [2022-02-21 00:02:44,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:44,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:02:45,006 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 00:02:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 00:02:45,031 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 00:02:45,032 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 00:02:45,032 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION (5 of 6 remaining) [2022-02-21 00:02:45,033 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (4 of 6 remaining) [2022-02-21 00:02:45,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (3 of 6 remaining) [2022-02-21 00:02:45,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (2 of 6 remaining) [2022-02-21 00:02:45,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (1 of 6 remaining) [2022-02-21 00:02:45,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2022-02-21 00:02:45,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 00:02:45,036 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-02-21 00:02:45,038 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 00:02:45,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 12:02:45 BoogieIcfgContainer [2022-02-21 00:02:45,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 00:02:45,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 00:02:45,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 00:02:45,056 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 00:02:45,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:41" (3/4) ... [2022-02-21 00:02:45,058 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 00:02:45,085 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 00:02:45,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 00:02:45,086 INFO L158 Benchmark]: Toolchain (without parser) took 3577.89ms. Allocated memory was 102.8MB in the beginning and 201.3MB in the end (delta: 98.6MB). Free memory was 65.7MB in the beginning and 84.1MB in the end (delta: -18.4MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. [2022-02-21 00:02:45,086 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 00:02:45,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.10ms. Allocated memory is still 102.8MB. Free memory was 65.5MB in the beginning and 79.0MB in the end (delta: -13.5MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2022-02-21 00:02:45,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.62ms. Allocated memory is still 102.8MB. Free memory was 79.0MB in the beginning and 77.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:02:45,087 INFO L158 Benchmark]: Boogie Preprocessor took 22.68ms. Allocated memory is still 102.8MB. Free memory was 77.3MB in the beginning and 76.3MB in the end (delta: 995.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 00:02:45,088 INFO L158 Benchmark]: RCFGBuilder took 209.12ms. Allocated memory is still 102.8MB. Free memory was 76.3MB in the beginning and 65.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 00:02:45,088 INFO L158 Benchmark]: TraceAbstraction took 3091.14ms. Allocated memory was 102.8MB in the beginning and 201.3MB in the end (delta: 98.6MB). Free memory was 65.3MB in the beginning and 88.3MB in the end (delta: -23.0MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2022-02-21 00:02:45,088 INFO L158 Benchmark]: Witness Printer took 29.30ms. Allocated memory is still 201.3MB. Free memory was 88.3MB in the beginning and 84.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 00:02:45,089 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.14ms. Allocated memory is still 102.8MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.10ms. Allocated memory is still 102.8MB. Free memory was 65.5MB in the beginning and 79.0MB in the end (delta: -13.5MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.62ms. Allocated memory is still 102.8MB. Free memory was 79.0MB in the beginning and 77.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.68ms. Allocated memory is still 102.8MB. Free memory was 77.3MB in the beginning and 76.3MB in the end (delta: 995.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 209.12ms. Allocated memory is still 102.8MB. Free memory was 76.3MB in the beginning and 65.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3091.14ms. Allocated memory was 102.8MB in the beginning and 201.3MB in the end (delta: 98.6MB). Free memory was 65.3MB in the beginning and 88.3MB in the end (delta: -23.0MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. * Witness Printer took 29.30ms. Allocated memory is still 201.3MB. Free memory was 88.3MB in the beginning and 84.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 9]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] int* p = malloc(10 * sizeof(int)); [L8] int i = 0; VAL [i=0, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=0, p={-1:0}] [L9] p[i] = 1 VAL [i=0, p={-1:0}] [L10] COND FALSE !(i == 5) VAL [i=0, p={-1:0}] [L8] i++ VAL [i=1, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=1, p={-1:0}] [L9] p[i] = 1 VAL [i=1, p={-1:0}] [L10] COND FALSE !(i == 5) VAL [i=1, p={-1:0}] [L8] i++ VAL [i=2, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=2, p={-1:0}] [L9] p[i] = 1 VAL [i=2, p={-1:0}] [L10] COND FALSE !(i == 5) VAL [i=2, p={-1:0}] [L8] i++ VAL [i=3, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=3, p={-1:0}] [L9] p[i] = 1 VAL [i=3, p={-1:0}] [L10] COND FALSE !(i == 5) VAL [i=3, p={-1:0}] [L8] i++ VAL [i=4, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=4, p={-1:0}] [L9] p[i] = 1 VAL [i=4, p={-1:0}] [L10] COND FALSE !(i == 5) VAL [i=4, p={-1:0}] [L8] i++ VAL [i=5, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=5, p={-1:0}] [L9] p[i] = 1 VAL [i=5, p={-1:0}] [L10] COND TRUE i == 5 VAL [i=5, p={-1:0}] [L11] free(p) VAL [i=5, p={-1:0}] [L11] free(p) VAL [i=5, p={-1:0}] [L11] free(p) [L8] i++ VAL [i=6, p={-1:0}] [L8] COND TRUE i < 10 VAL [i=6, p={-1:0}] [L9] p[i] = 1 - UnprovableResult [Line: 9]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 5]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 7, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 58 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=6, InterpolantAutomatonStates: 35, 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, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 196 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 34/205 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 RESULT: Ultimate proved your program to be incorrect! [2022-02-21 00:02:45,113 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)