./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0158_1-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0158_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed9ad97c04e31259eb9462964e1ee9692abc78f6814573ccfff6d31784ab3b25 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:48:23,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:48:23,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:48:23,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:48:23,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:48:23,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:48:23,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:48:23,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:48:23,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:48:23,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:48:23,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:48:23,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:48:23,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:48:23,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:48:23,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:48:23,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:48:23,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:48:23,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:48:23,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:48:23,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:48:23,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:48:23,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:48:23,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:48:23,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:48:23,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:48:23,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:48:23,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:48:23,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:48:23,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:48:23,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:48:23,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:48:23,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:48:23,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:48:23,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:48:23,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:48:23,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:48:23,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:48:23,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:48:23,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:48:23,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:48:23,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:48:23,371 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:23,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:48:23,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:48:23,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:48:23,396 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:48:23,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:48:23,397 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:48:23,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:48:23,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:48:23,397 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:48:23,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:48:23,398 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:48:23,398 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:48:23,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:48:23,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:48:23,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:48:23,399 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:48:23,399 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:48:23,399 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:48:23,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:48:23,399 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:48:23,399 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:48:23,399 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:48:23,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:48:23,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:48:23,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:48:23,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:23,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:48:23,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:48:23,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:48:23,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:48:23,401 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 -> ed9ad97c04e31259eb9462964e1ee9692abc78f6814573ccfff6d31784ab3b25 [2022-02-20 23:48:23,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:48:23,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:48:23,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:48:23,674 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:48:23,675 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:48:23,677 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-1.i [2022-02-20 23:48:23,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80d268e5a/001f0f0a403741fbb829cf16b1448d97/FLAG412926cdb [2022-02-20 23:48:24,060 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:48:24,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0158_1-1.i [2022-02-20 23:48:24,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80d268e5a/001f0f0a403741fbb829cf16b1448d97/FLAG412926cdb [2022-02-20 23:48:24,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80d268e5a/001f0f0a403741fbb829cf16b1448d97 [2022-02-20 23:48:24,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:48:24,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:48:24,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:24,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:48:24,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:48:24,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:24" (1/1) ... [2022-02-20 23:48:24,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206efab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:24, skipping insertion in model container [2022-02-20 23:48:24,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:24" (1/1) ... [2022-02-20 23:48:24,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:48:24,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:24,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:24,714 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:48:24,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:24,759 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:48:24,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:24 WrapperNode [2022-02-20 23:48:24,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:24,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:24,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:48:24,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:48:24,766 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:24" (1/1) ... [2022-02-20 23:48:24,774 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:24" (1/1) ... [2022-02-20 23:48:24,791 INFO L137 Inliner]: procedures = 124, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2022-02-20 23:48:24,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:24,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:48:24,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:48:24,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:48:24,797 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:24" (1/1) ... [2022-02-20 23:48:24,797 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:24" (1/1) ... [2022-02-20 23:48:24,799 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:24" (1/1) ... [2022-02-20 23:48:24,799 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:24" (1/1) ... [2022-02-20 23:48:24,804 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:24" (1/1) ... [2022-02-20 23:48:24,805 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:24" (1/1) ... [2022-02-20 23:48:24,806 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:24" (1/1) ... [2022-02-20 23:48:24,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:48:24,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:48:24,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:48:24,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:48:24,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:24" (1/1) ... [2022-02-20 23:48:24,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:24,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:24,885 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:24,937 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:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:48:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:48:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:48:24,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:48:24,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:48:24,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:48:24,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:48:24,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:48:24,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:48:24,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:48:24,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:48:25,045 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:48:25,047 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:48:25,211 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:48:25,216 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:48:25,216 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:48:25,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:25 BoogieIcfgContainer [2022-02-20 23:48:25,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:48:25,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:48:25,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:48:25,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:48:25,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:48:24" (1/3) ... [2022-02-20 23:48:25,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4ff303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:25, skipping insertion in model container [2022-02-20 23:48:25,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:24" (2/3) ... [2022-02-20 23:48:25,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4ff303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:25, skipping insertion in model container [2022-02-20 23:48:25,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:25" (3/3) ... [2022-02-20 23:48:25,223 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0158_1-1.i [2022-02-20 23:48:25,226 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:48:25,226 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-02-20 23:48:25,253 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:48:25,257 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:25,258 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-02-20 23:48:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 16 states have (on average 2.125) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:48:25,273 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:25,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:48:25,274 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:48:25,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:48:25,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:25,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760602999] [2022-02-20 23:48:25,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:25,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:25,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#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); {36#true} is VALID [2022-02-20 23:48:25,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#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~nondet4#1, main_#t~mem5#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {38#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} is VALID [2022-02-20 23:48:25,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} assume !(1 == #valid[main_~#data~0#1.base]); {37#false} is VALID [2022-02-20 23:48:25,419 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:25,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:25,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760602999] [2022-02-20 23:48:25,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760602999] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:25,420 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:25,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:25,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972487135] [2022-02-20 23:48:25,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:25,426 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:25,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:25,428 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:25,434 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:25,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:25,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:25,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:25,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:25,457 INFO L87 Difference]: Start difference. First operand has 33 states, 16 states have (on average 2.125) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,533 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 23:48:25,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:25,533 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:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:25,534 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:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-02-20 23:48:25,537 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:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-02-20 23:48:25,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-02-20 23:48:25,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:25,571 INFO L225 Difference]: With dead ends: 27 [2022-02-20 23:48:25,572 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 23:48:25,573 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:25,575 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:25,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 15 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 23:48:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 23:48:25,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:25,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.7333333333333334) 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:25,593 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.7333333333333334) 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:25,593 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.7333333333333334) 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:25,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,595 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-20 23:48:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-20 23:48:25,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:25,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:25,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.7333333333333334) 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:25,596 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.7333333333333334) 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:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,598 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-20 23:48:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-20 23:48:25,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:25,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:25,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:25,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.7333333333333334) 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:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-02-20 23:48:25,601 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 3 [2022-02-20 23:48:25,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:25,601 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-02-20 23:48:25,602 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:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-20 23:48:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:48:25,602 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:25,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:48:25,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:48:25,603 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:48:25,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:25,603 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:48:25,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:25,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038443321] [2022-02-20 23:48:25,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:25,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:25,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {143#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); {143#true} is VALID [2022-02-20 23:48:25,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#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~nondet4#1, main_#t~mem5#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {145#(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:25,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {145#(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); {144#false} is VALID [2022-02-20 23:48:25,643 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:25,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:25,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038443321] [2022-02-20 23:48:25,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038443321] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:25,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:25,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:25,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720422324] [2022-02-20 23:48:25,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:25,645 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:25,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:25,646 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:25,649 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:25,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:25,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:25,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:25,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:25,650 INFO L87 Difference]: Start difference. First operand 25 states and 26 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:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,683 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:48:25,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:25,684 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:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:25,684 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:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-20 23:48:25,685 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:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-20 23:48:25,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-02-20 23:48:25,707 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:25,707 INFO L225 Difference]: With dead ends: 19 [2022-02-20 23:48:25,707 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 23:48:25,708 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:25,709 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:25,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 14 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 23:48:25,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 23:48:25,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:25,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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:25,711 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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:25,712 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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:25,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,713 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:48:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:48:25,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:25,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:25,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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 19 states. [2022-02-20 23:48:25,714 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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 19 states. [2022-02-20 23:48:25,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,715 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:48:25,715 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:48:25,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:25,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:25,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:25,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-02-20 23:48:25,717 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 3 [2022-02-20 23:48:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:25,717 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-02-20 23:48:25,717 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:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:48:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:48:25,718 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:25,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:25,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:48:25,718 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:48:25,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:25,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1114117972, now seen corresponding path program 1 times [2022-02-20 23:48:25,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:25,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984228117] [2022-02-20 23:48:25,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:25,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:25,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2); {224#true} is VALID [2022-02-20 23:48:25,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {226#(= |ULTIMATE.start_main_#t~malloc3#1.offset| 0)} is VALID [2022-02-20 23:48:25,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#(= |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 {227#(= (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:25,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {227#(= (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;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {227#(= (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:25,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {227#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1; {227#(= (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:25,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#(= (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(20, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L536 {227#(= (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:25,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#(= (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~mem5#1 := read~int(main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L538-1 {227#(= (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:25,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} assume !(20 > main_#t~mem5#1);havoc main_#t~mem5#1; {227#(= (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:25,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {227#(= (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.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L540-1 {228#(= |ULTIMATE.start_main_#t~mem6#1.offset| 0)} is VALID [2022-02-20 23:48:25,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#(= |ULTIMATE.start_main_#t~mem6#1.offset| 0)} assume !(0 == main_#t~mem6#1.offset); {225#false} is VALID [2022-02-20 23:48:25,818 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:25,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:25,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984228117] [2022-02-20 23:48:25,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984228117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:25,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:25,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:25,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299755163] [2022-02-20 23:48:25,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:25,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:48:25,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:25,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:25,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:25,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:25,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:25,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:25,840 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,928 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 23:48:25,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:25,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:48:25,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-02-20 23:48:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-02-20 23:48:25,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-02-20 23:48:25,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:25,967 INFO L225 Difference]: With dead ends: 18 [2022-02-20 23:48:25,968 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 23:48:25,968 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:25,969 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:25,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 23:48:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 23:48:25,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:25,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 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:25,975 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 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:25,976 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 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:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,978 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 23:48:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 23:48:25,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:25,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:25,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 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 18 states. [2022-02-20 23:48:25,979 INFO L87 Difference]: Start difference. First operand has 18 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 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 18 states. [2022-02-20 23:48:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,983 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 23:48:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 23:48:25,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:25,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:25,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:25,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 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:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-20 23:48:25,986 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2022-02-20 23:48:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:25,986 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-20 23:48:25,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 23:48:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:48:25,987 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:25,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:25,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:48:25,988 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:48:25,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 177918831, now seen corresponding path program 1 times [2022-02-20 23:48:25,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:25,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204608933] [2022-02-20 23:48:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:26,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#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); {307#true} is VALID [2022-02-20 23:48:26,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#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~nondet4#1, main_#t~mem5#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {309#(<= (+ |ULTIMATE.start_main_#t~malloc3#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:26,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#(<= (+ |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 {310#(<= (+ (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:26,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {310#(<= (+ (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;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {310#(<= (+ (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:26,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {310#(<= (+ (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~nondet4#1;havoc main_#t~nondet4#1; {310#(<= (+ (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:26,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#(<= (+ (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(20, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L536 {310#(<= (+ (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:26,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {310#(<= (+ (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~mem5#1 := read~int(main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L538-1 {310#(<= (+ (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:26,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {310#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} assume !(20 > main_#t~mem5#1);havoc main_#t~mem5#1; {310#(<= (+ (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:26,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#(<= (+ (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.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L540-1 {311#(<= (+ |ULTIMATE.start_main_#t~mem6#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:26,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#(<= (+ |ULTIMATE.start_main_#t~mem6#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem6#1.offset; {311#(<= (+ |ULTIMATE.start_main_#t~mem6#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:26,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {311#(<= (+ |ULTIMATE.start_main_#t~mem6#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem6#1.base < #StackHeapBarrier); {308#false} is VALID [2022-02-20 23:48:26,072 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:26,072 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:26,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204608933] [2022-02-20 23:48:26,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204608933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:26,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:26,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:26,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464874268] [2022-02-20 23:48:26,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:26,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:48:26,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:26,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:26,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:26,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:26,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:26,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:26,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:26,085 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,186 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-02-20 23:48:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:26,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:48:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-02-20 23:48:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-02-20 23:48:26,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 19 transitions. [2022-02-20 23:48:26,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:26,208 INFO L225 Difference]: With dead ends: 17 [2022-02-20 23:48:26,209 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 23:48:26,209 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:26,216 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:26,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 22 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 23:48:26,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 23:48:26,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:26,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 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:26,220 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 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:26,220 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 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:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,223 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-02-20 23:48:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-20 23:48:26,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:26,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:26,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 23:48:26,224 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 23:48:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,225 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-02-20 23:48:26,225 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-20 23:48:26,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:26,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:26,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:26,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 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:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-02-20 23:48:26,227 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2022-02-20 23:48:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:26,228 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-02-20 23:48:26,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-20 23:48:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:48:26,228 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:26,228 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:26,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:48:26,229 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:48:26,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:26,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1220516534, now seen corresponding path program 1 times [2022-02-20 23:48:26,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:26,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846424528] [2022-02-20 23:48:26,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:26,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:26,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {386#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); {386#true} is VALID [2022-02-20 23:48:26,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#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~nondet4#1, main_#t~mem5#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {388#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} is VALID [2022-02-20 23:48:26,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {388#(= (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 {389#(= (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:26,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {389#(= (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;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {389#(= (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:26,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {389#(= (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~nondet4#1;havoc main_#t~nondet4#1; {389#(= (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:26,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {389#(= (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(20, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L536 {389#(= (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:26,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {389#(= (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~mem5#1 := read~int(main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L538-1 {389#(= (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:26,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {389#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} assume !(20 > main_#t~mem5#1);havoc main_#t~mem5#1; {389#(= (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:26,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {389#(= (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.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L540-1 {390#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:48:26,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {390#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} assume 0 == main_#t~mem6#1.offset; {390#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:48:26,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {390#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} assume main_#t~mem6#1.base < #StackHeapBarrier; {390#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:48:26,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {390#(= (select |#valid| |ULTIMATE.start_main_#t~mem6#1.base|) 1)} assume !(0 == main_#t~mem6#1.base || 1 == #valid[main_#t~mem6#1.base]); {387#false} is VALID [2022-02-20 23:48:26,295 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:26,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:26,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846424528] [2022-02-20 23:48:26,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846424528] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:26,295 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:26,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:26,296 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128792919] [2022-02-20 23:48:26,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:26,296 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:26,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:26,296 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:26,306 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:26,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:26,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:26,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:26,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:26,307 INFO L87 Difference]: Start difference. First operand 17 states and 18 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:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,386 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 23:48:26,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:26,387 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:26,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:26,387 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:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-02-20 23:48:26,388 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:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-02-20 23:48:26,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-02-20 23:48:26,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:26,405 INFO L225 Difference]: With dead ends: 16 [2022-02-20 23:48:26,405 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 23:48:26,406 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:26,406 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:26,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 23:48:26,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 23:48:26,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:26,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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:26,408 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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:26,408 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,409 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 23:48:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 23:48:26,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:26,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:26,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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 16 states. [2022-02-20 23:48:26,410 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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 16 states. [2022-02-20 23:48:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,411 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 23:48:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 23:48:26,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:26,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:26,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:26,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-02-20 23:48:26,412 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-02-20 23:48:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:26,413 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-02-20 23:48:26,413 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:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 23:48:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:48:26,413 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:26,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:26,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:48:26,414 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 12 more)] === [2022-02-20 23:48:26,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash -818693038, now seen corresponding path program 1 times [2022-02-20 23:48:26,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:26,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481040264] [2022-02-20 23:48:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:26,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#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); {461#true} is VALID [2022-02-20 23:48:26,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#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~nondet4#1, main_#t~mem5#1, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(10);call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(37); {463#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (or (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~malloc3#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:26,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {463#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (or (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~malloc3#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L534 {464#(or (<= (+ |#StackHeapBarrier| 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|)))} is VALID [2022-02-20 23:48:26,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {464#(or (<= (+ |#StackHeapBarrier| 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|)))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {464#(or (<= (+ |#StackHeapBarrier| 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|)))} is VALID [2022-02-20 23:48:26,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {464#(or (<= (+ |#StackHeapBarrier| 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|)))} assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1; {464#(or (<= (+ |#StackHeapBarrier| 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|)))} is VALID [2022-02-20 23:48:26,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {464#(or (<= (+ |#StackHeapBarrier| 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|)))} SUMMARY for call write~int(20, main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L536 {464#(or (<= (+ |#StackHeapBarrier| 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|)))} is VALID [2022-02-20 23:48:26,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(or (<= (+ |#StackHeapBarrier| 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|)))} SUMMARY for call main_#t~mem5#1 := read~int(main_~#data~0#1.base, 6 + main_~#data~0#1.offset, 4); srcloc: L538-1 {464#(or (<= (+ |#StackHeapBarrier| 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|)))} is VALID [2022-02-20 23:48:26,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {464#(or (<= (+ |#StackHeapBarrier| 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|)))} assume !(20 > main_#t~mem5#1);havoc main_#t~mem5#1; {464#(or (<= (+ |#StackHeapBarrier| 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|)))} is VALID [2022-02-20 23:48:26,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {464#(or (<= (+ |#StackHeapBarrier| 1) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0) |ULTIMATE.start_main_old_#valid#1|)))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4); srcloc: L540-1 {465#(or (and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~mem6#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~mem6#1.base| |ULTIMATE.start_main_~#data~0#1.base|))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_#t~mem6#1.base|))} is VALID [2022-02-20 23:48:26,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {465#(or (and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~mem6#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~mem6#1.base| |ULTIMATE.start_main_~#data~0#1.base|))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_#t~mem6#1.base|))} assume 0 == main_#t~mem6#1.offset; {465#(or (and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~mem6#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~mem6#1.base| |ULTIMATE.start_main_~#data~0#1.base|))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_#t~mem6#1.base|))} is VALID [2022-02-20 23:48:26,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {465#(or (and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~mem6#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~mem6#1.base| |ULTIMATE.start_main_~#data~0#1.base|))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_#t~mem6#1.base|))} assume main_#t~mem6#1.base < #StackHeapBarrier; {466#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~mem6#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~mem6#1.base| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:26,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {466#(and (= (store (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_#t~mem6#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_#t~mem6#1.base| |ULTIMATE.start_main_~#data~0#1.base|)))} assume 0 == main_#t~mem6#1.base || 1 == #valid[main_#t~mem6#1.base];call ULTIMATE.dealloc(main_#t~mem6#1.base, main_#t~mem6#1.offset);havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;main_#res#1 := 0;call ULTIMATE.dealloc(main_~#data~0#1.base, main_~#data~0#1.offset);havoc main_~#data~0#1.base, main_~#data~0#1.offset; {467#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:26,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {462#false} is VALID [2022-02-20 23:48:26,609 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:26,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:26,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481040264] [2022-02-20 23:48:26,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481040264] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:26,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:26,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:48:26,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386043756] [2022-02-20 23:48:26,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:26,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:26,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:26,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:26,638 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:26,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:48:26,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:26,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:48:26,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:26,639 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,823 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 23:48:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:48:26,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2022-02-20 23:48:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2022-02-20 23:48:26,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 17 transitions. [2022-02-20 23:48:26,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:26,842 INFO L225 Difference]: With dead ends: 15 [2022-02-20 23:48:26,842 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 23:48:26,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:48:26,843 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:26,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 23:48:26,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 23:48:26,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:26,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:26,844 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:26,844 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,844 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:48:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:48:26,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:26,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:26,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 23:48:26,845 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 23:48:26,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,845 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:48:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:48:26,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:26,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:26,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:26,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:26,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 23:48:26,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-02-20 23:48:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:26,845 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 23:48:26,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:26,846 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:48:26,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:26,847 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION (15 of 16 remaining) [2022-02-20 23:48:26,848 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (14 of 16 remaining) [2022-02-20 23:48:26,848 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (13 of 16 remaining) [2022-02-20 23:48:26,849 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION (12 of 16 remaining) [2022-02-20 23:48:26,849 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION (11 of 16 remaining) [2022-02-20 23:48:26,849 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION (10 of 16 remaining) [2022-02-20 23:48:26,849 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATION (9 of 16 remaining) [2022-02-20 23:48:26,849 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION (8 of 16 remaining) [2022-02-20 23:48:26,849 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATION (7 of 16 remaining) [2022-02-20 23:48:26,849 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATION (6 of 16 remaining) [2022-02-20 23:48:26,850 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION (5 of 16 remaining) [2022-02-20 23:48:26,850 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATION (4 of 16 remaining) [2022-02-20 23:48:26,850 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (3 of 16 remaining) [2022-02-20 23:48:26,850 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (2 of 16 remaining) [2022-02-20 23:48:26,850 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (1 of 16 remaining) [2022-02-20 23:48:26,850 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-02-20 23:48:26,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:48:26,865 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 23:48:26,866 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:48:26,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:48:26 BoogieIcfgContainer [2022-02-20 23:48:26,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:48:26,868 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:48:26,868 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:48:26,868 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:48:26,869 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:25" (3/4) ... [2022-02-20 23:48:26,871 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 23:48:26,877 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 23:48:26,877 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 23:48:26,877 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-20 23:48:26,877 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 23:48:26,896 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:48:26,896 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:48:26,897 INFO L158 Benchmark]: Toolchain (without parser) took 2433.75ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 64.8MB in the beginning and 96.4MB in the end (delta: -31.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:26,897 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory was 82.0MB in the beginning and 81.9MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:26,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.99ms. Allocated memory is still 102.8MB. Free memory was 64.6MB in the beginning and 70.0MB in the end (delta: -5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:48:26,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.29ms. Allocated memory is still 102.8MB. Free memory was 70.0MB in the beginning and 67.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:48:26,898 INFO L158 Benchmark]: Boogie Preprocessor took 32.37ms. Allocated memory is still 102.8MB. Free memory was 67.9MB in the beginning and 66.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:48:26,898 INFO L158 Benchmark]: RCFGBuilder took 392.78ms. Allocated memory is still 102.8MB. Free memory was 66.5MB in the beginning and 52.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 23:48:26,898 INFO L158 Benchmark]: TraceAbstraction took 1649.70ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 52.1MB in the beginning and 98.5MB in the end (delta: -46.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2022-02-20 23:48:26,898 INFO L158 Benchmark]: Witness Printer took 28.07ms. Allocated memory is still 123.7MB. Free memory was 98.5MB in the beginning and 96.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:26,899 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.16ms. Allocated memory is still 102.8MB. Free memory was 82.0MB in the beginning and 81.9MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.99ms. Allocated memory is still 102.8MB. Free memory was 64.6MB in the beginning and 70.0MB in the end (delta: -5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.29ms. Allocated memory is still 102.8MB. Free memory was 70.0MB in the beginning and 67.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.37ms. Allocated memory is still 102.8MB. Free memory was 67.9MB in the beginning and 66.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 392.78ms. Allocated memory is still 102.8MB. Free memory was 66.5MB in the beginning and 52.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1649.70ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 52.1MB in the beginning and 98.5MB in the end (delta: -46.4MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * Witness Printer took 28.07ms. Allocated memory is still 123.7MB. Free memory was 98.5MB in the beginning and 96.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 536]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 538]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 538]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 543]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 543]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 524]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 159 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 64 mSDtfsCounter, 159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 23:48:26,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE