./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0019-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0019-2.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 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:44:30,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:44:30,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:44:30,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:44:30,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:44:30,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:44:30,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:44:30,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:44:30,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:44:30,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:44:30,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:44:30,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:44:30,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:44:30,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:44:30,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:44:30,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:44:30,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:44:30,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:44:30,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:44:30,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:44:30,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:44:30,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:44:30,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:44:30,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:44:30,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:44:30,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:44:30,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:44:30,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:44:30,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:44:30,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:44:30,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:44:30,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:44:30,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:44:30,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:44:30,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:44:30,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:44:30,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:44:30,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:44:30,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:44:30,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:44:30,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:44:30,638 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:44:30,667 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:44:30,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:44:30,668 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:44:30,668 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:44:30,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:44:30,669 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:44:30,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:44:30,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:44:30,670 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:44:30,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:44:30,671 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:44:30,671 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:44:30,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:44:30,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:44:30,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:44:30,671 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:44:30,672 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:44:30,672 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:44:30,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:44:30,672 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:44:30,672 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:44:30,673 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:44:30,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:44:30,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:44:30,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:44:30,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:30,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:44:30,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:44:30,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:44:30,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:44:30,675 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 -> 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad [2022-02-20 23:44:30,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:44:30,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:44:30,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:44:30,946 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:44:30,946 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:44:30,947 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2022-02-20 23:44:31,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ede94fa1/58fc495af00a41b0aa501b11264cecdc/FLAG44d2ba62f [2022-02-20 23:44:31,452 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:44:31,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2022-02-20 23:44:31,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ede94fa1/58fc495af00a41b0aa501b11264cecdc/FLAG44d2ba62f [2022-02-20 23:44:31,790 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ede94fa1/58fc495af00a41b0aa501b11264cecdc [2022-02-20 23:44:31,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:44:31,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:44:31,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:31,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:44:31,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:44:31,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:31" (1/1) ... [2022-02-20 23:44:31,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50fb5b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:31, skipping insertion in model container [2022-02-20 23:44:31,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:31" (1/1) ... [2022-02-20 23:44:31,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:44:31,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:44:32,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:32,138 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:44:32,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:32,226 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:44:32,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:32 WrapperNode [2022-02-20 23:44:32,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:32,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:32,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:44:32,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:44:32,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:32" (1/1) ... [2022-02-20 23:44:32,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:32" (1/1) ... [2022-02-20 23:44:32,289 INFO L137 Inliner]: procedures = 125, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2022-02-20 23:44:32,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:32,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:44:32,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:44:32,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:44:32,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:32" (1/1) ... [2022-02-20 23:44:32,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:32" (1/1) ... [2022-02-20 23:44:32,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:32" (1/1) ... [2022-02-20 23:44:32,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:32" (1/1) ... [2022-02-20 23:44:32,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:32" (1/1) ... [2022-02-20 23:44:32,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:32" (1/1) ... [2022-02-20 23:44:32,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:32" (1/1) ... [2022-02-20 23:44:32,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:44:32,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:44:32,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:44:32,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:44:32,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:32" (1/1) ... [2022-02-20 23:44:32,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:32,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:32,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:44:32,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:44:32,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:44:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:44:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:44:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:44:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:44:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:44:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:44:32,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:44:32,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:44:32,472 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:44:32,473 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:44:32,716 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:44:32,722 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:44:32,735 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:44:32,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:32 BoogieIcfgContainer [2022-02-20 23:44:32,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:44:32,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:44:32,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:44:32,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:44:32,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:44:31" (1/3) ... [2022-02-20 23:44:32,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a558c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:32, skipping insertion in model container [2022-02-20 23:44:32,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:32" (2/3) ... [2022-02-20 23:44:32,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a558c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:32, skipping insertion in model container [2022-02-20 23:44:32,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:32" (3/3) ... [2022-02-20 23:44:32,743 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2022-02-20 23:44:32,747 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:44:32,748 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2022-02-20 23:44:32,813 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:44:32,820 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:44:32,820 INFO L340 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2022-02-20 23:44:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:32,841 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:32,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:32,842 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:32,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:44:32,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:32,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587822931] [2022-02-20 23:44:32,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:32,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:33,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {46#true} is VALID [2022-02-20 23:44:33,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {48#(= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1)} is VALID [2022-02-20 23:44:33,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#(= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1)} assume !(1 == #valid[alloc_data_~pdata#1.base]); {47#false} is VALID [2022-02-20 23:44:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:33,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:33,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587822931] [2022-02-20 23:44:33,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587822931] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:33,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:33,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:33,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308924672] [2022-02-20 23:44:33,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:33,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:33,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:33,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:33,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:33,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:33,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:33,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:33,124 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,226 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-02-20 23:44:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:33,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 23:44:33,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 23:44:33,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-02-20 23:44:33,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:33,291 INFO L225 Difference]: With dead ends: 48 [2022-02-20 23:44:33,291 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 23:44:33,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:33,296 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:33,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:33,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 23:44:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-02-20 23:44:33,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:33,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,321 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,322 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,325 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-02-20 23:44:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-02-20 23:44:33,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:33,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:33,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 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 46 states. [2022-02-20 23:44:33,327 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 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 46 states. [2022-02-20 23:44:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,330 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-02-20 23:44:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-02-20 23:44:33,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:33,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:33,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:33,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:33,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-02-20 23:44:33,334 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 3 [2022-02-20 23:44:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:33,334 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-02-20 23:44:33,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-02-20 23:44:33,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:33,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:33,336 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:33,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:44:33,336 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:33,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:33,337 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:44:33,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:33,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307940314] [2022-02-20 23:44:33,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:33,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:33,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {230#true} is VALID [2022-02-20 23:44:33,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {232#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)))} is VALID [2022-02-20 23:44:33,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)))} assume !(4 + alloc_data_~pdata#1.offset <= #length[alloc_data_~pdata#1.base] && 0 <= alloc_data_~pdata#1.offset); {231#false} is VALID [2022-02-20 23:44:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:33,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:33,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307940314] [2022-02-20 23:44:33,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307940314] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:33,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:33,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:33,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094520227] [2022-02-20 23:44:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:33,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:33,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:33,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:33,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:33,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:33,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:33,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:33,425 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,516 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-02-20 23:44:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:33,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-02-20 23:44:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-02-20 23:44:33,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-02-20 23:44:33,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:33,561 INFO L225 Difference]: With dead ends: 38 [2022-02-20 23:44:33,561 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 23:44:33,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:33,565 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:33,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 23:44:33,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 23:44:33,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:33,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,575 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,576 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,579 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-02-20 23:44:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-02-20 23:44:33,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:33,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:33,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 states. [2022-02-20 23:44:33,581 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 states. [2022-02-20 23:44:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,587 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-02-20 23:44:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-02-20 23:44:33,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:33,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:33,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:33,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-02-20 23:44:33,591 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 3 [2022-02-20 23:44:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:33,592 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-02-20 23:44:33,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-02-20 23:44:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:44:33,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:33,593 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:44:33,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:44:33,593 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:33,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:33,594 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-02-20 23:44:33,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:33,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658887782] [2022-02-20 23:44:33,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:33,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:33,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {387#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {387#true} is VALID [2022-02-20 23:44:33,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {387#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {389#(and (<= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0))} is VALID [2022-02-20 23:44:33,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#(and (<= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {390#(and (<= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1))} is VALID [2022-02-20 23:44:33,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {390#(and (<= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {389#(and (<= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0))} is VALID [2022-02-20 23:44:33,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {389#(and (<= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0))} assume !(4 + (4 + alloc_data_~pdata#1.offset) <= #length[alloc_data_~pdata#1.base] && 0 <= 4 + alloc_data_~pdata#1.offset); {388#false} is VALID [2022-02-20 23:44:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:33,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:33,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658887782] [2022-02-20 23:44:33,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658887782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:33,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:33,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:44:33,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064008816] [2022-02-20 23:44:33,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:33,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:44:33,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:33,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:33,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:44:33,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:33,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:44:33,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:33,699 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,817 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:44:33,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:44:33,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:44:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 23:44:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 23:44:33,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-02-20 23:44:33,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:33,865 INFO L225 Difference]: With dead ends: 44 [2022-02-20 23:44:33,865 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 23:44:33,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:33,866 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:33,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 23 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 23:44:33,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-02-20 23:44:33,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:33,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,870 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,870 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,872 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:44:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-02-20 23:44:33,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:33,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:33,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 44 states. [2022-02-20 23:44:33,873 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 44 states. [2022-02-20 23:44:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:33,874 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:44:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-02-20 23:44:33,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:33,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:33,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:33,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-02-20 23:44:33,877 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 5 [2022-02-20 23:44:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:33,877 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-02-20 23:44:33,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-02-20 23:44:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:33,878 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:33,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:33,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:44:33,879 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:33,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:33,879 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2022-02-20 23:44:33,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:33,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377839467] [2022-02-20 23:44:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:33,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:33,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {562#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {562#true} is VALID [2022-02-20 23:44:33,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {562#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {564#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:44:33,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {564#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {564#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:44:33,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {564#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {564#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:44:33,947 INFO L290 TraceCheckUtils]: 4: Hoare triple {564#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {565#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} is VALID [2022-02-20 23:44:33,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {565#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {565#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} is VALID [2022-02-20 23:44:33,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {565#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1)} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {566#(= (select |#valid| |ULTIMATE.start_free_data_~data#1.base|) 1)} is VALID [2022-02-20 23:44:33,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {566#(= (select |#valid| |ULTIMATE.start_free_data_~data#1.base|) 1)} assume !(1 == #valid[free_data_~data#1.base]); {563#false} is VALID [2022-02-20 23:44:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:33,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:33,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377839467] [2022-02-20 23:44:33,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377839467] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:33,950 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:33,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:44:33,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599501758] [2022-02-20 23:44:33,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:33,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:33,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:33,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:33,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:33,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:44:33,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:33,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:44:33,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:33,961 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,128 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-02-20 23:44:34,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:44:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-02-20 23:44:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-02-20 23:44:34,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-02-20 23:44:34,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:34,181 INFO L225 Difference]: With dead ends: 39 [2022-02-20 23:44:34,181 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 23:44:34,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:44:34,188 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 69 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:34,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 31 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:34,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 23:44:34,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-02-20 23:44:34,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:34,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,197 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,198 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,199 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-02-20 23:44:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-02-20 23:44:34,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:34,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:34,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 23:44:34,200 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 23:44:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,203 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-02-20 23:44:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-02-20 23:44:34,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:34,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:34,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:34,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-02-20 23:44:34,206 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2022-02-20 23:44:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:34,206 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-02-20 23:44:34,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-02-20 23:44:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:34,209 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:34,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:34,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:44:34,210 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:34,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2022-02-20 23:44:34,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:34,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636265782] [2022-02-20 23:44:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:34,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:34,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {727#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {727#true} is VALID [2022-02-20 23:44:34,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {727#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {729#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} is VALID [2022-02-20 23:44:34,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {729#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {729#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} is VALID [2022-02-20 23:44:34,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {729#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {729#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} is VALID [2022-02-20 23:44:34,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {729#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| 0) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {730#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:34,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {730#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {730#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:34,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {730#(and (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {731#(and (= 0 |ULTIMATE.start_free_data_~data#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_free_data_~data#1.base|)))} is VALID [2022-02-20 23:44:34,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#(and (= 0 |ULTIMATE.start_free_data_~data#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_free_data_~data#1.base|)))} assume !(4 + free_data_~data#1.offset <= #length[free_data_~data#1.base] && 0 <= free_data_~data#1.offset); {728#false} is VALID [2022-02-20 23:44:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:34,323 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:34,323 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636265782] [2022-02-20 23:44:34,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636265782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:34,323 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:34,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:44:34,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3991009] [2022-02-20 23:44:34,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:34,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:34,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:34,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:34,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:44:34,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:34,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:44:34,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:34,337 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,466 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:44:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:44:34,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-02-20 23:44:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-02-20 23:44:34,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2022-02-20 23:44:34,505 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:44:34,506 INFO L225 Difference]: With dead ends: 31 [2022-02-20 23:44:34,506 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 23:44:34,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:44:34,506 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:34,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 24 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 23:44:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 23:44:34,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:34,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,509 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,509 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,510 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:44:34,510 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:44:34,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:34,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:34,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-20 23:44:34,511 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-20 23:44:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,512 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:44:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:44:34,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:34,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:34,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:34,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-02-20 23:44:34,514 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 8 [2022-02-20 23:44:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:34,514 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-02-20 23:44:34,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:44:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:44:34,515 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:34,515 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:34,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:44:34,516 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash 406185098, now seen corresponding path program 1 times [2022-02-20 23:44:34,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:34,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935254323] [2022-02-20 23:44:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:34,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {862#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {862#true} is VALID [2022-02-20 23:44:34,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {862#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {864#(and (= |ULTIMATE.start_alloc_data_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:34,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {864#(and (= |ULTIMATE.start_alloc_data_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {865#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:34,633 INFO L290 TraceCheckUtils]: 3: Hoare triple {865#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {865#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:34,634 INFO L290 TraceCheckUtils]: 4: Hoare triple {865#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 0) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {866#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:44:34,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {866#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} is VALID [2022-02-20 23:44:34,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {866#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 0)} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {867#(= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|))} is VALID [2022-02-20 23:44:34,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {867#(= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|))} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~data#1.base, free_data_~data#1.offset, 4); srcloc: L534 {868#(= |ULTIMATE.start_free_data_#t~mem5#1.offset| 0)} is VALID [2022-02-20 23:44:34,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {868#(= |ULTIMATE.start_free_data_#t~mem5#1.offset| 0)} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {869#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} is VALID [2022-02-20 23:44:34,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {869#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~data#1.base, 4 + free_data_~data#1.offset, 4); srcloc: L535 {869#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} is VALID [2022-02-20 23:44:34,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {869#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {869#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} is VALID [2022-02-20 23:44:34,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {869#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} assume free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset; {869#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} is VALID [2022-02-20 23:44:34,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {869#(= |ULTIMATE.start_free_data_~lo~0#1.offset| 0)} assume !(0 == free_data_~lo~0#1.offset); {863#false} is VALID [2022-02-20 23:44:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:34,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:34,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935254323] [2022-02-20 23:44:34,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935254323] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:34,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:34,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:44:34,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105993018] [2022-02-20 23:44:34,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:34,640 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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:44:34,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:34,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:34,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:44:34,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:34,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:44:34,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:44:34,653 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,876 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 23:44:34,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:44:34,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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:44:34,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-02-20 23:44:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-02-20 23:44:34,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 30 transitions. [2022-02-20 23:44:34,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:34,910 INFO L225 Difference]: With dead ends: 30 [2022-02-20 23:44:34,910 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 23:44:34,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:44:34,911 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 53 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:34,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 58 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:34,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 23:44:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 23:44:34,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:34,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,913 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,913 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,914 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 23:44:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-02-20 23:44:34,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:34,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:34,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 23:44:34,917 INFO L87 Difference]: Start difference. First operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 23:44:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:34,917 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 23:44:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-02-20 23:44:34,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:34,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:34,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:34,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-02-20 23:44:34,919 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 13 [2022-02-20 23:44:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:34,919 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-02-20 23:44:34,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-02-20 23:44:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:44:34,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:34,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:34,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:44:34,920 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:34,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash -293163793, now seen corresponding path program 1 times [2022-02-20 23:44:34,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:34,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690370557] [2022-02-20 23:44:34,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:34,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:35,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {1002#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {1002#true} is VALID [2022-02-20 23:44:35,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {1002#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {1004#(and (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ |ULTIMATE.start_alloc_data_#t~malloc3#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:44:35,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {1004#(and (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ |ULTIMATE.start_alloc_data_#t~malloc3#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {1005#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:35,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {1005#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {1005#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:35,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {1005#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {1006#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:35,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {1006#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1006#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:35,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {1006#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) 1) |#StackHeapBarrier|)} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {1007#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:35,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {1007#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~data#1.base, free_data_~data#1.offset, 4); srcloc: L534 {1008#(<= (+ 1 |ULTIMATE.start_free_data_#t~mem5#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:35,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {1008#(<= (+ 1 |ULTIMATE.start_free_data_#t~mem5#1.base|) |#StackHeapBarrier|)} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {1009#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:35,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {1009#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~data#1.base, 4 + free_data_~data#1.offset, 4); srcloc: L535 {1009#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:35,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {1009#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {1009#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:35,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {1009#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} assume free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset; {1009#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:35,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {1009#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == free_data_~lo~0#1.offset; {1009#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:35,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {1009#(<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|)} assume !(free_data_~lo~0#1.base < #StackHeapBarrier); {1003#false} is VALID [2022-02-20 23:44:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:35,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:35,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690370557] [2022-02-20 23:44:35,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690370557] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:35,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:35,045 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:44:35,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475890810] [2022-02-20 23:44:35,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:35,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:44:35,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:35,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:35,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:44:35,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:35,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:44:35,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:44:35,061 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:35,384 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-02-20 23:44:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:44:35,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:44:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2022-02-20 23:44:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2022-02-20 23:44:35,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 29 transitions. [2022-02-20 23:44:35,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:35,419 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:44:35,420 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 23:44:35,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:44:35,420 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 66 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:35,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 36 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 23:44:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 23:44:35,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:35,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,423 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,424 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:35,424 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-02-20 23:44:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-02-20 23:44:35,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:35,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:35,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 23:44:35,425 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 23:44:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:35,426 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-02-20 23:44:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-02-20 23:44:35,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:35,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:35,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:35,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-02-20 23:44:35,427 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 14 [2022-02-20 23:44:35,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:35,432 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-02-20 23:44:35,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-02-20 23:44:35,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:44:35,432 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:35,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:35,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:44:35,433 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:35,433 INFO L85 PathProgramCache]: Analyzing trace with hash -498142932, now seen corresponding path program 1 times [2022-02-20 23:44:35,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:35,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487586403] [2022-02-20 23:44:35,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:35,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:35,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {1136#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {1136#true} is VALID [2022-02-20 23:44:35,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16); {1138#(and (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|) 1))} is VALID [2022-02-20 23:44:35,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {1138#(and (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|) 1))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4); srcloc: L529 {1139#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:35,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {1139#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24); {1139#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:35,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {1139#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) 1) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, 4 + alloc_data_~pdata#1.offset, 4); srcloc: L530 {1140#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:44:35,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {1140#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1140#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} is VALID [2022-02-20 23:44:35,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {1140#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) 1)} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {1141#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|)) 1)} is VALID [2022-02-20 23:44:35,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {1141#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) |ULTIMATE.start_free_data_~data#1.offset|)) 1)} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~data#1.base, free_data_~data#1.offset, 4); srcloc: L534 {1142#(= (select |#valid| |ULTIMATE.start_free_data_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:44:35,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {1142#(= (select |#valid| |ULTIMATE.start_free_data_#t~mem5#1.base|) 1)} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {1143#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} is VALID [2022-02-20 23:44:35,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {1143#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~data#1.base, 4 + free_data_~data#1.offset, 4); srcloc: L535 {1143#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} is VALID [2022-02-20 23:44:35,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {1143#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {1143#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} is VALID [2022-02-20 23:44:35,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {1143#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} assume free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset; {1143#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} is VALID [2022-02-20 23:44:35,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {1143#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} assume 0 == free_data_~lo~0#1.offset; {1143#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} is VALID [2022-02-20 23:44:35,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {1143#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} assume free_data_~lo~0#1.base < #StackHeapBarrier; {1143#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} is VALID [2022-02-20 23:44:35,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {1143#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1)} assume !(0 == free_data_~lo~0#1.base || 1 == #valid[free_data_~lo~0#1.base]); {1137#false} is VALID [2022-02-20 23:44:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:35,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:35,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487586403] [2022-02-20 23:44:35,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487586403] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:35,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:35,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:44:35,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258910149] [2022-02-20 23:44:35,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:35,545 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:44:35,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:35,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:35,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:44:35,559 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:35,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:44:35,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:44:35,560 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:35,805 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 23:44:35,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:44:35,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:44:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2022-02-20 23:44:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2022-02-20 23:44:35,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 31 transitions. [2022-02-20 23:44:35,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:35,836 INFO L225 Difference]: With dead ends: 30 [2022-02-20 23:44:35,836 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 23:44:35,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:44:35,837 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:35,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 45 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 23:44:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-02-20 23:44:35,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:35,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,839 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,840 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:35,840 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 23:44:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-02-20 23:44:35,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:35,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:35,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 23:44:35,842 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 23:44:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:35,842 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 23:44:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-02-20 23:44:35,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:35,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:35,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:35,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-02-20 23:44:35,844 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2022-02-20 23:44:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:35,845 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-02-20 23:44:35,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-02-20 23:44:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:44:35,845 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:35,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:35,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:44:35,846 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:35,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1750799681, now seen corresponding path program 1 times [2022-02-20 23:44:35,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:35,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295418200] [2022-02-20 23:44:35,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:35,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:35,906 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:44:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:35,956 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:44:35,956 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:44:35,957 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2022-02-20 23:44:35,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (17 of 19 remaining) [2022-02-20 23:44:35,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (16 of 19 remaining) [2022-02-20 23:44:35,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (15 of 19 remaining) [2022-02-20 23:44:35,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (14 of 19 remaining) [2022-02-20 23:44:35,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (13 of 19 remaining) [2022-02-20 23:44:35,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (12 of 19 remaining) [2022-02-20 23:44:35,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (11 of 19 remaining) [2022-02-20 23:44:35,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (10 of 19 remaining) [2022-02-20 23:44:35,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 19 remaining) [2022-02-20 23:44:35,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (8 of 19 remaining) [2022-02-20 23:44:35,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (7 of 19 remaining) [2022-02-20 23:44:35,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (6 of 19 remaining) [2022-02-20 23:44:35,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (5 of 19 remaining) [2022-02-20 23:44:35,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (4 of 19 remaining) [2022-02-20 23:44:35,960 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (3 of 19 remaining) [2022-02-20 23:44:35,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (2 of 19 remaining) [2022-02-20 23:44:35,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (1 of 19 remaining) [2022-02-20 23:44:35,961 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (0 of 19 remaining) [2022-02-20 23:44:35,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:44:35,965 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:35,967 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:44:36,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:44:36 BoogieIcfgContainer [2022-02-20 23:44:36,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:44:36,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:44:36,010 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:44:36,010 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:44:36,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:32" (3/4) ... [2022-02-20 23:44:36,012 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 23:44:36,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:44:36,013 INFO L158 Benchmark]: Toolchain (without parser) took 4219.61ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 67.1MB in the beginning and 96.1MB in the end (delta: -29.0MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2022-02-20 23:44:36,014 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 54.0MB in the beginning and 53.9MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:36,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.90ms. Allocated memory is still 96.5MB. Free memory was 67.1MB in the beginning and 64.5MB in the end (delta: 2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:44:36,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.84ms. Allocated memory is still 96.5MB. Free memory was 64.2MB in the beginning and 62.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:36,014 INFO L158 Benchmark]: Boogie Preprocessor took 39.63ms. Allocated memory is still 96.5MB. Free memory was 62.3MB in the beginning and 60.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:36,014 INFO L158 Benchmark]: RCFGBuilder took 406.59ms. Allocated memory is still 96.5MB. Free memory was 60.7MB in the beginning and 46.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 23:44:36,015 INFO L158 Benchmark]: TraceAbstraction took 3270.98ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 45.7MB in the beginning and 96.1MB in the end (delta: -50.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:36,015 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 142.6MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:36,020 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.17ms. Allocated memory is still 96.5MB. Free memory was 54.0MB in the beginning and 53.9MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.90ms. Allocated memory is still 96.5MB. Free memory was 67.1MB in the beginning and 64.5MB in the end (delta: 2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.84ms. Allocated memory is still 96.5MB. Free memory was 64.2MB in the beginning and 62.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.63ms. Allocated memory is still 96.5MB. Free memory was 62.3MB in the beginning and 60.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 406.59ms. Allocated memory is still 96.5MB. Free memory was 60.7MB in the beginning and 46.4MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3270.98ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 45.7MB in the beginning and 96.1MB in the end (delta: -50.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 142.6MB. Free memory is still 96.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 - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; [L545] CALL alloc_data(&data) [L529] pdata->lo = malloc(16) VAL [malloc(16)={-1:0}, pdata={3:0}, pdata={3:0}] [L530] pdata->hi = malloc(24) VAL [malloc(24)={-2:0}, pdata={3:0}, pdata={3:0}] [L545] RET alloc_data(&data) [L546] CALL free_data(&data) [L534] EXPR data->lo VAL [data={3:0}, data={3:0}, data->lo={-1:0}] [L534] void *lo = data->lo; [L535] EXPR data->hi VAL [data={3:0}, data={3:0}, data->hi={-2:0}, lo={-1:0}] [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L540] data->lo = (void *) 0 VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L541] data->hi = (void *) 0 VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L546] RET free_data(&data) [L547] return 0; [L547] return 0; VAL [\result=0] - UnprovableResult [Line: 529]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 529]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 343 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 343 mSDsluCounter, 309 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 160 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 48, 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, 8 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 23:44:36,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:44:37,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:44:37,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:44:37,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:44:37,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:44:37,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:44:37,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:44:37,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:44:37,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:44:38,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:44:38,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:44:38,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:44:38,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:44:38,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:44:38,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:44:38,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:44:38,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:44:38,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:44:38,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:44:38,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:44:38,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:44:38,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:44:38,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:44:38,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:44:38,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:44:38,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:44:38,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:44:38,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:44:38,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:44:38,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:44:38,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:44:38,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:44:38,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:44:38,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:44:38,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:44:38,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:44:38,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:44:38,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:44:38,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:44:38,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:44:38,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:44:38,050 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:44:38,078 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:44:38,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:44:38,079 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:44:38,079 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:44:38,079 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:44:38,080 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:44:38,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:44:38,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:44:38,081 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:44:38,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:44:38,082 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:44:38,082 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:44:38,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:44:38,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:44:38,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:44:38,083 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:44:38,083 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:44:38,084 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:44:38,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:44:38,084 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:44:38,084 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:44:38,085 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:44:38,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:44:38,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:44:38,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:44:38,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:44:38,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:44:38,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:38,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:44:38,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:44:38,087 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:44:38,087 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:44:38,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:44:38,088 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad [2022-02-20 23:44:38,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:44:38,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:44:38,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:44:38,443 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:44:38,444 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:44:38,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2022-02-20 23:44:38,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec5746c1b/62e6cc8118044a9a98348fa2793037bb/FLAG083cf0e66 [2022-02-20 23:44:38,943 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:44:38,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2022-02-20 23:44:38,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec5746c1b/62e6cc8118044a9a98348fa2793037bb/FLAG083cf0e66 [2022-02-20 23:44:38,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec5746c1b/62e6cc8118044a9a98348fa2793037bb [2022-02-20 23:44:38,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:44:38,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:44:38,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:38,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:44:38,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:44:38,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:38,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6469b9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:38, skipping insertion in model container [2022-02-20 23:44:38,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:44:38" (1/1) ... [2022-02-20 23:44:38,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:44:39,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:44:39,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:39,299 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:44:39,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:44:39,381 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:44:39,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:39 WrapperNode [2022-02-20 23:44:39,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:44:39,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:39,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:44:39,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:44:39,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:39" (1/1) ... [2022-02-20 23:44:39,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:39" (1/1) ... [2022-02-20 23:44:39,423 INFO L137 Inliner]: procedures = 126, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2022-02-20 23:44:39,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:44:39,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:44:39,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:44:39,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:44:39,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:39" (1/1) ... [2022-02-20 23:44:39,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:39" (1/1) ... [2022-02-20 23:44:39,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:39" (1/1) ... [2022-02-20 23:44:39,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:39" (1/1) ... [2022-02-20 23:44:39,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:39" (1/1) ... [2022-02-20 23:44:39,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:39" (1/1) ... [2022-02-20 23:44:39,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:39" (1/1) ... [2022-02-20 23:44:39,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:44:39,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:44:39,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:44:39,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:44:39,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:39" (1/1) ... [2022-02-20 23:44:39,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:39,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:39,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:44:39,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:44:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:44:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:44:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:44:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:44:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:44:39,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:44:39,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:44:39,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:44:39,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:44:39,650 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:44:39,652 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:44:39,912 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:44:39,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:44:39,918 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:44:39,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:39 BoogieIcfgContainer [2022-02-20 23:44:39,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:44:39,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:44:39,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:44:39,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:44:39,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:44:38" (1/3) ... [2022-02-20 23:44:39,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a3abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:39, skipping insertion in model container [2022-02-20 23:44:39,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:44:39" (2/3) ... [2022-02-20 23:44:39,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a3abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:44:39, skipping insertion in model container [2022-02-20 23:44:39,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:39" (3/3) ... [2022-02-20 23:44:39,926 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2022-02-20 23:44:39,930 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:44:39,930 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2022-02-20 23:44:39,969 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:44:39,983 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:44:39,983 INFO L340 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2022-02-20 23:44:39,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:40,008 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:40,008 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:40,009 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:40,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:40,014 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:44:40,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:40,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974114110] [2022-02-20 23:44:40,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:40,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:40,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:40,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:40,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:44:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:40,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:44:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:40,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:40,266 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:44:40,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2022-02-20 23:44:40,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {46#true} is VALID [2022-02-20 23:44:40,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {54#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:44:40,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[alloc_data_~pdata#1.base]); {47#false} is VALID [2022-02-20 23:44:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:40,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:40,302 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:40,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974114110] [2022-02-20 23:44:40,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974114110] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:40,304 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:40,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:40,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376382717] [2022-02-20 23:44:40,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:40,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:40,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:40,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:40,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:40,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:40,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:40,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:40,351 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:40,552 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-02-20 23:44:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:40,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 23:44:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 23:44:40,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-02-20 23:44:40,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:40,641 INFO L225 Difference]: With dead ends: 48 [2022-02-20 23:44:40,641 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 23:44:40,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:40,645 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:40,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:40,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 23:44:40,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-02-20 23:44:40,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:40,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,668 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,668 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:40,673 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-02-20 23:44:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-02-20 23:44:40,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:40,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:40,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 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 46 states. [2022-02-20 23:44:40,675 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 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 46 states. [2022-02-20 23:44:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:40,679 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-02-20 23:44:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-02-20 23:44:40,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:40,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:40,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:40,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-02-20 23:44:40,685 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 3 [2022-02-20 23:44:40,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:40,685 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-02-20 23:44:40,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-02-20 23:44:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:44:40,686 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:40,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:44:40,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:44:40,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:40,912 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:40,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:40,912 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:44:40,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:40,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994766867] [2022-02-20 23:44:40,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:40,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:40,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:40,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:40,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:44:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:40,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:44:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:40,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:41,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:41,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:44:41,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:44:41,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {236#true} is VALID [2022-02-20 23:44:41,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {244#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:44:41,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, alloc_data_~pdata#1.offset), #length[alloc_data_~pdata#1.base]) && ~bvule32(alloc_data_~pdata#1.offset, ~bvadd32(4bv32, alloc_data_~pdata#1.offset))) && ~bvule32(0bv32, alloc_data_~pdata#1.offset)); {237#false} is VALID [2022-02-20 23:44:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:41,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:41,094 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:41,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994766867] [2022-02-20 23:44:41,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994766867] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:41,098 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:41,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:44:41,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390805846] [2022-02-20 23:44:41,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:41,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:41,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:41,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:41,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:44:41,106 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:41,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:44:41,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:41,108 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:41,269 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-02-20 23:44:41,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:44:41,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:44:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-02-20 23:44:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-02-20 23:44:41,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-02-20 23:44:41,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:41,321 INFO L225 Difference]: With dead ends: 38 [2022-02-20 23:44:41,321 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 23:44:41,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:44:41,322 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:41,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 23:44:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 23:44:41,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:41,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,327 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,327 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:41,329 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-02-20 23:44:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-02-20 23:44:41,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:41,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:41,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 states. [2022-02-20 23:44:41,331 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 states. [2022-02-20 23:44:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:41,333 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-02-20 23:44:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-02-20 23:44:41,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:41,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:41,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:41,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-02-20 23:44:41,336 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 3 [2022-02-20 23:44:41,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:41,336 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-02-20 23:44:41,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-02-20 23:44:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:44:41,337 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:41,337 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:44:41,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:41,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:41,546 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:41,547 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-02-20 23:44:41,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:41,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438431046] [2022-02-20 23:44:41,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:41,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:41,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:41,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:41,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:44:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:41,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:44:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:41,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:41,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:41,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:44:41,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:44:41,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:41,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:44:41,803 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:44:41,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:44:41,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {399#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {399#true} is VALID [2022-02-20 23:44:41,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {399#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:44:41,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {411#(and (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:44:41,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {411#(and (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:44:41,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, alloc_data_~pdata#1.offset)), #length[alloc_data_~pdata#1.base]) && ~bvule32(~bvadd32(4bv32, alloc_data_~pdata#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, alloc_data_~pdata#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, alloc_data_~pdata#1.offset))); {400#false} is VALID [2022-02-20 23:44:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:41,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:41,820 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:41,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438431046] [2022-02-20 23:44:41,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438431046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:41,823 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:41,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:44:41,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770094366] [2022-02-20 23:44:41,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:41,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:44:41,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:41,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:41,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:41,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:44:41,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:41,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:44:41,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:41,837 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:42,051 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:44:42,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:44:42,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:44:42,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 23:44:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 23:44:42,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-02-20 23:44:42,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:42,120 INFO L225 Difference]: With dead ends: 44 [2022-02-20 23:44:42,120 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 23:44:42,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:44:42,121 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 63 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:42,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 23 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:42,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 23:44:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-02-20 23:44:42,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:42,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,125 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,125 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:42,127 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:44:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-02-20 23:44:42,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:42,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:42,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 44 states. [2022-02-20 23:44:42,129 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 44 states. [2022-02-20 23:44:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:42,134 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:44:42,134 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-02-20 23:44:42,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:42,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:42,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:42,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-02-20 23:44:42,136 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 5 [2022-02-20 23:44:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:42,137 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-02-20 23:44:42,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-02-20 23:44:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:42,137 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:42,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:42,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:42,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:42,346 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:42,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:42,347 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2022-02-20 23:44:42,347 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:42,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534468434] [2022-02-20 23:44:42,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:42,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:42,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:42,355 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:42,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:44:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:42,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:44:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:42,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:42,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {586#true} is VALID [2022-02-20 23:44:42,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {594#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:44:42,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {594#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {594#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:44:42,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {594#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {594#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:44:42,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {594#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {604#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:44:42,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {604#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {604#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:44:42,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {604#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {611#(= (select |#valid| |ULTIMATE.start_free_data_~data#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:44:42,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {611#(= (select |#valid| |ULTIMATE.start_free_data_~data#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[free_data_~data#1.base]); {587#false} is VALID [2022-02-20 23:44:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:42,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:42,482 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:42,482 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534468434] [2022-02-20 23:44:42,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534468434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:42,483 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:42,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:44:42,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122109820] [2022-02-20 23:44:42,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:42,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:42,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:42,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:42,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:44:42,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:42,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:44:42,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:42,496 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:42,749 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-02-20 23:44:42,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:44:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-02-20 23:44:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-02-20 23:44:42,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-02-20 23:44:42,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:42,803 INFO L225 Difference]: With dead ends: 39 [2022-02-20 23:44:42,803 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 23:44:42,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:44:42,804 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 69 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:42,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 31 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:42,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 23:44:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-02-20 23:44:42,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:42,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,807 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,808 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:42,809 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-02-20 23:44:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-02-20 23:44:42,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:42,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:42,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 23:44:42,810 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 23:44:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:42,811 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-02-20 23:44:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-02-20 23:44:42,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:42,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:42,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:42,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-02-20 23:44:42,814 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2022-02-20 23:44:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:42,814 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-02-20 23:44:42,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-02-20 23:44:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:44:42,815 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:42,815 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:42,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:43,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:43,024 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:43,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2022-02-20 23:44:43,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:43,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96152479] [2022-02-20 23:44:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:43,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:43,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:43,025 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:43,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:44:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:43,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:44:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:43,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:43,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {772#true} is VALID [2022-02-20 23:44:43,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {780#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:43,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {780#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {780#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:43,215 INFO L290 TraceCheckUtils]: 3: Hoare triple {780#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {780#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:43,217 INFO L290 TraceCheckUtils]: 4: Hoare triple {780#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {790#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:43,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {790#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:44:43,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {790#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {797#(and (= |ULTIMATE.start_free_data_~data#1.offset| (_ bv0 32)) (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_free_data_~data#1.base|)))} is VALID [2022-02-20 23:44:43,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {797#(and (= |ULTIMATE.start_free_data_~data#1.offset| (_ bv0 32)) (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_free_data_~data#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, free_data_~data#1.offset), #length[free_data_~data#1.base]) && ~bvule32(free_data_~data#1.offset, ~bvadd32(4bv32, free_data_~data#1.offset))) && ~bvule32(0bv32, free_data_~data#1.offset)); {773#false} is VALID [2022-02-20 23:44:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:43,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:43,220 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:43,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96152479] [2022-02-20 23:44:43,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96152479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:43,220 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:43,220 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:44:43,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983654387] [2022-02-20 23:44:43,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:43,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:43,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:43,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:43,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:43,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:44:43,233 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:43,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:44:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:44:43,234 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:43,434 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:44:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:44:43,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:44:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-02-20 23:44:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-02-20 23:44:43,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2022-02-20 23:44:43,491 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:44:43,491 INFO L225 Difference]: With dead ends: 31 [2022-02-20 23:44:43,491 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 23:44:43,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:44:43,492 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:43,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 24 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 23:44:43,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 23:44:43,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:43,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:43,495 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:43,495 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:43,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:43,496 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:44:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:44:43,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:43,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:43,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-20 23:44:43,497 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-20 23:44:43,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:43,498 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-02-20 23:44:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:44:43,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:43,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:43,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:43,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-02-20 23:44:43,500 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 8 [2022-02-20 23:44:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:43,500 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-02-20 23:44:43,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-02-20 23:44:43,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:44:43,500 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:43,500 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:43,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:43,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:43,709 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:43,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:43,710 INFO L85 PathProgramCache]: Analyzing trace with hash 406185098, now seen corresponding path program 1 times [2022-02-20 23:44:43,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:43,710 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794225700] [2022-02-20 23:44:43,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:43,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:43,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:43,711 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:43,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:44:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:43,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:44:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:43,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:43,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:44:43,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:44:43,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {928#true} is VALID [2022-02-20 23:44:43,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {936#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:43,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {936#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {936#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:43,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {936#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {943#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:44:43,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {943#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {947#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32))} is VALID [2022-02-20 23:44:43,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {947#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {947#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32))} is VALID [2022-02-20 23:44:43,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {947#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv0 32))} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {954#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) (_ bv0 32))} is VALID [2022-02-20 23:44:43,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {954#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) (_ bv0 32))} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~data#1.base, free_data_~data#1.offset, 4bv32); srcloc: L534 {954#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) (_ bv0 32))} is VALID [2022-02-20 23:44:43,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {954#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) (_ bv0 32))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {954#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) (_ bv0 32))} is VALID [2022-02-20 23:44:43,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {954#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) (_ bv0 32))} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~data#1.base, ~bvadd32(4bv32, free_data_~data#1.offset), 4bv32); srcloc: L535 {964#(= |ULTIMATE.start_free_data_#t~mem6#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:44:43,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {964#(= |ULTIMATE.start_free_data_#t~mem6#1.offset| (_ bv0 32))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {968#(= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:44:43,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {968#(= |ULTIMATE.start_free_data_~hi~0#1.offset| (_ bv0 32))} assume free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset; {972#(= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:44:43,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {972#(= |ULTIMATE.start_free_data_~lo~0#1.offset| (_ bv0 32))} assume !(0bv32 == free_data_~lo~0#1.offset); {929#false} is VALID [2022-02-20 23:44:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:43,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:43,975 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:43,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794225700] [2022-02-20 23:44:43,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794225700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:43,976 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:43,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:44:43,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734247281] [2022-02-20 23:44:43,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:43,976 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 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:44:43,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:43,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:44,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:44,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:44:44,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:44,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:44:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:44:44,015 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:44,649 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2022-02-20 23:44:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:44:44,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 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:44:44,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2022-02-20 23:44:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:44,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2022-02-20 23:44:44,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 34 transitions. [2022-02-20 23:44:44,732 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:44:44,732 INFO L225 Difference]: With dead ends: 33 [2022-02-20 23:44:44,732 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 23:44:44,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:44:44,733 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 79 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:44,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 60 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:44:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 23:44:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-02-20 23:44:44,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:44,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:44,740 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:44,740 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:44,741 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2022-02-20 23:44:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2022-02-20 23:44:44,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:44,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:44,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 23:44:44,742 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 23:44:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:44,743 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2022-02-20 23:44:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2022-02-20 23:44:44,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:44,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:44,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:44,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-02-20 23:44:44,745 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 13 [2022-02-20 23:44:44,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:44,745 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-02-20 23:44:44,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:44,745 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-02-20 23:44:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:44:44,746 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:44,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:44,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:44,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:44,954 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:44,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash -293163793, now seen corresponding path program 1 times [2022-02-20 23:44:44,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:44,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52304413] [2022-02-20 23:44:44,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:44,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:44,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:44,956 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:44,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:44:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:45,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:44:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:45,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:45,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:44:45,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:44:45,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {1119#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {1124#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:44:45,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {1124#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {1128#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:44:45,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {1128#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1128#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:44:45,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {1128#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {1135#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))) (bvult |ULTIMATE.start_alloc_data_#t~malloc4#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:44:47,677 WARN L290 TraceCheckUtils]: 4: Hoare triple {1135#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))) (bvult |ULTIMATE.start_alloc_data_#t~malloc4#1.base| |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1139#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is UNKNOWN [2022-02-20 23:44:47,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {1139#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1139#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:44:47,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {1139#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {1146#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:44:47,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {1146#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~data#1.base, free_data_~data#1.offset, 4bv32); srcloc: L534 {1146#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:44:47,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {1146#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {1146#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:44:47,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {1146#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|)) |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~data#1.base, ~bvadd32(4bv32, free_data_~data#1.offset), 4bv32); srcloc: L535 {1156#(and (bvult |ULTIMATE.start_free_data_#t~mem6#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:44:47,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {1156#(and (bvult |ULTIMATE.start_free_data_#t~mem6#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {1160#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:44:47,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {1160#(and (bvult |ULTIMATE.start_free_data_~hi~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} assume free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset; {1164#(and (bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:44:47,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {1164#(and (bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} assume 0bv32 == free_data_~lo~0#1.offset; {1164#(and (bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:44:47,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {1164#(and (bvult |ULTIMATE.start_free_data_~lo~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| (_ bv0 32))))))} assume !~bvult32(free_data_~lo~0#1.base, #StackHeapBarrier); {1120#false} is VALID [2022-02-20 23:44:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:47,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:47,727 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:47,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52304413] [2022-02-20 23:44:47,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52304413] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:47,727 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:47,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:44:47,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455377953] [2022-02-20 23:44:47,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:47,728 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:44:47,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:47,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:47,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:47,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:44:47,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:47,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:44:47,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:44:47,846 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:48,020 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2022-02-20 23:44:48,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:44:48,021 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:44:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-02-20 23:44:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-02-20 23:44:48,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-02-20 23:44:49,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:49,842 INFO L225 Difference]: With dead ends: 32 [2022-02-20 23:44:49,842 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 23:44:49,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:44:49,843 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:49,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 49 Unchecked, 0.0s Time] [2022-02-20 23:44:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 23:44:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 23:44:49,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:49,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:49,847 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:49,847 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:49,848 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2022-02-20 23:44:49,848 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 31 transitions. [2022-02-20 23:44:49,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:49,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:49,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 23:44:49,848 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 23:44:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:49,849 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2022-02-20 23:44:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 31 transitions. [2022-02-20 23:44:49,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:49,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:49,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:49,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-02-20 23:44:49,850 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 14 [2022-02-20 23:44:49,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:49,850 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-02-20 23:44:49,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-02-20 23:44:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:44:49,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:49,850 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:49,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:50,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:50,051 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:50,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash -498142932, now seen corresponding path program 1 times [2022-02-20 23:44:50,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:50,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008834123] [2022-02-20 23:44:50,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:50,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:50,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:50,053 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:50,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:44:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:50,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:44:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:50,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:50,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:44:50,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:44:50,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-02-20 23:44:50,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {1294#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {1294#true} is VALID [2022-02-20 23:44:50,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {1294#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(16bv32); {1302#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:50,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {1302#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1302#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:44:50,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {1302#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(24bv32); {1309#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:44:50,344 INFO L290 TraceCheckUtils]: 4: Hoare triple {1309#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1313#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:44:50,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {1313#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1313#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:44:50,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {1313#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1))} assume { :end_inline_alloc_data } true;assume { :begin_inline_free_data } true;free_data_#in~data#1.base, free_data_#in~data#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset, free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset, free_data_~data#1.base, free_data_~data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;free_data_~data#1.base, free_data_~data#1.offset := free_data_#in~data#1.base, free_data_#in~data#1.offset; {1320#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:44:50,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {1320#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|))) (_ bv1 1))} SUMMARY for call free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset := read~$Pointer$(free_data_~data#1.base, free_data_~data#1.offset, 4bv32); srcloc: L534 {1320#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:44:50,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {1320#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|))) (_ bv1 1))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset;havoc free_data_#t~mem5#1.base, free_data_#t~mem5#1.offset; {1320#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:44:50,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~data#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~data#1.offset|))) (_ bv1 1))} SUMMARY for call free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset := read~$Pointer$(free_data_~data#1.base, ~bvadd32(4bv32, free_data_~data#1.offset), 4bv32); srcloc: L535 {1330#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_#t~mem6#1.base|))} is VALID [2022-02-20 23:44:50,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {1330#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_#t~mem6#1.base|))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset;havoc free_data_#t~mem6#1.base, free_data_#t~mem6#1.offset; {1334#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))} is VALID [2022-02-20 23:44:50,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {1334#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))} assume free_data_~lo~0#1.base == free_data_~hi~0#1.base && free_data_~lo~0#1.offset == free_data_~hi~0#1.offset; {1338#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:44:50,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {1338#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) (_ bv1 1))} assume 0bv32 == free_data_~lo~0#1.offset; {1338#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:44:50,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {1338#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) (_ bv1 1))} assume ~bvult32(free_data_~lo~0#1.base, #StackHeapBarrier); {1338#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:44:50,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {1338#(= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) (_ bv1 1))} assume !(0bv32 == free_data_~lo~0#1.base || 1bv1 == #valid[free_data_~lo~0#1.base]); {1295#false} is VALID [2022-02-20 23:44:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:44:50,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:44:50,349 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:44:50,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008834123] [2022-02-20 23:44:50,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008834123] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:44:50,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:44:50,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:44:50,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181659987] [2022-02-20 23:44:50,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:44:50,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:44:50,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:50,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:50,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:50,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:44:50,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:44:50,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:44:50,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:44:50,396 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:51,202 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-02-20 23:44:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:44:51,202 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:44:51,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-02-20 23:44:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-02-20 23:44:51,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 30 transitions. [2022-02-20 23:44:51,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:51,263 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:44:51,263 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 23:44:51,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:44:51,264 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:51,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 40 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:44:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 23:44:51,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-02-20 23:44:51,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:51,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:51,266 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:51,266 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:51,267 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-02-20 23:44:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-02-20 23:44:51,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:51,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:51,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 23:44:51,268 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 23:44:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:51,268 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-02-20 23:44:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-02-20 23:44:51,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:51,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:51,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:51,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-02-20 23:44:51,273 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 15 [2022-02-20 23:44:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:51,273 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-02-20 23:44:51,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-02-20 23:44:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:44:51,274 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:51,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:51,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:51,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:51,475 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 15 more)] === [2022-02-20 23:44:51,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1750799681, now seen corresponding path program 1 times [2022-02-20 23:44:51,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:44:51,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316728898] [2022-02-20 23:44:51,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:51,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:44:51,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:44:51,477 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:44:51,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:44:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:51,591 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:44:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:44:51,660 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 23:44:51,660 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:44:51,661 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2022-02-20 23:44:51,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (17 of 19 remaining) [2022-02-20 23:44:51,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (16 of 19 remaining) [2022-02-20 23:44:51,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (15 of 19 remaining) [2022-02-20 23:44:51,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (14 of 19 remaining) [2022-02-20 23:44:51,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (13 of 19 remaining) [2022-02-20 23:44:51,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (12 of 19 remaining) [2022-02-20 23:44:51,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (11 of 19 remaining) [2022-02-20 23:44:51,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (10 of 19 remaining) [2022-02-20 23:44:51,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 19 remaining) [2022-02-20 23:44:51,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (8 of 19 remaining) [2022-02-20 23:44:51,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (7 of 19 remaining) [2022-02-20 23:44:51,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (6 of 19 remaining) [2022-02-20 23:44:51,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (5 of 19 remaining) [2022-02-20 23:44:51,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (4 of 19 remaining) [2022-02-20 23:44:51,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (3 of 19 remaining) [2022-02-20 23:44:51,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (2 of 19 remaining) [2022-02-20 23:44:51,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (1 of 19 remaining) [2022-02-20 23:44:51,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (0 of 19 remaining) [2022-02-20 23:44:51,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:51,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:44:51,867 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:44:51,868 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:44:51,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:44:51 BoogieIcfgContainer [2022-02-20 23:44:51,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:44:51,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:44:51,899 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:44:51,899 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:44:51,899 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:44:39" (3/4) ... [2022-02-20 23:44:51,902 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 23:44:51,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:44:51,903 INFO L158 Benchmark]: Toolchain (without parser) took 12928.77ms. Allocated memory was 56.6MB in the beginning and 86.0MB in the end (delta: 29.4MB). Free memory was 34.2MB in the beginning and 59.0MB in the end (delta: -24.7MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2022-02-20 23:44:51,903 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 38.6MB in the end (delta: 43.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:51,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.59ms. Allocated memory is still 56.6MB. Free memory was 34.0MB in the beginning and 31.7MB in the end (delta: 2.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:44:51,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.92ms. Allocated memory is still 56.6MB. Free memory was 31.7MB in the beginning and 29.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:51,904 INFO L158 Benchmark]: Boogie Preprocessor took 49.08ms. Allocated memory is still 56.6MB. Free memory was 29.5MB in the beginning and 27.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:44:51,905 INFO L158 Benchmark]: RCFGBuilder took 445.78ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 27.7MB in the beginning and 42.2MB in the end (delta: -14.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-02-20 23:44:51,905 INFO L158 Benchmark]: TraceAbstraction took 11976.67ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 41.7MB in the beginning and 59.5MB in the end (delta: -17.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:51,906 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 86.0MB. Free memory is still 59.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:44:51,911 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 38.6MB in the end (delta: 43.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.59ms. Allocated memory is still 56.6MB. Free memory was 34.0MB in the beginning and 31.7MB in the end (delta: 2.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.92ms. Allocated memory is still 56.6MB. Free memory was 31.7MB in the beginning and 29.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.08ms. Allocated memory is still 56.6MB. Free memory was 29.5MB in the beginning and 27.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 445.78ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 27.7MB in the beginning and 42.2MB in the end (delta: -14.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11976.67ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 41.7MB in the beginning and 59.5MB in the end (delta: -17.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 86.0MB. Free memory is still 59.0MB. 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 - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; [L545] CALL alloc_data(&data) [L529] pdata->lo = malloc(16) VAL [malloc(16)={3:0}, pdata={11:0}, pdata={11:0}] [L530] pdata->hi = malloc(24) VAL [malloc(24)={4:0}, pdata={11:0}, pdata={11:0}] [L545] RET alloc_data(&data) [L546] CALL free_data(&data) [L534] EXPR data->lo VAL [data={11:0}, data={11:0}, data->lo={3:0}] [L534] void *lo = data->lo; [L535] EXPR data->hi VAL [data={11:0}, data={11:0}, data->hi={4:0}, lo={3:0}] [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={11:0}, data={11:0}, hi={4:0}, lo={3:0}] [L540] data->lo = (void *) 0 VAL [data={11:0}, data={11:0}, hi={4:0}, lo={3:0}] [L541] data->hi = (void *) 0 VAL [data={11:0}, data={11:0}, hi={4:0}, lo={3:0}] [L546] RET free_data(&data) [L547] return 0; [L547] return 0; VAL [\result=0] - UnprovableResult [Line: 529]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 529]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 530]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 535]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 359 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 49 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 316 IncrementalHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 167 mSDtfsCounter, 316 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 55, 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, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 61 ConstructedInterpolants, 12 QuantifiedInterpolants, 526 SizeOfPredicates, 66 NumberOfNonLiveVariables, 546 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 23:44:51,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample