./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0158_1-3.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0158_1-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da0196598caa8f7971f5c05318e98ec0e7e9ad277348cd08159b1fad4465fe6c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:48:28,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:48:28,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:48:28,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:48:28,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:48:28,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:48:28,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:48:28,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:48:28,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:48:28,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:48:28,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:48:28,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:48:28,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:48:28,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:48:28,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:48:28,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:48:28,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:48:28,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:48:28,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:48:28,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:48:28,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:48:28,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:48:28,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:48:28,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:48:28,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:48:28,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:48:28,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:48:28,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:48:28,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:48:28,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:48:28,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:48:28,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:48:28,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:48:28,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:48:28,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:48:28,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:48:28,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:48:28,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:48:28,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:48:28,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:48:28,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:48:28,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:48:28,541 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:48:28,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:48:28,542 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:48:28,542 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:48:28,543 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:48:28,543 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:48:28,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:48:28,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:48:28,544 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:48:28,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:48:28,545 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:48:28,546 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:48:28,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:48:28,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:48:28,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:48:28,546 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:48:28,547 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:48:28,547 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:48:28,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:48:28,547 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:48:28,547 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:48:28,548 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:48:28,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:48:28,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:48:28,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:48:28,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:28,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:48:28,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:48:28,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:48:28,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:48:28,549 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 -> da0196598caa8f7971f5c05318e98ec0e7e9ad277348cd08159b1fad4465fe6c [2022-02-20 23:48:28,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:48:28,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:48:28,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:48:28,780 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:48:28,787 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:48:28,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0158_1-3.i [2022-02-20 23:48:28,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399fb27f7/763bda1661de4519a3d798e8d64d7ce1/FLAGfa81424ed [2022-02-20 23:48:29,239 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:48:29,239 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0158_1-3.i [2022-02-20 23:48:29,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399fb27f7/763bda1661de4519a3d798e8d64d7ce1/FLAGfa81424ed [2022-02-20 23:48:29,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399fb27f7/763bda1661de4519a3d798e8d64d7ce1 [2022-02-20 23:48:29,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:48:29,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:48:29,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:29,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:48:29,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:48:29,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:29" (1/1) ... [2022-02-20 23:48:29,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e9af02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:29, skipping insertion in model container [2022-02-20 23:48:29,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:29" (1/1) ... [2022-02-20 23:48:29,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:48:29,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:29,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:29,556 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:48:29,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:29,638 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:48:29,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:29 WrapperNode [2022-02-20 23:48:29,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:29,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:29,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:48:29,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:48:29,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:29" (1/1) ... [2022-02-20 23:48:29,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:29" (1/1) ... [2022-02-20 23:48:29,687 INFO L137 Inliner]: procedures = 124, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2022-02-20 23:48:29,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:29,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:48:29,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:48:29,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:48:29,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:29" (1/1) ... [2022-02-20 23:48:29,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:29" (1/1) ... [2022-02-20 23:48:29,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:29" (1/1) ... [2022-02-20 23:48:29,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:29" (1/1) ... [2022-02-20 23:48:29,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:29" (1/1) ... [2022-02-20 23:48:29,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:29" (1/1) ... [2022-02-20 23:48:29,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:29" (1/1) ... [2022-02-20 23:48:29,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:48:29,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:48:29,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:48:29,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:48:29,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:29" (1/1) ... [2022-02-20 23:48:29,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:29,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:29,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:48:29,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:48:29,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:48:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:48:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:48:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:48:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:48:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:48:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:48:29,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:48:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:48:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:48:29,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:48:29,833 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:48:29,834 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:48:30,045 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:48:30,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:48:30,050 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:48:30,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:30 BoogieIcfgContainer [2022-02-20 23:48:30,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:48:30,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:48:30,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:48:30,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:48:30,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:48:29" (1/3) ... [2022-02-20 23:48:30,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bfb82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:30, skipping insertion in model container [2022-02-20 23:48:30,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:29" (2/3) ... [2022-02-20 23:48:30,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bfb82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:30, skipping insertion in model container [2022-02-20 23:48:30,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:30" (3/3) ... [2022-02-20 23:48:30,063 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0158_1-3.i [2022-02-20 23:48:30,066 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:48:30,067 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-02-20 23:48:30,118 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:48:30,123 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:48:30,123 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-02-20 23:48:30,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:48:30,149 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:30,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:48:30,150 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:48:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:30,153 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:48:30,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:30,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285865831] [2022-02-20 23:48:30,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:30,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:30,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2); {46#true} is VALID [2022-02-20 23:48:30,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {48#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} is VALID [2022-02-20 23:48:30,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} assume !(1 == #valid[main_~#data~0#1.base]); {47#false} is VALID [2022-02-20 23:48:30,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:30,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:30,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285865831] [2022-02-20 23:48:30,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285865831] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:30,317 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:30,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:30,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141229700] [2022-02-20 23:48:30,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:30,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:48:30,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:30,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:30,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:30,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:30,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:30,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:30,357 INFO L87 Difference]: Start difference. First operand has 43 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:30,463 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-02-20 23:48:30,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:30,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:48:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-02-20 23:48:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-02-20 23:48:30,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 44 transitions. [2022-02-20 23:48:30,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:30,518 INFO L225 Difference]: With dead ends: 36 [2022-02-20 23:48:30,518 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 23:48:30,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:30,522 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:30,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 26 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 23:48:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 23:48:30,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:30,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 20 states have (on average 1.75) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,550 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 20 states have (on average 1.75) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,550 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 20 states have (on average 1.75) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:30,560 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-20 23:48:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-20 23:48:30,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:30,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:30,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 20 states have (on average 1.75) internal successors, (35), 33 states have internal predecessors, (35), 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 34 states. [2022-02-20 23:48:30,563 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.75) internal successors, (35), 33 states have internal predecessors, (35), 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 34 states. [2022-02-20 23:48:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:30,565 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-20 23:48:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-20 23:48:30,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:30,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:30,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:30,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.75) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-02-20 23:48:30,569 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 3 [2022-02-20 23:48:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:30,570 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-02-20 23:48:30,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-02-20 23:48:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:48:30,570 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:30,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:48:30,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:48:30,572 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:48:30,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:48:30,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:30,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617010909] [2022-02-20 23:48:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:30,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:30,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2); {189#true} is VALID [2022-02-20 23:48:30,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {191#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 10 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:30,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 10 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} assume !(4 + main_~#data~0#1.offset <= #length[main_~#data~0#1.base] && 0 <= main_~#data~0#1.offset); {190#false} is VALID [2022-02-20 23:48:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:30,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:30,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617010909] [2022-02-20 23:48:30,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617010909] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:30,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:30,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:30,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654249716] [2022-02-20 23:48:30,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:30,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:48:30,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:30,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:30,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:30,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:30,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:30,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:30,668 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:30,716 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 23:48:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:30,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:48:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-02-20 23:48:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-02-20 23:48:30,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-02-20 23:48:30,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:30,750 INFO L225 Difference]: With dead ends: 27 [2022-02-20 23:48:30,750 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 23:48:30,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:30,755 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:30,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 21 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 23:48:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 23:48:30,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:30,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 20 states have (on average 1.4) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,761 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 20 states have (on average 1.4) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,761 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 20 states have (on average 1.4) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:30,763 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 23:48:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 23:48:30,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:30,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:30,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 20 states have (on average 1.4) internal successors, (28), 26 states have internal predecessors, (28), 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 27 states. [2022-02-20 23:48:30,765 INFO L87 Difference]: Start difference. First operand has 27 states, 20 states have (on average 1.4) internal successors, (28), 26 states have internal predecessors, (28), 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 27 states. [2022-02-20 23:48:30,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:30,767 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 23:48:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 23:48:30,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:30,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:30,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:30,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.4) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-02-20 23:48:30,773 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 3 [2022-02-20 23:48:30,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:30,773 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-02-20 23:48:30,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 23:48:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:48:30,774 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:30,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:30,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:48:30,775 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:48:30,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:30,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1991758487, now seen corresponding path program 1 times [2022-02-20 23:48:30,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:30,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444274669] [2022-02-20 23:48:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:30,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2); {302#true} is VALID [2022-02-20 23:48:30,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {304#(= |ULTIMATE.start_main_#t~malloc3#1.offset| 0)} is VALID [2022-02-20 23:48:30,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#(= |ULTIMATE.start_main_#t~malloc3#1.offset| 0)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L534 {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:48:30,880 INFO L290 TraceCheckUtils]: 3: Hoare triple {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:48:30,881 INFO L290 TraceCheckUtils]: 4: Hoare triple {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L535 {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:48:30,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:48:30,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:48:30,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} SUMMARY for call write~int(30, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L539 {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:48:30,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} SUMMARY for call main_#t~mem6#1 := read~int(main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L539-1 {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:48:30,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} assume !(25 > main_#t~mem6#1);havoc main_#t~mem6#1; {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:48:30,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {305#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L541-1 {306#(= |ULTIMATE.start_main_#t~mem7#1.offset| 0)} is VALID [2022-02-20 23:48:30,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#(= |ULTIMATE.start_main_#t~mem7#1.offset| 0)} assume !(0 == main_#t~mem7#1.offset); {303#false} is VALID [2022-02-20 23:48:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:30,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:30,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444274669] [2022-02-20 23:48:30,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444274669] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:30,884 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:30,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:30,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040214003] [2022-02-20 23:48:30,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:30,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:48:30,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:30,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:30,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:30,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:30,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:30,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:30,896 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:30,992 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 23:48:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:30,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:48:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-02-20 23:48:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-02-20 23:48:30,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-02-20 23:48:31,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:31,015 INFO L225 Difference]: With dead ends: 26 [2022-02-20 23:48:31,015 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 23:48:31,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:31,016 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:31,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 49 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:31,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 23:48:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 23:48:31,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:31,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,018 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,018 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,019 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 23:48:31,019 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 23:48:31,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:31,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:31,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 23:48:31,020 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 23:48:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,020 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 23:48:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 23:48:31,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:31,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:31,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:31,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-20 23:48:31,021 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 12 [2022-02-20 23:48:31,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:31,022 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-20 23:48:31,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 23:48:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:48:31,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:31,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:31,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:48:31,022 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:48:31,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:31,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1614971024, now seen corresponding path program 1 times [2022-02-20 23:48:31,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:31,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025499793] [2022-02-20 23:48:31,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:31,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:31,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {417#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2); {417#true} is VALID [2022-02-20 23:48:31,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {419#(<= (+ |ULTIMATE.start_main_#t~malloc3#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {419#(<= (+ |ULTIMATE.start_main_#t~malloc3#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L534 {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L535 {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call write~int(30, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L539 {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem6#1 := read~int(main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L539-1 {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} assume !(25 > main_#t~mem6#1);havoc main_#t~mem6#1; {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L541-1 {421#(<= (+ |ULTIMATE.start_main_#t~mem7#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {421#(<= (+ |ULTIMATE.start_main_#t~mem7#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem7#1.offset; {421#(<= (+ |ULTIMATE.start_main_#t~mem7#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#(<= (+ |ULTIMATE.start_main_#t~mem7#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem7#1.base < #StackHeapBarrier); {418#false} is VALID [2022-02-20 23:48:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:31,156 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:31,156 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025499793] [2022-02-20 23:48:31,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025499793] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:31,156 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:31,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:31,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943956089] [2022-02-20 23:48:31,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:31,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:48:31,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:31,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:31,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:31,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:31,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:31,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:31,169 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,293 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-20 23:48:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:31,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:48:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-02-20 23:48:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-02-20 23:48:31,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-02-20 23:48:31,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:31,317 INFO L225 Difference]: With dead ends: 25 [2022-02-20 23:48:31,317 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 23:48:31,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:31,318 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:31,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 23:48:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 23:48:31,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:31,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,333 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,333 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,334 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-20 23:48:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-20 23:48:31,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:31,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:31,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 23:48:31,336 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 23:48:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,337 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-20 23:48:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-20 23:48:31,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:31,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:31,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:31,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-02-20 23:48:31,342 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 13 [2022-02-20 23:48:31,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:31,343 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-02-20 23:48:31,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-20 23:48:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:48:31,344 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:31,344 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:31,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:48:31,344 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:48:31,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:31,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1475505735, now seen corresponding path program 1 times [2022-02-20 23:48:31,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:31,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292560506] [2022-02-20 23:48:31,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:31,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:31,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {528#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2); {528#true} is VALID [2022-02-20 23:48:31,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {528#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {530#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} is VALID [2022-02-20 23:48:31,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L534 {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:31,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:31,403 INFO L290 TraceCheckUtils]: 4: Hoare triple {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L535 {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:31,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:31,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:31,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} SUMMARY for call write~int(30, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L539 {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:31,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} SUMMARY for call main_#t~mem6#1 := read~int(main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L539-1 {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:31,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} assume !(25 > main_#t~mem6#1);havoc main_#t~mem6#1; {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:31,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {531#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L541-1 {532#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:48:31,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {532#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} assume 0 == main_#t~mem7#1.offset; {532#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:48:31,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {532#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} assume main_#t~mem7#1.base < #StackHeapBarrier; {532#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} is VALID [2022-02-20 23:48:31,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {532#(= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1)} assume !(0 == main_#t~mem7#1.base || 1 == #valid[main_#t~mem7#1.base]); {529#false} is VALID [2022-02-20 23:48:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:31,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:31,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292560506] [2022-02-20 23:48:31,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292560506] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:31,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:31,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:31,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129204369] [2022-02-20 23:48:31,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:31,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-02-20 23:48:31,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:31,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:31,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:31,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:31,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:31,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:31,419 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,505 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-20 23:48:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:31,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-02-20 23:48:31,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-02-20 23:48:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-02-20 23:48:31,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-02-20 23:48:31,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:31,544 INFO L225 Difference]: With dead ends: 24 [2022-02-20 23:48:31,544 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 23:48:31,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:31,544 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:31,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 40 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 23:48:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 23:48:31,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:31,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,554 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,554 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,554 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-20 23:48:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-20 23:48:31,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:31,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:31,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2022-02-20 23:48:31,555 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2022-02-20 23:48:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,555 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-20 23:48:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-20 23:48:31,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:31,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:31,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:31,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-02-20 23:48:31,556 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2022-02-20 23:48:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:31,556 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-02-20 23:48:31,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-20 23:48:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:48:31,557 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:31,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:31,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:48:31,557 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:48:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1503962546, now seen corresponding path program 1 times [2022-02-20 23:48:31,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:31,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127432016] [2022-02-20 23:48:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:31,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:31,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {635#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2); {635#true} is VALID [2022-02-20 23:48:31,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {635#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {637#(= |ULTIMATE.start_main_#t~malloc3#1.offset| 0)} is VALID [2022-02-20 23:48:31,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {637#(= |ULTIMATE.start_main_#t~malloc3#1.offset| 0)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L534 {638#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:48:31,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {638#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {638#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:48:31,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {638#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L535 {639#(= |ULTIMATE.start_main_#t~mem4#1.offset| 0)} is VALID [2022-02-20 23:48:31,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {639#(= |ULTIMATE.start_main_#t~mem4#1.offset| 0)} main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:48:31,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:48:31,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} SUMMARY for call write~int(30, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L539 {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:48:31,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} SUMMARY for call main_#t~mem6#1 := read~int(main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L539-1 {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:48:31,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} assume !(25 > main_#t~mem6#1);havoc main_#t~mem6#1; {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:48:31,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L541-1 {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:48:31,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} assume 0 == main_#t~mem7#1.offset; {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:48:31,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} assume main_#t~mem7#1.base < #StackHeapBarrier; {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:48:31,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} assume 0 == main_#t~mem7#1.base || 1 == #valid[main_#t~mem7#1.base];call ULTIMATE.dealloc(main_#t~mem7#1.base, main_#t~mem7#1.offset);havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} is VALID [2022-02-20 23:48:31,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {640#(= |ULTIMATE.start_main_~ptr~0#1.offset| 0)} assume !(0 == main_~ptr~0#1.offset); {636#false} is VALID [2022-02-20 23:48:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:31,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:31,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127432016] [2022-02-20 23:48:31,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127432016] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:31,614 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:31,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:31,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397347398] [2022-02-20 23:48:31,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:31,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-20 23:48:31,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:31,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,624 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-20 23:48:31,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:31,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:31,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:31,625 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,731 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-02-20 23:48:31,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:48:31,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-20 23:48:31,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2022-02-20 23:48:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2022-02-20 23:48:31,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2022-02-20 23:48:31,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:31,752 INFO L225 Difference]: With dead ends: 23 [2022-02-20 23:48:31,752 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 23:48:31,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:48:31,753 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:31,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 43 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:31,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 23:48:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 23:48:31,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:31,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,755 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,756 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,756 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-02-20 23:48:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-20 23:48:31,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:31,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:31,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 23:48:31,757 INFO L87 Difference]: Start difference. First operand has 23 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 23:48:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,758 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-02-20 23:48:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-20 23:48:31,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:31,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:31,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:31,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-02-20 23:48:31,759 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2022-02-20 23:48:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:31,759 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-02-20 23:48:31,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-20 23:48:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:48:31,760 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:31,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:31,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:48:31,761 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:48:31,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:31,761 INFO L85 PathProgramCache]: Analyzing trace with hash -621801253, now seen corresponding path program 1 times [2022-02-20 23:48:31,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:31,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706718945] [2022-02-20 23:48:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:31,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:31,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {741#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2); {741#true} is VALID [2022-02-20 23:48:31,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {741#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {743#(<= (+ |ULTIMATE.start_main_#t~malloc3#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#(<= (+ |ULTIMATE.start_main_#t~malloc3#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L534 {744#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {744#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {744#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {744#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L535 {745#(<= (+ |ULTIMATE.start_main_#t~mem4#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {745#(<= (+ |ULTIMATE.start_main_#t~mem4#1.base| 1) |#StackHeapBarrier|)} main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem4#1.base, main_#t~mem4#1.offset;havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~int(30, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L539 {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem6#1 := read~int(main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L539-1 {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} assume !(25 > main_#t~mem6#1);havoc main_#t~mem6#1; {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L541-1 {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem7#1.offset; {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} assume main_#t~mem7#1.base < #StackHeapBarrier; {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem7#1.base || 1 == #valid[main_#t~mem7#1.base];call ULTIMATE.dealloc(main_#t~mem7#1.base, main_#t~mem7#1.offset);havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~ptr~0#1.offset; {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:31,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {746#(<= (+ |ULTIMATE.start_main_~ptr~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~ptr~0#1.base < #StackHeapBarrier); {742#false} is VALID [2022-02-20 23:48:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:31,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:31,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706718945] [2022-02-20 23:48:31,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706718945] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:31,826 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:31,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:31,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965128870] [2022-02-20 23:48:31,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:31,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:48:31,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:31,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:31,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:31,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:31,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:31,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:31,838 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,963 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 23:48:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:48:31,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:48:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-02-20 23:48:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-02-20 23:48:31,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 24 transitions. [2022-02-20 23:48:31,985 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-20 23:48:31,986 INFO L225 Difference]: With dead ends: 22 [2022-02-20 23:48:31,987 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 23:48:31,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:48:31,989 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:31,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:31,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 23:48:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 23:48:31,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:31,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,997 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,997 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,999 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 23:48:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 23:48:32,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:32,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:32,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 23:48:32,000 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 23:48:32,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:32,001 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 23:48:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 23:48:32,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:32,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:32,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:32,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-02-20 23:48:32,005 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2022-02-20 23:48:32,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:32,005 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-02-20 23:48:32,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 23:48:32,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:48:32,006 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:32,006 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:32,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:48:32,007 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2022-02-20 23:48:32,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:32,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2095969580, now seen corresponding path program 1 times [2022-02-20 23:48:32,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:32,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719527647] [2022-02-20 23:48:32,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:32,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:48:32,036 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:48:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:48:32,071 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:48:32,071 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:48:32,072 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (20 of 21 remaining) [2022-02-20 23:48:32,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (19 of 21 remaining) [2022-02-20 23:48:32,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (18 of 21 remaining) [2022-02-20 23:48:32,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (17 of 21 remaining) [2022-02-20 23:48:32,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (16 of 21 remaining) [2022-02-20 23:48:32,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (15 of 21 remaining) [2022-02-20 23:48:32,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (14 of 21 remaining) [2022-02-20 23:48:32,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (13 of 21 remaining) [2022-02-20 23:48:32,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (12 of 21 remaining) [2022-02-20 23:48:32,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (11 of 21 remaining) [2022-02-20 23:48:32,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (10 of 21 remaining) [2022-02-20 23:48:32,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (9 of 21 remaining) [2022-02-20 23:48:32,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (8 of 21 remaining) [2022-02-20 23:48:32,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (7 of 21 remaining) [2022-02-20 23:48:32,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (6 of 21 remaining) [2022-02-20 23:48:32,076 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2022-02-20 23:48:32,076 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2022-02-20 23:48:32,076 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-02-20 23:48:32,076 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-02-20 23:48:32,076 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2022-02-20 23:48:32,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2022-02-20 23:48:32,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:48:32,079 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:32,082 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:48:32,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:48:32 BoogieIcfgContainer [2022-02-20 23:48:32,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:48:32,102 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:48:32,102 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:48:32,102 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:48:32,102 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:30" (3/4) ... [2022-02-20 23:48:32,103 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:48:32,131 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:48:32,131 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:48:32,132 INFO L158 Benchmark]: Toolchain (without parser) took 2873.52ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 70.3MB in the beginning and 90.3MB in the end (delta: -19.9MB). Peak memory consumption was 876.6kB. Max. memory is 16.1GB. [2022-02-20 23:48:32,133 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:32,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.40ms. Allocated memory is still 100.7MB. Free memory was 70.1MB in the beginning and 68.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:48:32,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.90ms. Allocated memory is still 100.7MB. Free memory was 68.2MB in the beginning and 66.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:48:32,134 INFO L158 Benchmark]: Boogie Preprocessor took 32.33ms. Allocated memory is still 100.7MB. Free memory was 66.1MB in the beginning and 64.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:48:32,134 INFO L158 Benchmark]: RCFGBuilder took 330.02ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 49.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 23:48:32,134 INFO L158 Benchmark]: TraceAbstraction took 2049.02ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 48.9MB in the beginning and 93.4MB in the end (delta: -44.5MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2022-02-20 23:48:32,134 INFO L158 Benchmark]: Witness Printer took 30.00ms. Allocated memory is still 121.6MB. Free memory was 93.4MB in the beginning and 90.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:48:32,140 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.19ms. Allocated memory is still 100.7MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.40ms. Allocated memory is still 100.7MB. Free memory was 70.1MB in the beginning and 68.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.90ms. Allocated memory is still 100.7MB. Free memory was 68.2MB in the beginning and 66.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.33ms. Allocated memory is still 100.7MB. Free memory was 66.1MB in the beginning and 64.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 330.02ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 49.7MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2049.02ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 48.9MB in the beginning and 93.4MB in the end (delta: -44.5MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * Witness Printer took 30.00ms. Allocated memory is still 121.6MB. Free memory was 93.4MB in the beginning and 90.3MB in the end (delta: 3.1MB). 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: 545]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L526-L533] union { void *p0; struct { char c[2]; int p1; int p2; } str; } data; [L534] data.p0 = malloc(37U) VAL [data={3:0}, malloc(37U)={-1:0}] [L535] EXPR data.p0 VAL [data={3:0}, data.p0={-1:0}] [L535] void *ptr = data.p0; [L536] COND FALSE !(__VERIFIER_nondet_int()) [L539] data.str.p2 = 30 VAL [data={3:0}, ptr={-1:0}] [L541] EXPR data.str.p2 VAL [data={3:0}, data.str.p2=30, ptr={-1:0}] [L541] COND FALSE !(25 > data.str.p2) [L544] EXPR data.p0 VAL [data={3:0}, data.p0={-1:0}, ptr={-1:0}] [L544] free(data.p0) VAL [data={3:0}, data.p0={-1:0}, ptr={-1:0}] [L544] free(data.p0) VAL [data={3:0}, data.p0={-1:0}, ptr={-1:0}] [L544] free(data.p0) [L545] free(ptr) VAL [data={3:0}, ptr={-1:0}] [L545] free(ptr) VAL [data={3:0}, ptr={-1:0}] [L545] free(ptr) VAL [data={3:0}, ptr={-1:0}] - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 524]: 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, 43 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 243 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223 IncrementalHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 113 mSDtfsCounter, 223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 40, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 387 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-20 23:48:32,193 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-free)