./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.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-ext/tree_parent_ptr.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 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:46:46,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:46:46,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:46:46,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:46:46,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:46:46,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:46:46,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:46:46,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:46:46,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:46:46,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:46:46,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:46:46,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:46:46,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:46:46,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:46:46,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:46:46,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:46:46,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:46:46,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:46:46,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:46:46,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:46:46,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:46:46,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:46:46,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:46:46,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:46:46,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:46:46,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:46:46,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:46:46,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:46:46,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:46:46,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:46:46,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:46:46,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:46:46,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:46:46,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:46:46,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:46:46,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:46:46,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:46:46,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:46:46,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:46:46,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:46:46,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:46:46,425 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:46:46,454 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:46:46,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:46:46,455 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:46:46,455 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:46:46,456 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:46:46,456 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:46:46,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:46:46,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:46:46,457 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:46:46,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:46:46,458 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:46:46,458 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:46:46,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:46:46,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:46:46,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:46:46,459 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:46:46,460 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:46:46,460 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:46:46,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:46:46,460 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:46:46,460 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:46:46,460 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:46:46,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:46:46,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:46:46,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:46:46,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:46,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:46:46,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:46:46,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:46:46,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:46:46,463 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 -> 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 [2022-02-20 23:46:46,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:46:46,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:46:46,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:46:46,689 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:46:46,690 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:46:46,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2022-02-20 23:46:46,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ceac2bac/da40c9263bfd46d183db273748b8ab52/FLAGcabad4705 [2022-02-20 23:46:47,148 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:46:47,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2022-02-20 23:46:47,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ceac2bac/da40c9263bfd46d183db273748b8ab52/FLAGcabad4705 [2022-02-20 23:46:47,170 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ceac2bac/da40c9263bfd46d183db273748b8ab52 [2022-02-20 23:46:47,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:46:47,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:46:47,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:47,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:46:47,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:46:47,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:47" (1/1) ... [2022-02-20 23:46:47,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2c8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:47, skipping insertion in model container [2022-02-20 23:46:47,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:47" (1/1) ... [2022-02-20 23:46:47,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:46:47,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:46:47,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:47,468 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:46:47,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:47,546 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:46:47,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:47 WrapperNode [2022-02-20 23:46:47,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:47,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:47,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:46:47,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:46:47,554 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:46:47" (1/1) ... [2022-02-20 23:46:47,573 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:46:47" (1/1) ... [2022-02-20 23:46:47,618 INFO L137 Inliner]: procedures = 123, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2022-02-20 23:46:47,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:47,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:46:47,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:46:47,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:46:47,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:47" (1/1) ... [2022-02-20 23:46:47,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:47" (1/1) ... [2022-02-20 23:46:47,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:47" (1/1) ... [2022-02-20 23:46:47,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:47" (1/1) ... [2022-02-20 23:46:47,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:47" (1/1) ... [2022-02-20 23:46:47,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:47" (1/1) ... [2022-02-20 23:46:47,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:47" (1/1) ... [2022-02-20 23:46:47,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:46:47,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:46:47,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:46:47,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:46:47,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:47" (1/1) ... [2022-02-20 23:46:47,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:47,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:47,708 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:46:47,723 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:46:47,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:46:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:46:47,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:46:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:46:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:46:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:46:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:46:47,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:46:47,882 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:46:47,883 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:46:48,490 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:46:48,498 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:46:48,498 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:46:48,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:48 BoogieIcfgContainer [2022-02-20 23:46:48,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:46:48,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:46:48,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:46:48,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:46:48,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:46:47" (1/3) ... [2022-02-20 23:46:48,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441edc6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:48, skipping insertion in model container [2022-02-20 23:46:48,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:47" (2/3) ... [2022-02-20 23:46:48,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441edc6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:48, skipping insertion in model container [2022-02-20 23:46:48,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:48" (3/3) ... [2022-02-20 23:46:48,507 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr.i [2022-02-20 23:46:48,514 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:46:48,515 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2022-02-20 23:46:48,552 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:46:48,560 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:46:48,560 INFO L340 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2022-02-20 23:46:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 77 states have (on average 2.1818181818181817) internal successors, (168), 154 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:46:48,594 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:48,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:46:48,595 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:48,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:46:48,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:48,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314268934] [2022-02-20 23:46:48,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:48,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:48,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {158#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(18, 2); {158#true} is VALID [2022-02-20 23:46:48,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {158#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {160#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:46:48,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume !(1 == #valid[main_~root~0#1.base]); {159#false} is VALID [2022-02-20 23:46:48,768 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:46:48,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:48,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314268934] [2022-02-20 23:46:48,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314268934] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:48,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:48,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:48,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069989824] [2022-02-20 23:46:48,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:48,777 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:46:48,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:48,780 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:46:48,787 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:46:48,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:48,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:48,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:48,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:48,815 INFO L87 Difference]: Start difference. First operand has 155 states, 77 states have (on average 2.1818181818181817) internal successors, (168), 154 states have internal predecessors, (168), 0 states have call successors, (0), 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:46:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:49,124 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2022-02-20 23:46:49,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:49,125 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:46:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:49,126 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:46:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:46:49,133 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:46:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:46:49,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2022-02-20 23:46:49,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:49,323 INFO L225 Difference]: With dead ends: 172 [2022-02-20 23:46:49,323 INFO L226 Difference]: Without dead ends: 168 [2022-02-20 23:46:49,325 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:46:49,327 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 120 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:49,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 128 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-02-20 23:46:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 150. [2022-02-20 23:46:49,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:49,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 150 states, 76 states have (on average 2.1052631578947367) internal successors, (160), 149 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:49,357 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 150 states, 76 states have (on average 2.1052631578947367) internal successors, (160), 149 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:49,358 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 150 states, 76 states have (on average 2.1052631578947367) internal successors, (160), 149 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:49,365 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2022-02-20 23:46:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2022-02-20 23:46:49,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:49,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:49,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 76 states have (on average 2.1052631578947367) internal successors, (160), 149 states have internal predecessors, (160), 0 states have call successors, (0), 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 168 states. [2022-02-20 23:46:49,368 INFO L87 Difference]: Start difference. First operand has 150 states, 76 states have (on average 2.1052631578947367) internal successors, (160), 149 states have internal predecessors, (160), 0 states have call successors, (0), 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 168 states. [2022-02-20 23:46:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:49,374 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2022-02-20 23:46:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2022-02-20 23:46:49,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:49,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:49,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:49,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 76 states have (on average 2.1052631578947367) internal successors, (160), 149 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2022-02-20 23:46:49,382 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 3 [2022-02-20 23:46:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:49,382 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2022-02-20 23:46:49,382 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:46:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2022-02-20 23:46:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:46:49,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:49,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:46:49,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:46:49,384 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:46:49,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:49,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805327922] [2022-02-20 23:46:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:49,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:49,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {821#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(18, 2); {821#true} is VALID [2022-02-20 23:46:49,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {821#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {823#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} is VALID [2022-02-20 23:46:49,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {823#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} assume !(4 + main_~root~0#1.offset <= #length[main_~root~0#1.base] && 0 <= main_~root~0#1.offset); {822#false} is VALID [2022-02-20 23:46:49,426 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:46:49,427 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:49,427 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805327922] [2022-02-20 23:46:49,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805327922] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:49,427 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:49,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:49,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282236659] [2022-02-20 23:46:49,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:49,429 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:46:49,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:49,429 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:46:49,433 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:46:49,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:49,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:49,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:49,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:49,434 INFO L87 Difference]: Start difference. First operand 150 states and 160 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:46:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:49,702 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2022-02-20 23:46:49,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:49,703 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:46:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:49,703 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:46:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2022-02-20 23:46:49,705 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:46:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2022-02-20 23:46:49,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2022-02-20 23:46:49,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:49,855 INFO L225 Difference]: With dead ends: 147 [2022-02-20 23:46:49,855 INFO L226 Difference]: Without dead ends: 147 [2022-02-20 23:46:49,855 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:46:49,856 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 92 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:49,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 144 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-20 23:46:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-02-20 23:46:49,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:49,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 147 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 146 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:49,863 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 147 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 146 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:49,864 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 147 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 146 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:49,868 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2022-02-20 23:46:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2022-02-20 23:46:49,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:49,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:49,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 146 states have internal predecessors, (157), 0 states have call successors, (0), 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 147 states. [2022-02-20 23:46:49,870 INFO L87 Difference]: Start difference. First operand has 147 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 146 states have internal predecessors, (157), 0 states have call successors, (0), 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 147 states. [2022-02-20 23:46:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:49,874 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2022-02-20 23:46:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2022-02-20 23:46:49,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:49,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:49,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:49,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 76 states have (on average 2.0657894736842106) internal successors, (157), 146 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2022-02-20 23:46:49,881 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 3 [2022-02-20 23:46:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:49,881 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2022-02-20 23:46:49,881 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:46:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2022-02-20 23:46:49,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:46:49,882 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:49,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:49,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:46:49,882 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:49,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:49,883 INFO L85 PathProgramCache]: Analyzing trace with hash 59265651, now seen corresponding path program 1 times [2022-02-20 23:46:49,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:49,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209682737] [2022-02-20 23:46:49,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:49,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:49,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {1414#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(18, 2); {1414#true} is VALID [2022-02-20 23:46:49,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {1414#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {1414#true} is VALID [2022-02-20 23:46:49,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {1414#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {1416#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:46:49,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {1416#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {1416#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:46:49,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {1416#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {1416#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:46:49,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {1416#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {1416#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:46:49,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {1416#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {1417#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:46:49,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {1417#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !(1 == #valid[main_~n~0#1.base]); {1415#false} is VALID [2022-02-20 23:46:49,963 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:46:49,963 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:49,963 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209682737] [2022-02-20 23:46:49,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209682737] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:49,964 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:49,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:49,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445320000] [2022-02-20 23:46:49,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:49,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:49,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:49,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:49,972 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:46:49,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:49,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:49,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:49,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:49,973 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:50,302 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-02-20 23:46:50,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:50,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-02-20 23:46:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-02-20 23:46:50,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 182 transitions. [2022-02-20 23:46:50,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:50,461 INFO L225 Difference]: With dead ends: 153 [2022-02-20 23:46:50,462 INFO L226 Difference]: Without dead ends: 153 [2022-02-20 23:46:50,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:50,463 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 198 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:50,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 100 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-02-20 23:46:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 131. [2022-02-20 23:46:50,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:50,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 131 states, 77 states have (on average 1.844155844155844) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,469 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 131 states, 77 states have (on average 1.844155844155844) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,470 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 131 states, 77 states have (on average 1.844155844155844) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:50,473 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-02-20 23:46:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-02-20 23:46:50,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:50,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:50,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 77 states have (on average 1.844155844155844) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 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 153 states. [2022-02-20 23:46:50,475 INFO L87 Difference]: Start difference. First operand has 131 states, 77 states have (on average 1.844155844155844) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 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 153 states. [2022-02-20 23:46:50,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:50,479 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-02-20 23:46:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-02-20 23:46:50,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:50,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:50,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:50,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.844155844155844) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2022-02-20 23:46:50,483 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 8 [2022-02-20 23:46:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:50,483 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2022-02-20 23:46:50,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-02-20 23:46:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:46:50,484 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:50,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:50,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:46:50,485 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:50,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:50,485 INFO L85 PathProgramCache]: Analyzing trace with hash 59265652, now seen corresponding path program 1 times [2022-02-20 23:46:50,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:50,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688779989] [2022-02-20 23:46:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:50,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:50,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {2012#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(18, 2); {2012#true} is VALID [2022-02-20 23:46:50,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {2012#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {2014#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} is VALID [2022-02-20 23:46:50,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {2014#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {2014#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} is VALID [2022-02-20 23:46:50,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {2014#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {2014#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} is VALID [2022-02-20 23:46:50,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {2014#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {2014#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} is VALID [2022-02-20 23:46:50,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {2014#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {2014#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} is VALID [2022-02-20 23:46:50,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {2014#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {2015#(and (<= 12 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:46:50,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {2015#(and (<= 12 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume !(4 + main_~n~0#1.offset <= #length[main_~n~0#1.base] && 0 <= main_~n~0#1.offset); {2013#false} is VALID [2022-02-20 23:46:50,599 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:46:50,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:50,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688779989] [2022-02-20 23:46:50,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688779989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:50,599 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:50,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:50,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798441194] [2022-02-20 23:46:50,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:50,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:50,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:50,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:50,608 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:46:50,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:50,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:50,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:50,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:50,609 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,056 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2022-02-20 23:46:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:46:51,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 218 transitions. [2022-02-20 23:46:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 218 transitions. [2022-02-20 23:46:51,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 218 transitions. [2022-02-20 23:46:51,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:51,251 INFO L225 Difference]: With dead ends: 186 [2022-02-20 23:46:51,251 INFO L226 Difference]: Without dead ends: 186 [2022-02-20 23:46:51,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:51,253 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 191 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:51,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 180 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-02-20 23:46:51,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 167. [2022-02-20 23:46:51,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:51,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 167 states, 113 states have (on average 1.7168141592920354) internal successors, (194), 166 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,259 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 167 states, 113 states have (on average 1.7168141592920354) internal successors, (194), 166 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,260 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 167 states, 113 states have (on average 1.7168141592920354) internal successors, (194), 166 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,264 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2022-02-20 23:46:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 204 transitions. [2022-02-20 23:46:51,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:51,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:51,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 113 states have (on average 1.7168141592920354) internal successors, (194), 166 states have internal predecessors, (194), 0 states have call successors, (0), 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 186 states. [2022-02-20 23:46:51,266 INFO L87 Difference]: Start difference. First operand has 167 states, 113 states have (on average 1.7168141592920354) internal successors, (194), 166 states have internal predecessors, (194), 0 states have call successors, (0), 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 186 states. [2022-02-20 23:46:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,270 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2022-02-20 23:46:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 204 transitions. [2022-02-20 23:46:51,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:51,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:51,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:51,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 113 states have (on average 1.7168141592920354) internal successors, (194), 166 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2022-02-20 23:46:51,275 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 8 [2022-02-20 23:46:51,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:51,276 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2022-02-20 23:46:51,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:46:51,276 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2022-02-20 23:46:51,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:46:51,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:51,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:51,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:46:51,277 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:51,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:51,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1837237128, now seen corresponding path program 1 times [2022-02-20 23:46:51,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:51,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649970509] [2022-02-20 23:46:51,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:51,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:51,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {2745#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(18, 2); {2745#true} is VALID [2022-02-20 23:46:51,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {2745#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {2745#true} is VALID [2022-02-20 23:46:51,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {2745#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {2745#true} is VALID [2022-02-20 23:46:51,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {2745#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {2745#true} is VALID [2022-02-20 23:46:51,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {2745#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {2745#true} is VALID [2022-02-20 23:46:51,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {2745#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {2745#true} is VALID [2022-02-20 23:46:51,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {2745#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {2745#true} is VALID [2022-02-20 23:46:51,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {2745#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {2747#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:46:51,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {2747#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !(1 == #valid[main_~s~0#1.base]); {2746#false} is VALID [2022-02-20 23:46:51,318 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:46:51,318 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:51,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649970509] [2022-02-20 23:46:51,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649970509] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:51,318 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:51,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:51,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953099752] [2022-02-20 23:46:51,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:51,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:46:51,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:51,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:51,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:51,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:51,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:51,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:51,330 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,538 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2022-02-20 23:46:51,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:51,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:46:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 23:46:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 23:46:51,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2022-02-20 23:46:51,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:51,654 INFO L225 Difference]: With dead ends: 171 [2022-02-20 23:46:51,655 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 23:46:51,655 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:46:51,656 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:51,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 199 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 23:46:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2022-02-20 23:46:51,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:51,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 167 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 166 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,661 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 167 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 166 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,662 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 167 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 166 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,666 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2022-02-20 23:46:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2022-02-20 23:46:51,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:51,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:51,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 166 states have internal predecessors, (196), 0 states have call successors, (0), 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 171 states. [2022-02-20 23:46:51,667 INFO L87 Difference]: Start difference. First operand has 167 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 166 states have internal predecessors, (196), 0 states have call successors, (0), 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 171 states. [2022-02-20 23:46:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,672 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2022-02-20 23:46:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2022-02-20 23:46:51,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:51,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:51,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:51,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 166 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2022-02-20 23:46:51,677 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 9 [2022-02-20 23:46:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:51,677 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2022-02-20 23:46:51,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2022-02-20 23:46:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:46:51,678 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:51,678 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:51,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:46:51,678 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:51,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:51,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1837237129, now seen corresponding path program 1 times [2022-02-20 23:46:51,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:51,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405353644] [2022-02-20 23:46:51,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:51,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:51,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {3430#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(18, 2); {3430#true} is VALID [2022-02-20 23:46:51,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {3430#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {3430#true} is VALID [2022-02-20 23:46:51,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {3430#true} is VALID [2022-02-20 23:46:51,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {3430#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {3430#true} is VALID [2022-02-20 23:46:51,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {3430#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {3430#true} is VALID [2022-02-20 23:46:51,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {3430#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {3430#true} is VALID [2022-02-20 23:46:51,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {3430#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {3430#true} is VALID [2022-02-20 23:46:51,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {3430#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {3432#(and (= (+ (select |#length| |ULTIMATE.start_main_~s~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:51,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {3432#(and (= (+ (select |#length| |ULTIMATE.start_main_~s~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(4 + main_~s~0#1.offset <= #length[main_~s~0#1.base] && 0 <= main_~s~0#1.offset); {3431#false} is VALID [2022-02-20 23:46:51,747 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:46:51,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:51,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405353644] [2022-02-20 23:46:51,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405353644] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:51,748 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:51,748 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:51,748 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429767092] [2022-02-20 23:46:51,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:51,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:46:51,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:51,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:51,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:51,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:51,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:51,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:51,758 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,965 INFO L93 Difference]: Finished difference Result 169 states and 196 transitions. [2022-02-20 23:46:51,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:51,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:46:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2022-02-20 23:46:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2022-02-20 23:46:51,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 145 transitions. [2022-02-20 23:46:52,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:52,085 INFO L225 Difference]: With dead ends: 169 [2022-02-20 23:46:52,085 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 23:46:52,086 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:46:52,086 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 7 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:52,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 189 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:52,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 23:46:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2022-02-20 23:46:52,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:52,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 165 states, 115 states have (on average 1.6782608695652175) internal successors, (193), 164 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,091 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 165 states, 115 states have (on average 1.6782608695652175) internal successors, (193), 164 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,092 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 165 states, 115 states have (on average 1.6782608695652175) internal successors, (193), 164 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,096 INFO L93 Difference]: Finished difference Result 169 states and 196 transitions. [2022-02-20 23:46:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2022-02-20 23:46:52,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:52,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:52,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 115 states have (on average 1.6782608695652175) internal successors, (193), 164 states have internal predecessors, (193), 0 states have call successors, (0), 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 169 states. [2022-02-20 23:46:52,097 INFO L87 Difference]: Start difference. First operand has 165 states, 115 states have (on average 1.6782608695652175) internal successors, (193), 164 states have internal predecessors, (193), 0 states have call successors, (0), 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 169 states. [2022-02-20 23:46:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,101 INFO L93 Difference]: Finished difference Result 169 states and 196 transitions. [2022-02-20 23:46:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2022-02-20 23:46:52,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:52,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:52,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:52,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 115 states have (on average 1.6782608695652175) internal successors, (193), 164 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 193 transitions. [2022-02-20 23:46:52,107 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 193 transitions. Word has length 9 [2022-02-20 23:46:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:52,107 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 193 transitions. [2022-02-20 23:46:52,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 193 transitions. [2022-02-20 23:46:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:46:52,108 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:52,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:52,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:46:52,108 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:52,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash 243138738, now seen corresponding path program 1 times [2022-02-20 23:46:52,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:52,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068601581] [2022-02-20 23:46:52,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:52,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:52,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {4107#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(18, 2); {4107#true} is VALID [2022-02-20 23:46:52,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {4107#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {4107#true} is VALID [2022-02-20 23:46:52,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {4107#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {4107#true} is VALID [2022-02-20 23:46:52,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {4107#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {4107#true} is VALID [2022-02-20 23:46:52,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {4107#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {4107#true} is VALID [2022-02-20 23:46:52,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {4107#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {4107#true} is VALID [2022-02-20 23:46:52,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {4107#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {4107#true} is VALID [2022-02-20 23:46:52,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {4107#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {4109#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:46:52,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {4109#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {4109#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:46:52,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {4109#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L561-1 {4109#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:46:52,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {4109#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {4108#false} is VALID [2022-02-20 23:46:52,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {4108#false} main_#res#1 := 0; {4108#false} is VALID [2022-02-20 23:46:52,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {4108#false} assume !(#valid == main_old_#valid#1); {4108#false} is VALID [2022-02-20 23:46:52,158 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:46:52,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:52,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068601581] [2022-02-20 23:46:52,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068601581] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:52,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:52,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:52,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364948233] [2022-02-20 23:46:52,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:52,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:46:52,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:52,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:46:52,169 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:46:52,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:52,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:52,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:52,170 INFO L87 Difference]: Start difference. First operand 165 states and 193 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:46:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,313 INFO L93 Difference]: Finished difference Result 166 states and 193 transitions. [2022-02-20 23:46:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:52,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:46:52,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:46:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 23:46:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:46:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 23:46:52,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2022-02-20 23:46:52,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:52,421 INFO L225 Difference]: With dead ends: 166 [2022-02-20 23:46:52,421 INFO L226 Difference]: Without dead ends: 166 [2022-02-20 23:46:52,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:46:52,422 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 2 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:52,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 254 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-02-20 23:46:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2022-02-20 23:46:52,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:52,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 165 states, 115 states have (on average 1.6695652173913043) internal successors, (192), 164 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,426 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 165 states, 115 states have (on average 1.6695652173913043) internal successors, (192), 164 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,426 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 165 states, 115 states have (on average 1.6695652173913043) internal successors, (192), 164 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,430 INFO L93 Difference]: Finished difference Result 166 states and 193 transitions. [2022-02-20 23:46:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 193 transitions. [2022-02-20 23:46:52,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:52,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:52,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 115 states have (on average 1.6695652173913043) internal successors, (192), 164 states have internal predecessors, (192), 0 states have call successors, (0), 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 166 states. [2022-02-20 23:46:52,432 INFO L87 Difference]: Start difference. First operand has 165 states, 115 states have (on average 1.6695652173913043) internal successors, (192), 164 states have internal predecessors, (192), 0 states have call successors, (0), 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 166 states. [2022-02-20 23:46:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,436 INFO L93 Difference]: Finished difference Result 166 states and 193 transitions. [2022-02-20 23:46:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 193 transitions. [2022-02-20 23:46:52,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:52,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:52,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:52,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 115 states have (on average 1.6695652173913043) internal successors, (192), 164 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2022-02-20 23:46:52,441 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 13 [2022-02-20 23:46:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:52,441 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2022-02-20 23:46:52,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:46:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2022-02-20 23:46:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:46:52,442 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:52,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:52,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:46:52,442 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:52,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:52,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1052634445, now seen corresponding path program 1 times [2022-02-20 23:46:52,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:52,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478987257] [2022-02-20 23:46:52,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:52,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:52,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {4775#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(18, 2); {4775#true} is VALID [2022-02-20 23:46:52,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {4775#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {4775#true} is VALID [2022-02-20 23:46:52,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {4775#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {4775#true} is VALID [2022-02-20 23:46:52,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {4775#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {4775#true} is VALID [2022-02-20 23:46:52,517 INFO L290 TraceCheckUtils]: 4: Hoare triple {4775#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {4775#true} is VALID [2022-02-20 23:46:52,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {4775#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {4775#true} is VALID [2022-02-20 23:46:52,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {4775#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {4775#true} is VALID [2022-02-20 23:46:52,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {4775#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {4775#true} is VALID [2022-02-20 23:46:52,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {4775#true} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {4777#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:46:52,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {4777#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L561-1 {4777#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:46:52,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {4777#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {4778#(and (= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (select |#valid| |ULTIMATE.start_main_~st~0#1.base|)))} is VALID [2022-02-20 23:46:52,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {4778#(and (= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (select |#valid| |ULTIMATE.start_main_~st~0#1.base|)))} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L565 {4779#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) 1)} is VALID [2022-02-20 23:46:52,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {4779#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) 1)} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem26#1.base, main_#t~mem26#1.offset;havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {4779#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) 1)} is VALID [2022-02-20 23:46:52,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {4779#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) 1)} assume !(1 == #valid[main_~st~0#1.base]); {4776#false} is VALID [2022-02-20 23:46:52,521 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:46:52,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:52,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478987257] [2022-02-20 23:46:52,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478987257] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:52,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:52,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:52,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334429866] [2022-02-20 23:46:52,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:52,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:46:52,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:52,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,534 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:46:52,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:52,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:52,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:52,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:52,536 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,876 INFO L93 Difference]: Finished difference Result 178 states and 206 transitions. [2022-02-20 23:46:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:52,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:46:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2022-02-20 23:46:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2022-02-20 23:46:52,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 160 transitions. [2022-02-20 23:46:53,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:53,009 INFO L225 Difference]: With dead ends: 178 [2022-02-20 23:46:53,009 INFO L226 Difference]: Without dead ends: 178 [2022-02-20 23:46:53,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:53,010 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 57 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:53,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 241 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:53,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-02-20 23:46:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 162. [2022-02-20 23:46:53,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:53,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 162 states, 117 states have (on average 1.623931623931624) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,013 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 162 states, 117 states have (on average 1.623931623931624) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,014 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 162 states, 117 states have (on average 1.623931623931624) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,017 INFO L93 Difference]: Finished difference Result 178 states and 206 transitions. [2022-02-20 23:46:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2022-02-20 23:46:53,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 117 states have (on average 1.623931623931624) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 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 178 states. [2022-02-20 23:46:53,019 INFO L87 Difference]: Start difference. First operand has 162 states, 117 states have (on average 1.623931623931624) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 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 178 states. [2022-02-20 23:46:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,022 INFO L93 Difference]: Finished difference Result 178 states and 206 transitions. [2022-02-20 23:46:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2022-02-20 23:46:53,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:53,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.623931623931624) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 190 transitions. [2022-02-20 23:46:53,026 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 190 transitions. Word has length 14 [2022-02-20 23:46:53,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:53,027 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 190 transitions. [2022-02-20 23:46:53,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2022-02-20 23:46:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:46:53,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:53,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:53,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:46:53,028 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1052634444, now seen corresponding path program 1 times [2022-02-20 23:46:53,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:53,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838132925] [2022-02-20 23:46:53,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:53,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:53,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {5478#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(18, 2); {5478#true} is VALID [2022-02-20 23:46:53,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {5478#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {5478#true} is VALID [2022-02-20 23:46:53,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {5478#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {5478#true} is VALID [2022-02-20 23:46:53,145 INFO L290 TraceCheckUtils]: 3: Hoare triple {5478#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {5478#true} is VALID [2022-02-20 23:46:53,145 INFO L290 TraceCheckUtils]: 4: Hoare triple {5478#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {5478#true} is VALID [2022-02-20 23:46:53,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {5478#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {5478#true} is VALID [2022-02-20 23:46:53,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {5478#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {5478#true} is VALID [2022-02-20 23:46:53,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {5478#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {5480#(= |ULTIMATE.start_main_~s~0#1.offset| 0)} is VALID [2022-02-20 23:46:53,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {5480#(= |ULTIMATE.start_main_~s~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {5480#(= |ULTIMATE.start_main_~s~0#1.offset| 0)} is VALID [2022-02-20 23:46:53,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {5480#(= |ULTIMATE.start_main_~s~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L561-1 {5481#(and (<= (+ |ULTIMATE.start_main_~s~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:53,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {5481#(and (<= (+ |ULTIMATE.start_main_~s~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {5482#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~s~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:53,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {5482#(and (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~s~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L565 {5483#(and (= |ULTIMATE.start_main_~st~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~st~0#1.base|)))} is VALID [2022-02-20 23:46:53,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {5483#(and (= |ULTIMATE.start_main_~st~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~st~0#1.base|)))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem26#1.base, main_#t~mem26#1.offset;havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {5483#(and (= |ULTIMATE.start_main_~st~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~st~0#1.base|)))} is VALID [2022-02-20 23:46:53,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {5483#(and (= |ULTIMATE.start_main_~st~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~st~0#1.base|)))} assume !(4 + (4 + main_~st~0#1.offset) <= #length[main_~st~0#1.base] && 0 <= 4 + main_~st~0#1.offset); {5479#false} is VALID [2022-02-20 23:46:53,149 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:46:53,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:53,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838132925] [2022-02-20 23:46:53,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838132925] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:53,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:53,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:46:53,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972937900] [2022-02-20 23:46:53,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:53,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:46:53,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:53,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:46:53,162 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:46:53,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:46:53,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:53,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:46:53,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:46:53,162 INFO L87 Difference]: Start difference. First operand 162 states and 190 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:46:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,658 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-02-20 23:46:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:46:53,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:46:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:53,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:46:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2022-02-20 23:46:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:46:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2022-02-20 23:46:53,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 183 transitions. [2022-02-20 23:46:53,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:53,821 INFO L225 Difference]: With dead ends: 201 [2022-02-20 23:46:53,821 INFO L226 Difference]: Without dead ends: 201 [2022-02-20 23:46:53,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:53,821 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 70 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:53,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 305 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-02-20 23:46:53,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 169. [2022-02-20 23:46:53,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:53,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 169 states, 128 states have (on average 1.5859375) internal successors, (203), 168 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,825 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 169 states, 128 states have (on average 1.5859375) internal successors, (203), 168 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,825 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 169 states, 128 states have (on average 1.5859375) internal successors, (203), 168 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,829 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-02-20 23:46:53,829 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2022-02-20 23:46:53,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 128 states have (on average 1.5859375) internal successors, (203), 168 states have internal predecessors, (203), 0 states have call successors, (0), 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 201 states. [2022-02-20 23:46:53,830 INFO L87 Difference]: Start difference. First operand has 169 states, 128 states have (on average 1.5859375) internal successors, (203), 168 states have internal predecessors, (203), 0 states have call successors, (0), 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 201 states. [2022-02-20 23:46:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,834 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-02-20 23:46:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2022-02-20 23:46:53,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:53,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 128 states have (on average 1.5859375) internal successors, (203), 168 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 203 transitions. [2022-02-20 23:46:53,838 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 203 transitions. Word has length 14 [2022-02-20 23:46:53,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:53,838 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 203 transitions. [2022-02-20 23:46:53,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:46:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 203 transitions. [2022-02-20 23:46:53,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:46:53,839 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:53,839 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:53,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:46:53,839 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:53,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash 395262676, now seen corresponding path program 1 times [2022-02-20 23:46:53,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:53,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806382014] [2022-02-20 23:46:53,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:53,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:53,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {6262#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(18, 2); {6262#true} is VALID [2022-02-20 23:46:53,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {6262#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {6262#true} is VALID [2022-02-20 23:46:53,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {6262#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {6262#true} is VALID [2022-02-20 23:46:53,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {6262#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {6262#true} is VALID [2022-02-20 23:46:53,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {6262#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {6262#true} is VALID [2022-02-20 23:46:53,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {6262#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {6262#true} is VALID [2022-02-20 23:46:53,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {6262#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {6262#true} is VALID [2022-02-20 23:46:53,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {6262#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L541-2 {6262#true} is VALID [2022-02-20 23:46:53,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {6262#true} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {6262#true} is VALID [2022-02-20 23:46:53,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {6262#true} assume !main_#t~short7#1; {6264#(not |ULTIMATE.start_main_#t~short7#1|)} is VALID [2022-02-20 23:46:53,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {6264#(not |ULTIMATE.start_main_#t~short7#1|)} assume !!main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647; {6263#false} is VALID [2022-02-20 23:46:53,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {6263#false} assume !(0 != main_#t~nondet8#1);havoc main_#t~nondet8#1; {6263#false} is VALID [2022-02-20 23:46:53,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {6263#false} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L544 {6263#false} is VALID [2022-02-20 23:46:53,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {6263#false} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {6263#false} is VALID [2022-02-20 23:46:53,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {6263#false} assume !(1 == #valid[main_~n~0#1.base]); {6263#false} is VALID [2022-02-20 23:46:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:53,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:53,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806382014] [2022-02-20 23:46:53,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806382014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:53,877 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:53,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:53,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882524079] [2022-02-20 23:46:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:53,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:46:53,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:53,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:46:53,890 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:46:53,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:53,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:53,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:53,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:53,891 INFO L87 Difference]: Start difference. First operand 169 states and 203 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:46:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,000 INFO L93 Difference]: Finished difference Result 171 states and 205 transitions. [2022-02-20 23:46:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:54,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:46:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:46:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 23:46:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:46:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 23:46:54,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2022-02-20 23:46:54,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:54,098 INFO L225 Difference]: With dead ends: 171 [2022-02-20 23:46:54,098 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 23:46:54,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:46:54,099 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:54,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 23:46:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-02-20 23:46:54,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:54,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 171 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,103 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 171 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,103 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 171 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,106 INFO L93 Difference]: Finished difference Result 171 states and 205 transitions. [2022-02-20 23:46:54,106 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2022-02-20 23:46:54,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 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 171 states. [2022-02-20 23:46:54,107 INFO L87 Difference]: Start difference. First operand has 171 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 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 171 states. [2022-02-20 23:46:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,110 INFO L93 Difference]: Finished difference Result 171 states and 205 transitions. [2022-02-20 23:46:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2022-02-20 23:46:54,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:54,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2022-02-20 23:46:54,114 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 15 [2022-02-20 23:46:54,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:54,114 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2022-02-20 23:46:54,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:46:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2022-02-20 23:46:54,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:46:54,115 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:54,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:54,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:46:54,116 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:54,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1476383815, now seen corresponding path program 1 times [2022-02-20 23:46:54,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:54,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371650] [2022-02-20 23:46:54,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:54,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:54,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {6951#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(18, 2); {6951#true} is VALID [2022-02-20 23:46:54,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {6951#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {6951#true} is VALID [2022-02-20 23:46:54,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {6951#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {6951#true} is VALID [2022-02-20 23:46:54,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {6951#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {6951#true} is VALID [2022-02-20 23:46:54,181 INFO L290 TraceCheckUtils]: 4: Hoare triple {6951#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {6951#true} is VALID [2022-02-20 23:46:54,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {6951#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {6951#true} is VALID [2022-02-20 23:46:54,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {6951#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {6951#true} is VALID [2022-02-20 23:46:54,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {6951#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {6953#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {6953#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {6953#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {6953#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L561-1 {6953#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {6953#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {6954#(and (= (+ (* (- 1) |ULTIMATE.start_main_~st~0#1.base|) |ULTIMATE.start_main_~s~0#1.base|) 0) (<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:54,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {6954#(and (= (+ (* (- 1) |ULTIMATE.start_main_~st~0#1.base|) |ULTIMATE.start_main_~s~0#1.base|) 0) (<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L565 {6955#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {6955#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem26#1.base, main_#t~mem26#1.offset;havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {6955#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {6955#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem27#1.base, main_#t~mem27#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L566 {6955#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {6955#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem27#1.base, main_#t~mem27#1.offset;havoc main_#t~mem27#1.base, main_#t~mem27#1.offset; {6955#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {6955#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~st~0#1.offset; {6955#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {6955#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~st~0#1.base < #StackHeapBarrier); {6952#false} is VALID [2022-02-20 23:46:54,189 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:46:54,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:54,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371650] [2022-02-20 23:46:54,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:54,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:54,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:54,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102822874] [2022-02-20 23:46:54,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:54,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:46:54,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:54,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:54,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:54,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:54,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:54,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:54,206 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,480 INFO L93 Difference]: Finished difference Result 185 states and 213 transitions. [2022-02-20 23:46:54,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:46:54,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:46:54,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:54,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2022-02-20 23:46:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2022-02-20 23:46:54,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 155 transitions. [2022-02-20 23:46:54,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:54,604 INFO L225 Difference]: With dead ends: 185 [2022-02-20 23:46:54,605 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 23:46:54,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:46:54,606 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 60 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:54,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 309 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:54,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 23:46:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2022-02-20 23:46:54,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:54,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 172 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 171 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,609 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 172 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 171 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,610 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 172 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 171 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,613 INFO L93 Difference]: Finished difference Result 185 states and 213 transitions. [2022-02-20 23:46:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 213 transitions. [2022-02-20 23:46:54,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 171 states have internal predecessors, (206), 0 states have call successors, (0), 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 185 states. [2022-02-20 23:46:54,614 INFO L87 Difference]: Start difference. First operand has 172 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 171 states have internal predecessors, (206), 0 states have call successors, (0), 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 185 states. [2022-02-20 23:46:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,617 INFO L93 Difference]: Finished difference Result 185 states and 213 transitions. [2022-02-20 23:46:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 213 transitions. [2022-02-20 23:46:54,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:54,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 171 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2022-02-20 23:46:54,621 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 206 transitions. Word has length 17 [2022-02-20 23:46:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:54,621 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 206 transitions. [2022-02-20 23:46:54,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 206 transitions. [2022-02-20 23:46:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:46:54,622 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:54,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:54,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:46:54,622 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:54,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:54,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1645245929, now seen corresponding path program 1 times [2022-02-20 23:46:54,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:54,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732586791] [2022-02-20 23:46:54,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:54,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:54,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {7687#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(18, 2); {7687#true} is VALID [2022-02-20 23:46:54,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {7687#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {7687#true} is VALID [2022-02-20 23:46:54,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {7687#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {7689#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} is VALID [2022-02-20 23:46:54,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {7689#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {7689#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} is VALID [2022-02-20 23:46:54,707 INFO L290 TraceCheckUtils]: 4: Hoare triple {7689#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {7689#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} is VALID [2022-02-20 23:46:54,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {7689#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {7689#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} is VALID [2022-02-20 23:46:54,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {7689#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {7690#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:46:54,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {7690#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L541-2 {7691#(and (= |ULTIMATE.start_main_#t~mem5#1.base| 0) (= |ULTIMATE.start_main_#t~mem5#1.offset| 0))} is VALID [2022-02-20 23:46:54,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {7691#(and (= |ULTIMATE.start_main_#t~mem5#1.base| 0) (= |ULTIMATE.start_main_#t~mem5#1.offset| 0))} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {7692#(not |ULTIMATE.start_main_#t~short7#1|)} is VALID [2022-02-20 23:46:54,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {7692#(not |ULTIMATE.start_main_#t~short7#1|)} assume main_#t~short7#1; {7688#false} is VALID [2022-02-20 23:46:54,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {7688#false} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L540-3 {7688#false} is VALID [2022-02-20 23:46:54,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {7688#false} main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {7688#false} is VALID [2022-02-20 23:46:54,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {7688#false} assume !!main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647; {7688#false} is VALID [2022-02-20 23:46:54,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {7688#false} assume !(0 != main_#t~nondet8#1);havoc main_#t~nondet8#1; {7688#false} is VALID [2022-02-20 23:46:54,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {7688#false} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L544 {7688#false} is VALID [2022-02-20 23:46:54,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {7688#false} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {7688#false} is VALID [2022-02-20 23:46:54,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {7688#false} assume !(1 == #valid[main_~n~0#1.base]); {7688#false} is VALID [2022-02-20 23:46:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:54,712 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:54,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732586791] [2022-02-20 23:46:54,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732586791] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:54,712 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:54,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:46:54,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188061038] [2022-02-20 23:46:54,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:54,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:46:54,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:54,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:54,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:46:54,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:54,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:46:54,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:46:54,728 INFO L87 Difference]: Start difference. First operand 172 states and 206 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:55,279 INFO L93 Difference]: Finished difference Result 209 states and 249 transitions. [2022-02-20 23:46:55,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:46:55,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:46:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2022-02-20 23:46:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2022-02-20 23:46:55,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 172 transitions. [2022-02-20 23:46:55,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:55,418 INFO L225 Difference]: With dead ends: 209 [2022-02-20 23:46:55,418 INFO L226 Difference]: Without dead ends: 209 [2022-02-20 23:46:55,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:46:55,419 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 50 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:55,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 477 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-02-20 23:46:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 186. [2022-02-20 23:46:55,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:55,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 186 states, 145 states have (on average 1.5517241379310345) internal successors, (225), 185 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,422 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 186 states, 145 states have (on average 1.5517241379310345) internal successors, (225), 185 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,422 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 186 states, 145 states have (on average 1.5517241379310345) internal successors, (225), 185 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:55,426 INFO L93 Difference]: Finished difference Result 209 states and 249 transitions. [2022-02-20 23:46:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 249 transitions. [2022-02-20 23:46:55,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:55,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:55,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 145 states have (on average 1.5517241379310345) internal successors, (225), 185 states have internal predecessors, (225), 0 states have call successors, (0), 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 209 states. [2022-02-20 23:46:55,427 INFO L87 Difference]: Start difference. First operand has 186 states, 145 states have (on average 1.5517241379310345) internal successors, (225), 185 states have internal predecessors, (225), 0 states have call successors, (0), 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 209 states. [2022-02-20 23:46:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:55,431 INFO L93 Difference]: Finished difference Result 209 states and 249 transitions. [2022-02-20 23:46:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 249 transitions. [2022-02-20 23:46:55,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:55,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:55,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:55,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 145 states have (on average 1.5517241379310345) internal successors, (225), 185 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 225 transitions. [2022-02-20 23:46:55,435 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 225 transitions. Word has length 17 [2022-02-20 23:46:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:55,435 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 225 transitions. [2022-02-20 23:46:55,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 225 transitions. [2022-02-20 23:46:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:46:55,436 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:55,436 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:55,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:46:55,436 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:55,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:55,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1465631940, now seen corresponding path program 1 times [2022-02-20 23:46:55,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:55,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507674885] [2022-02-20 23:46:55,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:55,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:55,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {8514#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(18, 2); {8514#true} is VALID [2022-02-20 23:46:55,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {8514#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {8516#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {8516#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {8516#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {8516#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {8516#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {8516#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {8516#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {8516#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {8516#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {8516#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {8516#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {8516#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {8517#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:55,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {8517#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {8517#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:55,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {8517#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L561-1 {8518#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:55,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {8518#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {8519#(and (= |ULTIMATE.start_main_~st~0#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~st~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:55,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {8519#(and (= |ULTIMATE.start_main_~st~0#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~st~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L565 {8520#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~st~0#1.base|)))} is VALID [2022-02-20 23:46:55,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {8520#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~st~0#1.base|)))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem26#1.base, main_#t~mem26#1.offset;havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {8520#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~st~0#1.base|)))} is VALID [2022-02-20 23:46:55,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {8520#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~st~0#1.base|)))} SUMMARY for call main_#t~mem27#1.base, main_#t~mem27#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L566 {8521#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem27#1.base|) 1) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (not (= |ULTIMATE.start_main_~st~0#1.base| |ULTIMATE.start_main_#t~mem27#1.base|)))} is VALID [2022-02-20 23:46:55,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {8521#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem27#1.base|) 1) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (not (= |ULTIMATE.start_main_~st~0#1.base| |ULTIMATE.start_main_#t~mem27#1.base|)))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem27#1.base, main_#t~mem27#1.offset;havoc main_#t~mem27#1.base, main_#t~mem27#1.offset; {8522#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {8522#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} assume 0 == main_~st~0#1.offset; {8523#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {8523#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} assume main_~st~0#1.base < #StackHeapBarrier; {8523#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {8523#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {8524#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:46:55,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {8524#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !(1 == #valid[main_~n~0#1.base]); {8515#false} is VALID [2022-02-20 23:46:55,687 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:46:55,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:55,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507674885] [2022-02-20 23:46:55,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507674885] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:55,687 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:55,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:46:55,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186849841] [2022-02-20 23:46:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:55,688 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:55,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:55,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:55,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:46:55,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:55,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:46:55,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:46:55,707 INFO L87 Difference]: Start difference. First operand 186 states and 225 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:57,006 INFO L93 Difference]: Finished difference Result 207 states and 246 transitions. [2022-02-20 23:46:57,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:46:57,006 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:57,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 163 transitions. [2022-02-20 23:46:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 163 transitions. [2022-02-20 23:46:57,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 163 transitions. [2022-02-20 23:46:57,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:57,166 INFO L225 Difference]: With dead ends: 207 [2022-02-20 23:46:57,166 INFO L226 Difference]: Without dead ends: 207 [2022-02-20 23:46:57,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:46:57,168 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 239 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:57,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 340 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:46:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-02-20 23:46:57,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 191. [2022-02-20 23:46:57,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:57,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 191 states, 150 states have (on average 1.54) internal successors, (231), 190 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,172 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 191 states, 150 states have (on average 1.54) internal successors, (231), 190 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,173 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 191 states, 150 states have (on average 1.54) internal successors, (231), 190 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:57,176 INFO L93 Difference]: Finished difference Result 207 states and 246 transitions. [2022-02-20 23:46:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 246 transitions. [2022-02-20 23:46:57,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:57,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:57,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 150 states have (on average 1.54) internal successors, (231), 190 states have internal predecessors, (231), 0 states have call successors, (0), 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 207 states. [2022-02-20 23:46:57,178 INFO L87 Difference]: Start difference. First operand has 191 states, 150 states have (on average 1.54) internal successors, (231), 190 states have internal predecessors, (231), 0 states have call successors, (0), 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 207 states. [2022-02-20 23:46:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:57,181 INFO L93 Difference]: Finished difference Result 207 states and 246 transitions. [2022-02-20 23:46:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 246 transitions. [2022-02-20 23:46:57,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:57,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:57,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:57,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.54) internal successors, (231), 190 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 231 transitions. [2022-02-20 23:46:57,185 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 231 transitions. Word has length 19 [2022-02-20 23:46:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:57,186 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 231 transitions. [2022-02-20 23:46:57,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 231 transitions. [2022-02-20 23:46:57,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:46:57,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:57,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:57,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:46:57,187 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:57,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1465631939, now seen corresponding path program 1 times [2022-02-20 23:46:57,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:57,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128815046] [2022-02-20 23:46:57,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:57,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:57,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {9353#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(18, 2); {9353#true} is VALID [2022-02-20 23:46:57,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {9353#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {9355#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {9355#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {9356#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:57,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {9356#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {9356#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:57,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {9356#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {9356#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:57,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {9356#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {9356#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:57,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {9356#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {9356#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:57,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {9356#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {9357#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {9357#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {9357#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {9357#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) 12) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L561-1 {9358#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) 12) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {9358#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) 12) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {9359#(and (= |ULTIMATE.start_main_~st~0#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {9359#(and (= |ULTIMATE.start_main_~st~0#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L565 {9360#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))))} is VALID [2022-02-20 23:46:57,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {9360#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem26#1.base, main_#t~mem26#1.offset;havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {9360#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))))} is VALID [2022-02-20 23:46:57,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {9360#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))))} SUMMARY for call main_#t~mem27#1.base, main_#t~mem27#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L566 {9361#(and (= |ULTIMATE.start_main_#t~mem27#1.offset| 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem27#1.base|) 12))} is VALID [2022-02-20 23:46:57,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {9361#(and (= |ULTIMATE.start_main_#t~mem27#1.offset| 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem27#1.base|) 12))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem27#1.base, main_#t~mem27#1.offset;havoc main_#t~mem27#1.base, main_#t~mem27#1.offset; {9362#(and (= (+ (select |#length| |ULTIMATE.start_main_~n~0#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {9362#(and (= (+ (select |#length| |ULTIMATE.start_main_~n~0#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume 0 == main_~st~0#1.offset; {9363#(and (= (+ (select |#length| |ULTIMATE.start_main_~n~0#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {9363#(and (= (+ (select |#length| |ULTIMATE.start_main_~n~0#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume main_~st~0#1.base < #StackHeapBarrier; {9363#(and (= (+ (select |#length| |ULTIMATE.start_main_~n~0#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {9363#(and (= (+ (select |#length| |ULTIMATE.start_main_~n~0#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {9363#(and (= (+ (select |#length| |ULTIMATE.start_main_~n~0#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {9363#(and (= (+ (select |#length| |ULTIMATE.start_main_~n~0#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume !(4 + main_~n~0#1.offset <= #length[main_~n~0#1.base] && 0 <= main_~n~0#1.offset); {9354#false} is VALID [2022-02-20 23:46:57,424 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:46:57,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:57,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128815046] [2022-02-20 23:46:57,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128815046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:57,425 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:57,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:46:57,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977391501] [2022-02-20 23:46:57,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:57,425 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:57,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:57,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:57,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:46:57,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:57,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:46:57,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:46:57,446 INFO L87 Difference]: Start difference. First operand 191 states and 231 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:58,914 INFO L93 Difference]: Finished difference Result 260 states and 295 transitions. [2022-02-20 23:46:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:46:58,915 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 255 transitions. [2022-02-20 23:46:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 255 transitions. [2022-02-20 23:46:58,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 255 transitions. [2022-02-20 23:46:59,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:59,164 INFO L225 Difference]: With dead ends: 260 [2022-02-20 23:46:59,164 INFO L226 Difference]: Without dead ends: 260 [2022-02-20 23:46:59,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:46:59,165 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 306 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:59,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 353 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:46:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-02-20 23:46:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 195. [2022-02-20 23:46:59,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:59,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 195 states, 154 states have (on average 1.5324675324675325) internal successors, (236), 194 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,168 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 195 states, 154 states have (on average 1.5324675324675325) internal successors, (236), 194 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,169 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 195 states, 154 states have (on average 1.5324675324675325) internal successors, (236), 194 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,176 INFO L93 Difference]: Finished difference Result 260 states and 295 transitions. [2022-02-20 23:46:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 295 transitions. [2022-02-20 23:46:59,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:59,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:59,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 154 states have (on average 1.5324675324675325) internal successors, (236), 194 states have internal predecessors, (236), 0 states have call successors, (0), 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 260 states. [2022-02-20 23:46:59,177 INFO L87 Difference]: Start difference. First operand has 195 states, 154 states have (on average 1.5324675324675325) internal successors, (236), 194 states have internal predecessors, (236), 0 states have call successors, (0), 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 260 states. [2022-02-20 23:46:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,182 INFO L93 Difference]: Finished difference Result 260 states and 295 transitions. [2022-02-20 23:46:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 295 transitions. [2022-02-20 23:46:59,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:59,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:59,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:59,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 154 states have (on average 1.5324675324675325) internal successors, (236), 194 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 236 transitions. [2022-02-20 23:46:59,186 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 236 transitions. Word has length 19 [2022-02-20 23:46:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:59,186 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 236 transitions. [2022-02-20 23:46:59,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 236 transitions. [2022-02-20 23:46:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:46:59,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:59,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:59,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:46:59,187 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:59,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:59,188 INFO L85 PathProgramCache]: Analyzing trace with hash -825042817, now seen corresponding path program 1 times [2022-02-20 23:46:59,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:59,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635241313] [2022-02-20 23:46:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:59,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:59,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {10361#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(18, 2); {10361#true} is VALID [2022-02-20 23:46:59,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {10361#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {10361#true} is VALID [2022-02-20 23:46:59,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {10361#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {10361#true} is VALID [2022-02-20 23:46:59,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {10361#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {10361#true} is VALID [2022-02-20 23:46:59,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {10361#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {10361#true} is VALID [2022-02-20 23:46:59,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {10361#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {10361#true} is VALID [2022-02-20 23:46:59,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {10361#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {10361#true} is VALID [2022-02-20 23:46:59,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {10361#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L541-2 {10361#true} is VALID [2022-02-20 23:46:59,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {10361#true} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {10361#true} is VALID [2022-02-20 23:46:59,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {10361#true} assume !main_#t~short7#1; {10361#true} is VALID [2022-02-20 23:46:59,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {10361#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {10361#true} is VALID [2022-02-20 23:46:59,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {10361#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L540-8 {10361#true} is VALID [2022-02-20 23:46:59,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {10361#true} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {10361#true} is VALID [2022-02-20 23:46:59,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {10361#true} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {10361#true} is VALID [2022-02-20 23:46:59,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {10361#true} assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(12); {10363#(= (select |#valid| |ULTIMATE.start_main_#t~malloc14#1.base|) 1)} is VALID [2022-02-20 23:46:59,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {10363#(= (select |#valid| |ULTIMATE.start_main_#t~malloc14#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L547 {10364#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:59,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {10364#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {10364#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:59,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {10364#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L548 {10365#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} is VALID [2022-02-20 23:46:59,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {10365#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} assume !(1 == #valid[main_#t~mem15#1.base]); {10362#false} is VALID [2022-02-20 23:46:59,250 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:46:59,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:59,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635241313] [2022-02-20 23:46:59,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635241313] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:59,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:59,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:59,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814432908] [2022-02-20 23:46:59,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:59,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:59,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:59,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:59,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:59,264 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:59,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:59,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:59,265 INFO L87 Difference]: Start difference. First operand 195 states and 236 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,601 INFO L93 Difference]: Finished difference Result 194 states and 234 transitions. [2022-02-20 23:46:59,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:46:59,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2022-02-20 23:46:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2022-02-20 23:46:59,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 127 transitions. [2022-02-20 23:46:59,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:59,712 INFO L225 Difference]: With dead ends: 194 [2022-02-20 23:46:59,713 INFO L226 Difference]: Without dead ends: 194 [2022-02-20 23:46:59,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:46:59,713 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 6 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:59,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 302 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:59,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-02-20 23:46:59,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-02-20 23:46:59,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:59,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 194 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 193 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,720 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 194 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 193 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,721 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 194 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 193 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,724 INFO L93 Difference]: Finished difference Result 194 states and 234 transitions. [2022-02-20 23:46:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 234 transitions. [2022-02-20 23:46:59,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:59,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:59,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 193 states have internal predecessors, (234), 0 states have call successors, (0), 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 194 states. [2022-02-20 23:46:59,732 INFO L87 Difference]: Start difference. First operand has 194 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 193 states have internal predecessors, (234), 0 states have call successors, (0), 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 194 states. [2022-02-20 23:46:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,737 INFO L93 Difference]: Finished difference Result 194 states and 234 transitions. [2022-02-20 23:46:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 234 transitions. [2022-02-20 23:46:59,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:59,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:59,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:59,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 154 states have (on average 1.5194805194805194) internal successors, (234), 193 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 234 transitions. [2022-02-20 23:46:59,741 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 234 transitions. Word has length 19 [2022-02-20 23:46:59,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:59,741 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 234 transitions. [2022-02-20 23:46:59,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 234 transitions. [2022-02-20 23:46:59,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:46:59,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:59,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:59,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:46:59,743 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:46:59,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:59,744 INFO L85 PathProgramCache]: Analyzing trace with hash -825042816, now seen corresponding path program 1 times [2022-02-20 23:46:59,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:59,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301566882] [2022-02-20 23:46:59,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:59,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:59,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {11148#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(18, 2); {11148#true} is VALID [2022-02-20 23:46:59,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {11148#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {11148#true} is VALID [2022-02-20 23:46:59,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {11148#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {11148#true} is VALID [2022-02-20 23:46:59,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {11148#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {11148#true} is VALID [2022-02-20 23:46:59,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {11148#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {11148#true} is VALID [2022-02-20 23:46:59,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {11148#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {11148#true} is VALID [2022-02-20 23:46:59,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {11148#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {11148#true} is VALID [2022-02-20 23:46:59,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {11148#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L541-2 {11148#true} is VALID [2022-02-20 23:46:59,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {11148#true} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {11148#true} is VALID [2022-02-20 23:46:59,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {11148#true} assume !main_#t~short7#1; {11148#true} is VALID [2022-02-20 23:46:59,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {11148#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {11148#true} is VALID [2022-02-20 23:46:59,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {11148#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L540-8 {11148#true} is VALID [2022-02-20 23:46:59,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {11148#true} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {11148#true} is VALID [2022-02-20 23:46:59,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {11148#true} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {11148#true} is VALID [2022-02-20 23:46:59,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {11148#true} assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(12); {11150#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc14#1.base|) 12) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0))} is VALID [2022-02-20 23:46:59,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {11150#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc14#1.base|) 12) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L547 {11151#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:46:59,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {11151#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {11151#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:46:59,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {11151#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L548 {11152#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_#t~mem15#1.offset| 0))} is VALID [2022-02-20 23:46:59,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {11152#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_#t~mem15#1.offset| 0))} assume !(4 + main_#t~mem15#1.offset <= #length[main_#t~mem15#1.base] && 0 <= main_#t~mem15#1.offset); {11149#false} is VALID [2022-02-20 23:46:59,824 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:46:59,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:59,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301566882] [2022-02-20 23:46:59,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301566882] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:59,826 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:59,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:59,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712902849] [2022-02-20 23:46:59,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:59,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:46:59,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:59,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:59,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:59,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:59,841 INFO L87 Difference]: Start difference. First operand 194 states and 234 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:00,280 INFO L93 Difference]: Finished difference Result 193 states and 232 transitions. [2022-02-20 23:47:00,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:00,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:47:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:00,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2022-02-20 23:47:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2022-02-20 23:47:00,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 126 transitions. [2022-02-20 23:47:00,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:00,361 INFO L225 Difference]: With dead ends: 193 [2022-02-20 23:47:00,361 INFO L226 Difference]: Without dead ends: 193 [2022-02-20 23:47:00,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:00,362 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 4 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:00,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 280 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-02-20 23:47:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2022-02-20 23:47:00,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:00,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 193 states, 154 states have (on average 1.5064935064935066) internal successors, (232), 192 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,366 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 193 states, 154 states have (on average 1.5064935064935066) internal successors, (232), 192 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,366 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 193 states, 154 states have (on average 1.5064935064935066) internal successors, (232), 192 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:00,369 INFO L93 Difference]: Finished difference Result 193 states and 232 transitions. [2022-02-20 23:47:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 232 transitions. [2022-02-20 23:47:00,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:00,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:00,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 154 states have (on average 1.5064935064935066) internal successors, (232), 192 states have internal predecessors, (232), 0 states have call successors, (0), 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 193 states. [2022-02-20 23:47:00,371 INFO L87 Difference]: Start difference. First operand has 193 states, 154 states have (on average 1.5064935064935066) internal successors, (232), 192 states have internal predecessors, (232), 0 states have call successors, (0), 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 193 states. [2022-02-20 23:47:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:00,374 INFO L93 Difference]: Finished difference Result 193 states and 232 transitions. [2022-02-20 23:47:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 232 transitions. [2022-02-20 23:47:00,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:00,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:00,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:00,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.5064935064935066) internal successors, (232), 192 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 232 transitions. [2022-02-20 23:47:00,378 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 232 transitions. Word has length 19 [2022-02-20 23:47:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:00,378 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 232 transitions. [2022-02-20 23:47:00,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 232 transitions. [2022-02-20 23:47:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:00,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:00,379 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:00,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:47:00,379 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:00,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash -3442432, now seen corresponding path program 1 times [2022-02-20 23:47:00,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:00,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230061276] [2022-02-20 23:47:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:00,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:00,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {11931#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(18, 2); {11931#true} is VALID [2022-02-20 23:47:00,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {11931#true} is VALID [2022-02-20 23:47:00,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {11931#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {11931#true} is VALID [2022-02-20 23:47:00,442 INFO L290 TraceCheckUtils]: 3: Hoare triple {11931#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {11931#true} is VALID [2022-02-20 23:47:00,442 INFO L290 TraceCheckUtils]: 4: Hoare triple {11931#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {11931#true} is VALID [2022-02-20 23:47:00,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {11931#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {11931#true} is VALID [2022-02-20 23:47:00,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {11931#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {11931#true} is VALID [2022-02-20 23:47:00,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {11931#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {11931#true} is VALID [2022-02-20 23:47:00,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {11931#true} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {11931#true} is VALID [2022-02-20 23:47:00,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {11931#true} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L561-1 {11931#true} is VALID [2022-02-20 23:47:00,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {11931#true} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {11931#true} is VALID [2022-02-20 23:47:00,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {11931#true} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L565 {11931#true} is VALID [2022-02-20 23:47:00,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {11931#true} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem26#1.base, main_#t~mem26#1.offset;havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {11931#true} is VALID [2022-02-20 23:47:00,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {11931#true} SUMMARY for call main_#t~mem27#1.base, main_#t~mem27#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L566 {11931#true} is VALID [2022-02-20 23:47:00,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {11931#true} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem27#1.base, main_#t~mem27#1.offset;havoc main_#t~mem27#1.base, main_#t~mem27#1.offset; {11931#true} is VALID [2022-02-20 23:47:00,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {11931#true} assume 0 == main_~st~0#1.offset; {11931#true} is VALID [2022-02-20 23:47:00,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {11931#true} assume main_~st~0#1.base < #StackHeapBarrier; {11931#true} is VALID [2022-02-20 23:47:00,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {11931#true} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {11931#true} is VALID [2022-02-20 23:47:00,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {11931#true} SUMMARY for call main_#t~mem28#1.base, main_#t~mem28#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L568 {11933#(and (not (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 1) 0)) (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} is VALID [2022-02-20 23:47:00,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {11933#(and (not (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 1) 0)) (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} assume main_#t~mem28#1.base != 0 || main_#t~mem28#1.offset != 0;havoc main_#t~mem28#1.base, main_#t~mem28#1.offset;call main_#t~malloc29#1.base, main_#t~malloc29#1.offset := #Ultimate.allocOnHeap(8);main_~st~0#1.base, main_~st~0#1.offset := main_#t~malloc29#1.base, main_#t~malloc29#1.offset;havoc main_#t~malloc29#1.base, main_#t~malloc29#1.offset; {11934#(and (not (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 1) 0)) (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:00,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {11934#(and (not (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 1) 0)) (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset, 4); srcloc: L570 {11934#(and (not (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 1) 0)) (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:00,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {11934#(and (not (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 1) 0)) (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} assume !(4 + main_~n~0#1.offset <= #length[main_~n~0#1.base] && 0 <= main_~n~0#1.offset); {11932#false} is VALID [2022-02-20 23:47:00,447 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:47:00,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:00,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230061276] [2022-02-20 23:47:00,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230061276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:00,448 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:00,448 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:00,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833961187] [2022-02-20 23:47:00,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:00,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:00,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:00,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:00,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:00,466 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:00,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:00,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:00,467 INFO L87 Difference]: Start difference. First operand 193 states and 232 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:00,701 INFO L93 Difference]: Finished difference Result 189 states and 229 transitions. [2022-02-20 23:47:00,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:47:00,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-02-20 23:47:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-02-20 23:47:00,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 134 transitions. [2022-02-20 23:47:00,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:00,810 INFO L225 Difference]: With dead ends: 189 [2022-02-20 23:47:00,810 INFO L226 Difference]: Without dead ends: 189 [2022-02-20 23:47:00,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:47:00,811 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 168 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:00,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 81 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-02-20 23:47:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2022-02-20 23:47:00,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:00,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 185 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 184 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,814 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 185 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 184 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,814 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 185 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 184 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:00,817 INFO L93 Difference]: Finished difference Result 189 states and 229 transitions. [2022-02-20 23:47:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 229 transitions. [2022-02-20 23:47:00,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:00,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:00,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 184 states have internal predecessors, (224), 0 states have call successors, (0), 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 189 states. [2022-02-20 23:47:00,818 INFO L87 Difference]: Start difference. First operand has 185 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 184 states have internal predecessors, (224), 0 states have call successors, (0), 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 189 states. [2022-02-20 23:47:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:00,822 INFO L93 Difference]: Finished difference Result 189 states and 229 transitions. [2022-02-20 23:47:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 229 transitions. [2022-02-20 23:47:00,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:00,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:00,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:00,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 184 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 224 transitions. [2022-02-20 23:47:00,826 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 224 transitions. Word has length 22 [2022-02-20 23:47:00,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:00,826 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 224 transitions. [2022-02-20 23:47:00,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 224 transitions. [2022-02-20 23:47:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:00,827 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:00,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:00,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:47:00,828 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:00,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:00,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1247328411, now seen corresponding path program 1 times [2022-02-20 23:47:00,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:00,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230679804] [2022-02-20 23:47:00,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:00,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:00,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {12689#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(18, 2); {12689#true} is VALID [2022-02-20 23:47:00,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {12689#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {12689#true} is VALID [2022-02-20 23:47:00,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {12689#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {12691#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {12691#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {12691#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,911 INFO L290 TraceCheckUtils]: 4: Hoare triple {12691#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {12691#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {12691#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {12691#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {12691#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L541-2 {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1; {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L540-8 {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {12692#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(12); {12693#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc14#1.base|) 1) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc14#1.base|)))} is VALID [2022-02-20 23:47:00,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {12693#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc14#1.base|) 1) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc14#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L547 {12694#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} is VALID [2022-02-20 23:47:00,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {12694#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {12694#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} is VALID [2022-02-20 23:47:00,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {12694#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L548 {12695#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} is VALID [2022-02-20 23:47:00,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {12695#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4); srcloc: L548-1 {12696#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} is VALID [2022-02-20 23:47:00,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {12696#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {12696#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} is VALID [2022-02-20 23:47:00,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {12696#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L549 {12697#(= (select |#valid| |ULTIMATE.start_main_#t~mem16#1.base|) 1)} is VALID [2022-02-20 23:47:00,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {12697#(= (select |#valid| |ULTIMATE.start_main_#t~mem16#1.base|) 1)} assume !(1 == #valid[main_#t~mem16#1.base]); {12690#false} is VALID [2022-02-20 23:47:00,925 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:47:00,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:00,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230679804] [2022-02-20 23:47:00,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230679804] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:00,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:00,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:47:00,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834112813] [2022-02-20 23:47:00,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:00,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:00,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:00,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:00,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:47:00,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:00,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:47:00,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:47:00,948 INFO L87 Difference]: Start difference. First operand 185 states and 224 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:01,710 INFO L93 Difference]: Finished difference Result 187 states and 226 transitions. [2022-02-20 23:47:01,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:47:01,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2022-02-20 23:47:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2022-02-20 23:47:01,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 131 transitions. [2022-02-20 23:47:01,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:01,827 INFO L225 Difference]: With dead ends: 187 [2022-02-20 23:47:01,828 INFO L226 Difference]: Without dead ends: 187 [2022-02-20 23:47:01,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:47:01,828 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 151 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:01,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 278 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-02-20 23:47:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2022-02-20 23:47:01,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:01,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 184 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 183 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,832 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 184 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 183 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,832 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 184 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 183 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:01,835 INFO L93 Difference]: Finished difference Result 187 states and 226 transitions. [2022-02-20 23:47:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2022-02-20 23:47:01,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:01,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:01,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 183 states have internal predecessors, (222), 0 states have call successors, (0), 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 187 states. [2022-02-20 23:47:01,836 INFO L87 Difference]: Start difference. First operand has 184 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 183 states have internal predecessors, (222), 0 states have call successors, (0), 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 187 states. [2022-02-20 23:47:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:01,839 INFO L93 Difference]: Finished difference Result 187 states and 226 transitions. [2022-02-20 23:47:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2022-02-20 23:47:01,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:01,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:01,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:01,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 183 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 222 transitions. [2022-02-20 23:47:01,843 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 222 transitions. Word has length 22 [2022-02-20 23:47:01,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:01,844 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 222 transitions. [2022-02-20 23:47:01,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 222 transitions. [2022-02-20 23:47:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:01,845 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:01,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:01,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:47:01,845 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:01,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1247328412, now seen corresponding path program 1 times [2022-02-20 23:47:01,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:01,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924469544] [2022-02-20 23:47:01,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:01,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {13459#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(18, 2); {13459#true} is VALID [2022-02-20 23:47:01,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {13459#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {13459#true} is VALID [2022-02-20 23:47:01,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {13459#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {13461#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:01,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {13461#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {13461#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:01,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {13461#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {13461#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:01,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {13461#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {13461#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:01,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {13461#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:01,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L541-2 {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:01,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:01,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1; {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:01,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:01,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L540-8 {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:01,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:01,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:01,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {13462#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(12); {13463#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc14#1.base|) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc14#1.base|)) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0))} is VALID [2022-02-20 23:47:01,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {13463#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc14#1.base|) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc14#1.base|)) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L547 {13464#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:01,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {13464#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {13464#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:01,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {13464#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L548 {13465#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:01,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {13465#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4); srcloc: L548-1 {13466#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:01,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {13466#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {13466#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:01,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {13466#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L549 {13467#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem16#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_#t~mem16#1.offset| 0))} is VALID [2022-02-20 23:47:01,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {13467#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem16#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_#t~mem16#1.offset| 0))} assume !(4 + (4 + main_#t~mem16#1.offset) <= #length[main_#t~mem16#1.base] && 0 <= 4 + main_#t~mem16#1.offset); {13460#false} is VALID [2022-02-20 23:47:01,973 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:47:01,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:01,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924469544] [2022-02-20 23:47:01,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924469544] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:01,974 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:01,974 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:47:01,974 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290348421] [2022-02-20 23:47:01,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:01,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:01,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:01,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:01,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:47:01,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:01,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:47:01,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:47:01,999 INFO L87 Difference]: Start difference. First operand 184 states and 222 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,684 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2022-02-20 23:47:02,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:47:02,684 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2022-02-20 23:47:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2022-02-20 23:47:02,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 130 transitions. [2022-02-20 23:47:02,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:02,805 INFO L225 Difference]: With dead ends: 186 [2022-02-20 23:47:02,805 INFO L226 Difference]: Without dead ends: 186 [2022-02-20 23:47:02,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:47:02,806 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 149 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:02,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 224 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-02-20 23:47:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2022-02-20 23:47:02,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:02,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 183 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 182 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,809 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 183 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 182 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,809 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 183 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 182 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,812 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2022-02-20 23:47:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 224 transitions. [2022-02-20 23:47:02,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:02,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:02,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 182 states have internal predecessors, (220), 0 states have call successors, (0), 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 186 states. [2022-02-20 23:47:02,813 INFO L87 Difference]: Start difference. First operand has 183 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 182 states have internal predecessors, (220), 0 states have call successors, (0), 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 186 states. [2022-02-20 23:47:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,815 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2022-02-20 23:47:02,815 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 224 transitions. [2022-02-20 23:47:02,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:02,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:02,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:02,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 182 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 220 transitions. [2022-02-20 23:47:02,818 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 220 transitions. Word has length 22 [2022-02-20 23:47:02,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:02,819 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 220 transitions. [2022-02-20 23:47:02,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 220 transitions. [2022-02-20 23:47:02,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:47:02,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:02,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:02,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:47:02,820 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:02,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:02,820 INFO L85 PathProgramCache]: Analyzing trace with hash -19499741, now seen corresponding path program 1 times [2022-02-20 23:47:02,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:02,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122572445] [2022-02-20 23:47:02,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:02,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:02,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {14225#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(18, 2); {14225#true} is VALID [2022-02-20 23:47:02,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {14225#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {14225#true} is VALID [2022-02-20 23:47:02,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {14225#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {14225#true} is VALID [2022-02-20 23:47:02,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {14225#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {14225#true} is VALID [2022-02-20 23:47:02,863 INFO L290 TraceCheckUtils]: 4: Hoare triple {14225#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {14225#true} is VALID [2022-02-20 23:47:02,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {14225#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {14225#true} is VALID [2022-02-20 23:47:02,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {14225#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {14225#true} is VALID [2022-02-20 23:47:02,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {14225#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L541-2 {14225#true} is VALID [2022-02-20 23:47:02,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {14225#true} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {14225#true} is VALID [2022-02-20 23:47:02,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {14225#true} assume !main_#t~short7#1; {14225#true} is VALID [2022-02-20 23:47:02,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {14225#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {14225#true} is VALID [2022-02-20 23:47:02,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {14225#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L540-8 {14225#true} is VALID [2022-02-20 23:47:02,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {14225#true} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {14225#true} is VALID [2022-02-20 23:47:02,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {14225#true} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {14225#true} is VALID [2022-02-20 23:47:02,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {14225#true} assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; {14225#true} is VALID [2022-02-20 23:47:02,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {14225#true} SUMMARY for call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L546-5 {14225#true} is VALID [2022-02-20 23:47:02,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {14225#true} main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; {14225#true} is VALID [2022-02-20 23:47:02,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {14225#true} assume main_#t~short20#1;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_#t~short20#1 := 0 != main_#t~nondet19#1; {14225#true} is VALID [2022-02-20 23:47:02,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {14225#true} assume main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(12); {14227#(= (select |#valid| |ULTIMATE.start_main_#t~malloc21#1.base|) 1)} is VALID [2022-02-20 23:47:02,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {14227#(= (select |#valid| |ULTIMATE.start_main_#t~malloc21#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L553 {14228#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:47:02,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {14228#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset; {14228#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:47:02,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {14228#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L554 {14229#(= (select |#valid| |ULTIMATE.start_main_#t~mem22#1.base|) 1)} is VALID [2022-02-20 23:47:02,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {14229#(= (select |#valid| |ULTIMATE.start_main_#t~mem22#1.base|) 1)} assume !(1 == #valid[main_#t~mem22#1.base]); {14226#false} is VALID [2022-02-20 23:47:02,870 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:47:02,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:02,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122572445] [2022-02-20 23:47:02,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122572445] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:02,870 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:02,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:02,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459848842] [2022-02-20 23:47:02,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:02,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:47:02,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:02,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:02,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:02,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:02,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:02,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:02,888 INFO L87 Difference]: Start difference. First operand 183 states and 220 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,261 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2022-02-20 23:47:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:03,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:47:03,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-02-20 23:47:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-02-20 23:47:03,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 116 transitions. [2022-02-20 23:47:03,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:03,348 INFO L225 Difference]: With dead ends: 182 [2022-02-20 23:47:03,348 INFO L226 Difference]: Without dead ends: 182 [2022-02-20 23:47:03,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:03,349 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 6 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:03,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 271 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:03,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-20 23:47:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-02-20 23:47:03,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:03,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 182 states, 153 states have (on average 1.4248366013071896) internal successors, (218), 181 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,352 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 182 states, 153 states have (on average 1.4248366013071896) internal successors, (218), 181 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,353 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 182 states, 153 states have (on average 1.4248366013071896) internal successors, (218), 181 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,355 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2022-02-20 23:47:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 218 transitions. [2022-02-20 23:47:03,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:03,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:03,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 153 states have (on average 1.4248366013071896) internal successors, (218), 181 states have internal predecessors, (218), 0 states have call successors, (0), 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 182 states. [2022-02-20 23:47:03,356 INFO L87 Difference]: Start difference. First operand has 182 states, 153 states have (on average 1.4248366013071896) internal successors, (218), 181 states have internal predecessors, (218), 0 states have call successors, (0), 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 182 states. [2022-02-20 23:47:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,361 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2022-02-20 23:47:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 218 transitions. [2022-02-20 23:47:03,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:03,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:03,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:03,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 153 states have (on average 1.4248366013071896) internal successors, (218), 181 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 218 transitions. [2022-02-20 23:47:03,365 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 218 transitions. Word has length 23 [2022-02-20 23:47:03,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:03,365 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 218 transitions. [2022-02-20 23:47:03,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 218 transitions. [2022-02-20 23:47:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:47:03,366 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:03,366 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:03,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:47:03,366 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:03,367 INFO L85 PathProgramCache]: Analyzing trace with hash -19499740, now seen corresponding path program 1 times [2022-02-20 23:47:03,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:03,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140636182] [2022-02-20 23:47:03,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:03,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:03,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {14964#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(18, 2); {14964#true} is VALID [2022-02-20 23:47:03,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {14964#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {14964#true} is VALID [2022-02-20 23:47:03,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {14964#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {14964#true} is VALID [2022-02-20 23:47:03,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {14964#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {14964#true} is VALID [2022-02-20 23:47:03,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {14964#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {14964#true} is VALID [2022-02-20 23:47:03,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {14964#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {14964#true} is VALID [2022-02-20 23:47:03,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {14964#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {14964#true} is VALID [2022-02-20 23:47:03,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {14964#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L541-2 {14964#true} is VALID [2022-02-20 23:47:03,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {14964#true} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {14964#true} is VALID [2022-02-20 23:47:03,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {14964#true} assume !main_#t~short7#1; {14964#true} is VALID [2022-02-20 23:47:03,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {14964#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {14964#true} is VALID [2022-02-20 23:47:03,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {14964#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L540-8 {14964#true} is VALID [2022-02-20 23:47:03,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {14964#true} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {14964#true} is VALID [2022-02-20 23:47:03,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {14964#true} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {14964#true} is VALID [2022-02-20 23:47:03,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {14964#true} assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; {14964#true} is VALID [2022-02-20 23:47:03,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {14964#true} SUMMARY for call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L546-5 {14964#true} is VALID [2022-02-20 23:47:03,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {14964#true} main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; {14964#true} is VALID [2022-02-20 23:47:03,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {14964#true} assume main_#t~short20#1;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_#t~short20#1 := 0 != main_#t~nondet19#1; {14964#true} is VALID [2022-02-20 23:47:03,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {14964#true} assume main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(12); {14966#(and (= |ULTIMATE.start_main_#t~malloc21#1.offset| 0) (= 12 (select |#length| |ULTIMATE.start_main_#t~malloc21#1.base|)))} is VALID [2022-02-20 23:47:03,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {14966#(and (= |ULTIMATE.start_main_#t~malloc21#1.offset| 0) (= 12 (select |#length| |ULTIMATE.start_main_#t~malloc21#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L553 {14967#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:47:03,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {14967#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0))} havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset; {14967#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:47:03,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {14967#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L554 {14968#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem22#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_#t~mem22#1.offset| 0))} is VALID [2022-02-20 23:47:03,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {14968#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem22#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_#t~mem22#1.offset| 0))} assume !(4 + main_#t~mem22#1.offset <= #length[main_#t~mem22#1.base] && 0 <= main_#t~mem22#1.offset); {14965#false} is VALID [2022-02-20 23:47:03,425 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:47:03,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:03,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140636182] [2022-02-20 23:47:03,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140636182] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:03,425 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:03,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:03,426 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845882515] [2022-02-20 23:47:03,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:03,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:47:03,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:03,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:03,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:03,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:03,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:03,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:03,444 INFO L87 Difference]: Start difference. First operand 182 states and 218 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,857 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2022-02-20 23:47:03,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:03,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:47:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-02-20 23:47:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-02-20 23:47:03,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 115 transitions. [2022-02-20 23:47:03,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:03,940 INFO L225 Difference]: With dead ends: 181 [2022-02-20 23:47:03,940 INFO L226 Difference]: Without dead ends: 181 [2022-02-20 23:47:03,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:03,940 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:03,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 263 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-20 23:47:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-02-20 23:47:03,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:03,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 181 states, 153 states have (on average 1.411764705882353) internal successors, (216), 180 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,944 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 181 states, 153 states have (on average 1.411764705882353) internal successors, (216), 180 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,944 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 181 states, 153 states have (on average 1.411764705882353) internal successors, (216), 180 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,946 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2022-02-20 23:47:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2022-02-20 23:47:03,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:03,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:03,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 153 states have (on average 1.411764705882353) internal successors, (216), 180 states have internal predecessors, (216), 0 states have call successors, (0), 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 181 states. [2022-02-20 23:47:03,948 INFO L87 Difference]: Start difference. First operand has 181 states, 153 states have (on average 1.411764705882353) internal successors, (216), 180 states have internal predecessors, (216), 0 states have call successors, (0), 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 181 states. [2022-02-20 23:47:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,950 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2022-02-20 23:47:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2022-02-20 23:47:03,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:03,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:03,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:03,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 153 states have (on average 1.411764705882353) internal successors, (216), 180 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2022-02-20 23:47:03,953 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 23 [2022-02-20 23:47:03,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:03,954 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2022-02-20 23:47:03,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2022-02-20 23:47:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:47:03,954 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:03,955 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:03,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:47:03,955 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:03,956 INFO L85 PathProgramCache]: Analyzing trace with hash 998290617, now seen corresponding path program 1 times [2022-02-20 23:47:03,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:03,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049733556] [2022-02-20 23:47:03,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:03,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:04,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {15699#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(18, 2); {15699#true} is VALID [2022-02-20 23:47:04,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {15699#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {15701#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:47:04,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {15701#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {15701#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:47:04,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {15701#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {15701#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:47:04,113 INFO L290 TraceCheckUtils]: 4: Hoare triple {15701#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {15701#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:47:04,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {15701#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {15701#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:47:04,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {15701#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {15701#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:47:04,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {15701#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {15702#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {15702#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {15702#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {15702#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L561-1 {15703#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {15703#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {15704#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~s~0#1.offset| 4) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))} is VALID [2022-02-20 23:47:04,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {15704#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~s~0#1.offset| 4) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L565 {15705#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {15705#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem26#1.base, main_#t~mem26#1.offset;havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {15705#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {15705#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} SUMMARY for call main_#t~mem27#1.base, main_#t~mem27#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L566 {15706#(and (<= (+ |ULTIMATE.start_main_#t~mem27#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {15706#(and (<= (+ |ULTIMATE.start_main_#t~mem27#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem27#1.base, main_#t~mem27#1.offset;havoc main_#t~mem27#1.base, main_#t~mem27#1.offset; {15707#(and (<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {15707#(and (<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} assume 0 == main_~st~0#1.offset; {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:04,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} assume main_~st~0#1.base < #StackHeapBarrier; {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:04,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:04,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem28#1.base, main_#t~mem28#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L568 {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:04,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem28#1.base != 0 || main_#t~mem28#1.offset != 0);havoc main_#t~mem28#1.base, main_#t~mem28#1.offset; {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:04,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem31#1.base, main_#t~mem31#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L568-3 {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:04,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem31#1.base != 0 || main_#t~mem31#1.offset != 0);havoc main_#t~mem31#1.base, main_#t~mem31#1.offset; {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:04,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~n~0#1.offset; {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:04,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {15708#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~n~0#1.base < #StackHeapBarrier); {15700#false} is VALID [2022-02-20 23:47:04,130 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:47:04,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:04,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049733556] [2022-02-20 23:47:04,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049733556] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:04,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:04,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:47:04,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689865541] [2022-02-20 23:47:04,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:04,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:47:04,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:04,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:04,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:04,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:47:04,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:04,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:47:04,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:47:04,156 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:05,378 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions. [2022-02-20 23:47:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:47:05,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:47:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 227 transitions. [2022-02-20 23:47:05,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 227 transitions. [2022-02-20 23:47:05,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 227 transitions. [2022-02-20 23:47:05,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:05,551 INFO L225 Difference]: With dead ends: 234 [2022-02-20 23:47:05,551 INFO L226 Difference]: Without dead ends: 234 [2022-02-20 23:47:05,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:47:05,552 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 362 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:05,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 484 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:47:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-02-20 23:47:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 194. [2022-02-20 23:47:05,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:05,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 194 states, 166 states have (on average 1.4036144578313252) internal successors, (233), 193 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,556 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 194 states, 166 states have (on average 1.4036144578313252) internal successors, (233), 193 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,556 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 194 states, 166 states have (on average 1.4036144578313252) internal successors, (233), 193 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:05,560 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions. [2022-02-20 23:47:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 268 transitions. [2022-02-20 23:47:05,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:05,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:05,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 166 states have (on average 1.4036144578313252) internal successors, (233), 193 states have internal predecessors, (233), 0 states have call successors, (0), 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 234 states. [2022-02-20 23:47:05,561 INFO L87 Difference]: Start difference. First operand has 194 states, 166 states have (on average 1.4036144578313252) internal successors, (233), 193 states have internal predecessors, (233), 0 states have call successors, (0), 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 234 states. [2022-02-20 23:47:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:05,565 INFO L93 Difference]: Finished difference Result 234 states and 268 transitions. [2022-02-20 23:47:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 268 transitions. [2022-02-20 23:47:05,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:05,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:05,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:05,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 166 states have (on average 1.4036144578313252) internal successors, (233), 193 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 233 transitions. [2022-02-20 23:47:05,568 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 233 transitions. Word has length 24 [2022-02-20 23:47:05,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:05,569 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 233 transitions. [2022-02-20 23:47:05,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,569 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 233 transitions. [2022-02-20 23:47:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:47:05,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:05,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:05,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 23:47:05,570 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:05,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:05,570 INFO L85 PathProgramCache]: Analyzing trace with hash 998278641, now seen corresponding path program 1 times [2022-02-20 23:47:05,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:05,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067999821] [2022-02-20 23:47:05,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:05,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:05,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {16627#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(18, 2); {16627#true} is VALID [2022-02-20 23:47:05,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {16627#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {16627#true} is VALID [2022-02-20 23:47:05,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {16627#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {16627#true} is VALID [2022-02-20 23:47:05,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {16627#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {16627#true} is VALID [2022-02-20 23:47:05,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {16627#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {16627#true} is VALID [2022-02-20 23:47:05,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {16627#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {16627#true} is VALID [2022-02-20 23:47:05,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {16627#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {16627#true} is VALID [2022-02-20 23:47:05,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {16627#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {16627#true} is VALID [2022-02-20 23:47:05,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {16627#true} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {16627#true} is VALID [2022-02-20 23:47:05,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {16627#true} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L561-1 {16627#true} is VALID [2022-02-20 23:47:05,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {16627#true} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {16627#true} is VALID [2022-02-20 23:47:05,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {16627#true} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L565 {16627#true} is VALID [2022-02-20 23:47:05,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {16627#true} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem26#1.base, main_#t~mem26#1.offset;havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {16627#true} is VALID [2022-02-20 23:47:05,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {16627#true} SUMMARY for call main_#t~mem27#1.base, main_#t~mem27#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L566 {16627#true} is VALID [2022-02-20 23:47:05,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {16627#true} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem27#1.base, main_#t~mem27#1.offset;havoc main_#t~mem27#1.base, main_#t~mem27#1.offset; {16627#true} is VALID [2022-02-20 23:47:05,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {16627#true} assume 0 == main_~st~0#1.offset; {16627#true} is VALID [2022-02-20 23:47:05,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {16627#true} assume main_~st~0#1.base < #StackHeapBarrier; {16627#true} is VALID [2022-02-20 23:47:05,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {16627#true} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {16627#true} is VALID [2022-02-20 23:47:05,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {16627#true} SUMMARY for call main_#t~mem28#1.base, main_#t~mem28#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L568 {16629#(and (<= 0 |ULTIMATE.start_main_~n~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} is VALID [2022-02-20 23:47:05,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {16629#(and (<= 0 |ULTIMATE.start_main_~n~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} assume !(main_#t~mem28#1.base != 0 || main_#t~mem28#1.offset != 0);havoc main_#t~mem28#1.base, main_#t~mem28#1.offset; {16629#(and (<= 0 |ULTIMATE.start_main_~n~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} is VALID [2022-02-20 23:47:05,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {16629#(and (<= 0 |ULTIMATE.start_main_~n~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} SUMMARY for call main_#t~mem31#1.base, main_#t~mem31#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L568-3 {16630#(and (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (<= 0 |ULTIMATE.start_main_~n~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} is VALID [2022-02-20 23:47:05,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {16630#(and (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (<= 0 |ULTIMATE.start_main_~n~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} assume main_#t~mem31#1.base != 0 || main_#t~mem31#1.offset != 0;havoc main_#t~mem31#1.base, main_#t~mem31#1.offset;call main_#t~malloc32#1.base, main_#t~malloc32#1.offset := #Ultimate.allocOnHeap(8);main_~st~0#1.base, main_~st~0#1.offset := main_#t~malloc32#1.base, main_#t~malloc32#1.offset;havoc main_#t~malloc32#1.base, main_#t~malloc32#1.offset; {16631#(and (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (<= 0 |ULTIMATE.start_main_~n~0#1.offset|))} is VALID [2022-02-20 23:47:05,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {16631#(and (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (<= 0 |ULTIMATE.start_main_~n~0#1.offset|))} SUMMARY for call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset, 4); srcloc: L576 {16631#(and (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (<= 0 |ULTIMATE.start_main_~n~0#1.offset|))} is VALID [2022-02-20 23:47:05,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {16631#(and (<= (+ |ULTIMATE.start_main_~n~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (<= 0 |ULTIMATE.start_main_~n~0#1.offset|))} assume !(4 + (4 + main_~n~0#1.offset) <= #length[main_~n~0#1.base] && 0 <= 4 + main_~n~0#1.offset); {16628#false} is VALID [2022-02-20 23:47:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:05,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:05,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067999821] [2022-02-20 23:47:05,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067999821] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:05,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:05,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:05,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928239010] [2022-02-20 23:47:05,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:05,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:47:05,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:05,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:05,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:05,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:05,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:05,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:05,678 INFO L87 Difference]: Start difference. First operand 194 states and 233 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:05,986 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2022-02-20 23:47:05,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:05,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:47:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2022-02-20 23:47:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2022-02-20 23:47:05,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 145 transitions. [2022-02-20 23:47:06,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:06,098 INFO L225 Difference]: With dead ends: 225 [2022-02-20 23:47:06,098 INFO L226 Difference]: Without dead ends: 225 [2022-02-20 23:47:06,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:06,098 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 188 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:06,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 113 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-02-20 23:47:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 172. [2022-02-20 23:47:06,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:06,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 172 states, 150 states have (on average 1.36) internal successors, (204), 171 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:06,102 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 172 states, 150 states have (on average 1.36) internal successors, (204), 171 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:06,102 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 172 states, 150 states have (on average 1.36) internal successors, (204), 171 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:06,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:06,105 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2022-02-20 23:47:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 270 transitions. [2022-02-20 23:47:06,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:06,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:06,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 150 states have (on average 1.36) internal successors, (204), 171 states have internal predecessors, (204), 0 states have call successors, (0), 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 225 states. [2022-02-20 23:47:06,106 INFO L87 Difference]: Start difference. First operand has 172 states, 150 states have (on average 1.36) internal successors, (204), 171 states have internal predecessors, (204), 0 states have call successors, (0), 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 225 states. [2022-02-20 23:47:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:06,109 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2022-02-20 23:47:06,109 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 270 transitions. [2022-02-20 23:47:06,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:06,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:06,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:06,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.36) internal successors, (204), 171 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 204 transitions. [2022-02-20 23:47:06,112 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 204 transitions. Word has length 24 [2022-02-20 23:47:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:06,112 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 204 transitions. [2022-02-20 23:47:06,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 204 transitions. [2022-02-20 23:47:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:47:06,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:06,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:06,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 23:47:06,114 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:06,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:06,114 INFO L85 PathProgramCache]: Analyzing trace with hash 525851589, now seen corresponding path program 1 times [2022-02-20 23:47:06,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:06,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994963339] [2022-02-20 23:47:06,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:06,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:06,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {17481#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(18, 2); {17481#true} is VALID [2022-02-20 23:47:06,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {17481#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {17483#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} is VALID [2022-02-20 23:47:06,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {17483#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {17483#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} is VALID [2022-02-20 23:47:06,486 INFO L290 TraceCheckUtils]: 3: Hoare triple {17483#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {17483#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} is VALID [2022-02-20 23:47:06,486 INFO L290 TraceCheckUtils]: 4: Hoare triple {17483#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {17483#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} is VALID [2022-02-20 23:47:06,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {17483#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {17483#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} is VALID [2022-02-20 23:47:06,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {17483#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {17483#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} is VALID [2022-02-20 23:47:06,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {17483#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)))} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {17484#(and (or (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= (+ |ULTIMATE.start_main_~root~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (or (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {17484#(and (or (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= (+ |ULTIMATE.start_main_~root~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (or (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {17484#(and (or (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= (+ |ULTIMATE.start_main_~root~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (or (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {17484#(and (or (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= (+ |ULTIMATE.start_main_~root~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (or (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_~root~0#1.base|))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L561-1 {17485#(and (or (and (= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {17485#(and (or (and (= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {17486#(and (= |ULTIMATE.start_main_~st~0#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (or (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))) (and (= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {17486#(and (= |ULTIMATE.start_main_~st~0#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (or (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))) (and (= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L565 {17487#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (or (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))))))} is VALID [2022-02-20 23:47:06,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {17487#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (or (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))))))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem26#1.base, main_#t~mem26#1.offset;havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {17487#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (or (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))))))} is VALID [2022-02-20 23:47:06,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {17487#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (or (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))))))} SUMMARY for call main_#t~mem27#1.base, main_#t~mem27#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L566 {17488#(and (= |ULTIMATE.start_main_#t~mem27#1.offset| 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_#t~mem27#1.base|) 8) (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem27#1.base|))))} is VALID [2022-02-20 23:47:06,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {17488#(and (= |ULTIMATE.start_main_#t~mem27#1.offset| 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (or (= (select |#length| |ULTIMATE.start_main_#t~mem27#1.base|) 8) (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem27#1.base|))))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem27#1.base, main_#t~mem27#1.offset;havoc main_#t~mem27#1.base, main_#t~mem27#1.offset; {17489#(and (or (<= 12 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~n~0#1.base|) 8)) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {17489#(and (or (<= 12 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~n~0#1.base|) 8)) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume 0 == main_~st~0#1.offset; {17490#(and (or (<= 12 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~n~0#1.base|) 8)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {17490#(and (or (<= 12 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~n~0#1.base|) 8)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume main_~st~0#1.base < #StackHeapBarrier; {17490#(and (or (<= 12 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~n~0#1.base|) 8)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {17490#(and (or (<= 12 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~n~0#1.base|) 8)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {17490#(and (or (<= 12 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~n~0#1.base|) 8)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {17490#(and (or (<= 12 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~n~0#1.base|) 8)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} SUMMARY for call main_#t~mem28#1.base, main_#t~mem28#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L568 {17491#(and (or (<= 12 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~n~0#1.base|) 8)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {17491#(and (or (<= 12 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= (select |#length| |ULTIMATE.start_main_~n~0#1.base|) 8)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume main_#t~mem28#1.base != 0 || main_#t~mem28#1.offset != 0;havoc main_#t~mem28#1.base, main_#t~mem28#1.offset;call main_#t~malloc29#1.base, main_#t~malloc29#1.offset := #Ultimate.allocOnHeap(8);main_~st~0#1.base, main_~st~0#1.offset := main_#t~malloc29#1.base, main_#t~malloc29#1.offset;havoc main_#t~malloc29#1.base, main_#t~malloc29#1.offset; {17492#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {17492#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset, 4); srcloc: L570 {17492#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {17492#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} SUMMARY for call main_#t~mem30#1.base, main_#t~mem30#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L570-1 {17492#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {17492#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~mem30#1.base, main_#t~mem30#1.offset, main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L571 {17492#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {17492#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} havoc main_#t~mem30#1.base, main_#t~mem30#1.offset;main_~s~0#1.base, main_~s~0#1.offset := main_~st~0#1.base, main_~st~0#1.offset; {17492#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:47:06,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {17492#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume !(4 + (4 + main_~n~0#1.offset) <= #length[main_~n~0#1.base] && 0 <= 4 + main_~n~0#1.offset); {17482#false} is VALID [2022-02-20 23:47:06,506 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:47:06,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:06,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994963339] [2022-02-20 23:47:06,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994963339] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:06,507 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:06,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:47:06,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850392520] [2022-02-20 23:47:06,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:06,508 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:47:06,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:06,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:06,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:06,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:47:06,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:06,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:47:06,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:47:06,535 INFO L87 Difference]: Start difference. First operand 172 states and 204 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:08,089 INFO L93 Difference]: Finished difference Result 242 states and 282 transitions. [2022-02-20 23:47:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:47:08,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:47:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 215 transitions. [2022-02-20 23:47:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 215 transitions. [2022-02-20 23:47:08,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 215 transitions. [2022-02-20 23:47:08,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:08,276 INFO L225 Difference]: With dead ends: 242 [2022-02-20 23:47:08,276 INFO L226 Difference]: Without dead ends: 242 [2022-02-20 23:47:08,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:47:08,277 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 308 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:08,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 397 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:47:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-02-20 23:47:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 172. [2022-02-20 23:47:08,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:08,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 172 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 171 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,287 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 172 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 171 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,288 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 172 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 171 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:08,291 INFO L93 Difference]: Finished difference Result 242 states and 282 transitions. [2022-02-20 23:47:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 282 transitions. [2022-02-20 23:47:08,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:08,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:08,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 171 states have internal predecessors, (202), 0 states have call successors, (0), 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 242 states. [2022-02-20 23:47:08,292 INFO L87 Difference]: Start difference. First operand has 172 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 171 states have internal predecessors, (202), 0 states have call successors, (0), 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 242 states. [2022-02-20 23:47:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:08,296 INFO L93 Difference]: Finished difference Result 242 states and 282 transitions. [2022-02-20 23:47:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 282 transitions. [2022-02-20 23:47:08,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:08,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:08,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:08,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 171 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 202 transitions. [2022-02-20 23:47:08,299 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 202 transitions. Word has length 25 [2022-02-20 23:47:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:08,299 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 202 transitions. [2022-02-20 23:47:08,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 202 transitions. [2022-02-20 23:47:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:47:08,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:08,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:08,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-20 23:47:08,300 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:08,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash -896291290, now seen corresponding path program 1 times [2022-02-20 23:47:08,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:08,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413977433] [2022-02-20 23:47:08,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:08,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:08,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {18409#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(18, 2); {18409#true} is VALID [2022-02-20 23:47:08,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {18409#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {18409#true} is VALID [2022-02-20 23:47:08,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {18409#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {18411#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:08,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {18411#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {18411#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:08,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {18411#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {18411#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:08,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {18411#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {18411#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:08,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {18411#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:08,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L541-2 {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:08,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:08,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1; {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:08,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:08,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L540-8 {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:08,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:08,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:08,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {18412#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(12); {18413#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc14#1.base|) 1) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc14#1.base|)))} is VALID [2022-02-20 23:47:08,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {18413#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc14#1.base|) 1) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc14#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L547 {18414#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} is VALID [2022-02-20 23:47:08,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {18414#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {18414#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} is VALID [2022-02-20 23:47:08,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {18414#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L548 {18415#(and (= |ULTIMATE.start_main_#t~mem15#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} is VALID [2022-02-20 23:47:08,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {18415#(and (= |ULTIMATE.start_main_#t~mem15#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4); srcloc: L548-1 {18414#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} is VALID [2022-02-20 23:47:08,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {18414#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {18414#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} is VALID [2022-02-20 23:47:08,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {18414#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L549 {18416#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem16#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} is VALID [2022-02-20 23:47:08,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {18416#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem16#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4); srcloc: L549-1 {18417#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} is VALID [2022-02-20 23:47:08,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {18417#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; {18417#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} is VALID [2022-02-20 23:47:08,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {18417#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L550 {18418#(= 1 (select |#valid| |ULTIMATE.start_main_#t~mem17#1.base|))} is VALID [2022-02-20 23:47:08,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {18418#(= 1 (select |#valid| |ULTIMATE.start_main_#t~mem17#1.base|))} assume !(1 == #valid[main_#t~mem17#1.base]); {18410#false} is VALID [2022-02-20 23:47:08,415 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:47:08,415 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:08,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413977433] [2022-02-20 23:47:08,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413977433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:08,415 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:08,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:47:08,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291751438] [2022-02-20 23:47:08,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:08,416 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:47:08,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:08,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:08,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:47:08,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:47:08,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:47:08,439 INFO L87 Difference]: Start difference. First operand 172 states and 202 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:09,274 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2022-02-20 23:47:09,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:47:09,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:47:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:09,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2022-02-20 23:47:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2022-02-20 23:47:09,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 136 transitions. [2022-02-20 23:47:09,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:09,372 INFO L225 Difference]: With dead ends: 187 [2022-02-20 23:47:09,372 INFO L226 Difference]: Without dead ends: 187 [2022-02-20 23:47:09,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:47:09,373 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 147 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:09,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 352 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-02-20 23:47:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 171. [2022-02-20 23:47:09,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:09,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 171 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,377 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 171 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,377 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 171 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:09,379 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2022-02-20 23:47:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2022-02-20 23:47:09,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:09,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:09,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 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 187 states. [2022-02-20 23:47:09,380 INFO L87 Difference]: Start difference. First operand has 171 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 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 187 states. [2022-02-20 23:47:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:09,382 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2022-02-20 23:47:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2022-02-20 23:47:09,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:09,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:09,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:09,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 170 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 200 transitions. [2022-02-20 23:47:09,385 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 200 transitions. Word has length 25 [2022-02-20 23:47:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:09,386 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 200 transitions. [2022-02-20 23:47:09,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 200 transitions. [2022-02-20 23:47:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:47:09,386 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:09,386 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:09,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-20 23:47:09,387 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:09,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:09,387 INFO L85 PathProgramCache]: Analyzing trace with hash -896291289, now seen corresponding path program 1 times [2022-02-20 23:47:09,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:09,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595892255] [2022-02-20 23:47:09,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:09,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {19171#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(18, 2); {19171#true} is VALID [2022-02-20 23:47:09,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {19171#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {19171#true} is VALID [2022-02-20 23:47:09,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {19171#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {19173#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:09,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {19173#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {19173#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:09,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {19173#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {19173#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:09,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {19173#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {19173#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:09,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {19173#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:09,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L541-2 {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:09,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:09,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1; {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:09,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:09,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L540-8 {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:09,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:09,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:09,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {19174#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(12); {19175#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc14#1.base|) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc14#1.base|)) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0))} is VALID [2022-02-20 23:47:09,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {19175#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc14#1.base|) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc14#1.base|)) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L547 {19176#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:09,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {19176#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {19176#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:09,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {19176#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L548 {19177#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:09,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {19177#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4); srcloc: L548-1 {19176#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:09,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {19176#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {19176#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:09,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {19176#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L549 {19178#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem16#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:09,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {19178#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem16#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4); srcloc: L549-1 {19179#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:09,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {19179#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; {19179#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:09,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {19179#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L550 {19180#(and (= |ULTIMATE.start_main_#t~mem17#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_#t~mem17#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:47:09,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {19180#(and (= |ULTIMATE.start_main_#t~mem17#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_#t~mem17#1.base|) (- 12)) 0))} assume !(4 + (8 + main_#t~mem17#1.offset) <= #length[main_#t~mem17#1.base] && 0 <= 8 + main_#t~mem17#1.offset); {19172#false} is VALID [2022-02-20 23:47:09,553 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:47:09,554 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:09,554 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595892255] [2022-02-20 23:47:09,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595892255] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:09,554 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:09,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:47:09,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517352906] [2022-02-20 23:47:09,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:09,555 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:47:09,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:09,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:09,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:47:09,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:09,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:47:09,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:47:09,579 INFO L87 Difference]: Start difference. First operand 171 states and 200 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,148 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2022-02-20 23:47:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:47:10,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:47:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 120 transitions. [2022-02-20 23:47:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 120 transitions. [2022-02-20 23:47:10,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 120 transitions. [2022-02-20 23:47:10,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:10,243 INFO L225 Difference]: With dead ends: 173 [2022-02-20 23:47:10,243 INFO L226 Difference]: Without dead ends: 173 [2022-02-20 23:47:10,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:47:10,244 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 131 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:10,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 224 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-02-20 23:47:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2022-02-20 23:47:10,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:10,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 170 states, 150 states have (on average 1.32) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,246 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 170 states, 150 states have (on average 1.32) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,247 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 170 states, 150 states have (on average 1.32) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,248 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2022-02-20 23:47:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 202 transitions. [2022-02-20 23:47:10,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:10,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:10,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 150 states have (on average 1.32) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 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 173 states. [2022-02-20 23:47:10,249 INFO L87 Difference]: Start difference. First operand has 170 states, 150 states have (on average 1.32) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 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 173 states. [2022-02-20 23:47:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,250 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2022-02-20 23:47:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 202 transitions. [2022-02-20 23:47:10,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:10,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:10,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:10,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 150 states have (on average 1.32) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2022-02-20 23:47:10,252 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 25 [2022-02-20 23:47:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:10,252 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2022-02-20 23:47:10,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2022-02-20 23:47:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:47:10,253 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:10,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:10,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-20 23:47:10,253 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:10,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1096103808, now seen corresponding path program 1 times [2022-02-20 23:47:10,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:10,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616354160] [2022-02-20 23:47:10,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:10,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {19888#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(18, 2); {19888#true} is VALID [2022-02-20 23:47:10,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {19888#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {19888#true} is VALID [2022-02-20 23:47:10,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {19888#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {19890#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,337 INFO L290 TraceCheckUtils]: 3: Hoare triple {19890#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {19890#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,337 INFO L290 TraceCheckUtils]: 4: Hoare triple {19890#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {19890#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {19890#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {19890#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {19890#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L541-2 {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1; {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L540-8 {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L546-5 {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short20#1;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_#t~short20#1 := 0 != main_#t~nondet19#1; {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:10,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {19891#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(12); {19892#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc21#1.base|) 1) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc21#1.base|)))} is VALID [2022-02-20 23:47:10,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {19892#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc21#1.base|) 1) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc21#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L553 {19893#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1))} is VALID [2022-02-20 23:47:10,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {19893#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1))} havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset; {19893#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1))} is VALID [2022-02-20 23:47:10,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {19893#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L554 {19894#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem22#1.base|)))} is VALID [2022-02-20 23:47:10,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {19894#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem22#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem22#1.base, main_#t~mem22#1.offset, 4); srcloc: L554-1 {19895#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:47:10,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {19895#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {19895#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:47:10,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {19895#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} SUMMARY for call main_#t~mem23#1.base, main_#t~mem23#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L555 {19896#(= (select |#valid| |ULTIMATE.start_main_#t~mem23#1.base|) 1)} is VALID [2022-02-20 23:47:10,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {19896#(= (select |#valid| |ULTIMATE.start_main_#t~mem23#1.base|) 1)} assume !(1 == #valid[main_#t~mem23#1.base]); {19889#false} is VALID [2022-02-20 23:47:10,345 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:47:10,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:10,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616354160] [2022-02-20 23:47:10,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616354160] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:10,346 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:10,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:47:10,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184677423] [2022-02-20 23:47:10,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:10,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:47:10,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:10,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:10,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:47:10,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:10,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:47:10,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:47:10,366 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,888 INFO L93 Difference]: Finished difference Result 172 states and 201 transitions. [2022-02-20 23:47:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:47:10,889 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:47:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2022-02-20 23:47:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2022-02-20 23:47:10,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 119 transitions. [2022-02-20 23:47:10,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:10,971 INFO L225 Difference]: With dead ends: 172 [2022-02-20 23:47:10,971 INFO L226 Difference]: Without dead ends: 172 [2022-02-20 23:47:10,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:47:10,972 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 127 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:10,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 222 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-02-20 23:47:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2022-02-20 23:47:10,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:10,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 169 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 168 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,975 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 169 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 168 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,975 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 169 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 168 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,977 INFO L93 Difference]: Finished difference Result 172 states and 201 transitions. [2022-02-20 23:47:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions. [2022-02-20 23:47:10,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:10,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:10,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 168 states have internal predecessors, (197), 0 states have call successors, (0), 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 172 states. [2022-02-20 23:47:10,979 INFO L87 Difference]: Start difference. First operand has 169 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 168 states have internal predecessors, (197), 0 states have call successors, (0), 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 172 states. [2022-02-20 23:47:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,981 INFO L93 Difference]: Finished difference Result 172 states and 201 transitions. [2022-02-20 23:47:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions. [2022-02-20 23:47:10,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:10,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:10,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:10,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 168 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2022-02-20 23:47:10,984 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 26 [2022-02-20 23:47:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:10,984 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2022-02-20 23:47:10,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2022-02-20 23:47:10,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:47:10,985 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:10,985 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:10,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-20 23:47:10,985 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:10,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:10,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1096103807, now seen corresponding path program 1 times [2022-02-20 23:47:10,986 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:10,986 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137763445] [2022-02-20 23:47:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:10,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:11,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {20598#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(18, 2); {20598#true} is VALID [2022-02-20 23:47:11,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {20598#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {20598#true} is VALID [2022-02-20 23:47:11,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {20598#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {20600#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {20600#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {20600#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {20600#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {20600#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {20600#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {20600#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {20600#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L541-2 {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1; {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L540-8 {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L546-5 {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short20#1 := main_#t~mem18#1.base == 0 && main_#t~mem18#1.offset == 0; {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short20#1;assume -2147483648 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 2147483647;main_#t~short20#1 := 0 != main_#t~nondet19#1; {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:11,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {20601#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short20#1;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~nondet19#1;havoc main_#t~short20#1;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(12); {20602#(and (= |ULTIMATE.start_main_#t~malloc21#1.offset| 0) (= 12 (select |#length| |ULTIMATE.start_main_#t~malloc21#1.base|)) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc21#1.base|)))} is VALID [2022-02-20 23:47:11,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {20602#(and (= |ULTIMATE.start_main_#t~malloc21#1.offset| 0) (= 12 (select |#length| |ULTIMATE.start_main_#t~malloc21#1.base|)) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc21#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L553 {20603#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} is VALID [2022-02-20 23:47:11,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {20603#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset; {20603#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} is VALID [2022-02-20 23:47:11,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {20603#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L554 {20604#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem22#1.base|)))} is VALID [2022-02-20 23:47:11,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {20604#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem22#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem22#1.base, main_#t~mem22#1.offset, 4); srcloc: L554-1 {20605#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:47:11,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {20605#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0))} havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {20605#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0))} is VALID [2022-02-20 23:47:11,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {20605#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0))} SUMMARY for call main_#t~mem23#1.base, main_#t~mem23#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L555 {20606#(and (= |ULTIMATE.start_main_#t~mem23#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem23#1.base|)) 0))} is VALID [2022-02-20 23:47:11,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {20606#(and (= |ULTIMATE.start_main_#t~mem23#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem23#1.base|)) 0))} assume !(4 + (4 + main_#t~mem23#1.offset) <= #length[main_#t~mem23#1.base] && 0 <= 4 + main_#t~mem23#1.offset); {20599#false} is VALID [2022-02-20 23:47:11,103 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:47:11,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:11,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137763445] [2022-02-20 23:47:11,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137763445] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:11,104 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:11,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:47:11,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606103766] [2022-02-20 23:47:11,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:11,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:47:11,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:11,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:11,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:47:11,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:11,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:47:11,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:47:11,129 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,678 INFO L93 Difference]: Finished difference Result 171 states and 200 transitions. [2022-02-20 23:47:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:47:11,679 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:47:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2022-02-20 23:47:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 118 transitions. [2022-02-20 23:47:11,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 118 transitions. [2022-02-20 23:47:11,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:11,770 INFO L225 Difference]: With dead ends: 171 [2022-02-20 23:47:11,770 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 23:47:11,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:47:11,771 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 122 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:11,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 221 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 23:47:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2022-02-20 23:47:11,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:11,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 168 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 167 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,774 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 168 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 167 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,775 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 168 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 167 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,777 INFO L93 Difference]: Finished difference Result 171 states and 200 transitions. [2022-02-20 23:47:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 200 transitions. [2022-02-20 23:47:11,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:11,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:11,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 167 states have internal predecessors, (196), 0 states have call successors, (0), 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 171 states. [2022-02-20 23:47:11,778 INFO L87 Difference]: Start difference. First operand has 168 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 167 states have internal predecessors, (196), 0 states have call successors, (0), 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 171 states. [2022-02-20 23:47:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,780 INFO L93 Difference]: Finished difference Result 171 states and 200 transitions. [2022-02-20 23:47:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 200 transitions. [2022-02-20 23:47:11,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:11,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:11,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:11,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 167 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 196 transitions. [2022-02-20 23:47:11,783 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 196 transitions. Word has length 26 [2022-02-20 23:47:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:11,783 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 196 transitions. [2022-02-20 23:47:11,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 196 transitions. [2022-02-20 23:47:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:47:11,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:11,784 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:11,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-20 23:47:11,784 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:11,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1722459940, now seen corresponding path program 1 times [2022-02-20 23:47:11,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:11,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917254892] [2022-02-20 23:47:11,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:11,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:11,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {21304#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(18, 2); {21304#true} is VALID [2022-02-20 23:47:11,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {21304#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {21304#true} is VALID [2022-02-20 23:47:11,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {21304#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {21304#true} is VALID [2022-02-20 23:47:11,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {21304#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {21304#true} is VALID [2022-02-20 23:47:11,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {21304#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {21304#true} is VALID [2022-02-20 23:47:11,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {21304#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {21304#true} is VALID [2022-02-20 23:47:11,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {21304#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {21304#true} is VALID [2022-02-20 23:47:11,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {21304#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {21304#true} is VALID [2022-02-20 23:47:11,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {21304#true} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:11,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L561-1 {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:11,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:11,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L565 {21307#(and (= |ULTIMATE.start_main_#t~mem26#1.base| 0) (= |ULTIMATE.start_main_#t~mem26#1.offset| 0))} is VALID [2022-02-20 23:47:11,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {21307#(and (= |ULTIMATE.start_main_#t~mem26#1.base| 0) (= |ULTIMATE.start_main_#t~mem26#1.offset| 0))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem26#1.base, main_#t~mem26#1.offset;havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:11,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem27#1.base, main_#t~mem27#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L566 {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:11,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem27#1.base, main_#t~mem27#1.offset;havoc main_#t~mem27#1.base, main_#t~mem27#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:11,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~st~0#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:11,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume main_~st~0#1.base < #StackHeapBarrier; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:11,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:11,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem28#1.base, main_#t~mem28#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L568 {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:11,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_#t~mem28#1.base != 0 || main_#t~mem28#1.offset != 0);havoc main_#t~mem28#1.base, main_#t~mem28#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:11,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem31#1.base, main_#t~mem31#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L568-3 {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:11,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_#t~mem31#1.base != 0 || main_#t~mem31#1.offset != 0);havoc main_#t~mem31#1.base, main_#t~mem31#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:11,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~n~0#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:11,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume main_~n~0#1.base < #StackHeapBarrier; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:11,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~n~0#1.base || 1 == #valid[main_~n~0#1.base];call ULTIMATE.dealloc(main_~n~0#1.base, main_~n~0#1.offset); {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:11,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {21305#false} is VALID [2022-02-20 23:47:11,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {21305#false} assume !(1 == #valid[main_~s~0#1.base]); {21305#false} is VALID [2022-02-20 23:47:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:11,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:11,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917254892] [2022-02-20 23:47:11,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917254892] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:47:11,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23415115] [2022-02-20 23:47:11,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:11,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:47:11,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:11,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:47:11,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:47:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:12,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 23:47:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:12,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:12,144 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 11 treesize of output 7 [2022-02-20 23:47:12,153 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 11 treesize of output 7 [2022-02-20 23:47:12,224 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:47:12,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:47:12,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:12,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-02-20 23:47:12,311 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 15 treesize of output 7 [2022-02-20 23:47:12,328 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 15 treesize of output 7 [2022-02-20 23:47:12,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {21304#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(18, 2); {21304#true} is VALID [2022-02-20 23:47:12,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {21304#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {21304#true} is VALID [2022-02-20 23:47:12,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {21304#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {21304#true} is VALID [2022-02-20 23:47:12,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {21304#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {21304#true} is VALID [2022-02-20 23:47:12,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {21304#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {21304#true} is VALID [2022-02-20 23:47:12,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {21304#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {21304#true} is VALID [2022-02-20 23:47:12,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {21304#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {21304#true} is VALID [2022-02-20 23:47:12,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {21304#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {21304#true} is VALID [2022-02-20 23:47:12,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {21304#true} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:12,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L561-1 {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:12,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:12,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L565 {21307#(and (= |ULTIMATE.start_main_#t~mem26#1.base| 0) (= |ULTIMATE.start_main_#t~mem26#1.offset| 0))} is VALID [2022-02-20 23:47:12,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {21307#(and (= |ULTIMATE.start_main_#t~mem26#1.base| 0) (= |ULTIMATE.start_main_#t~mem26#1.offset| 0))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem26#1.base, main_#t~mem26#1.offset;havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem27#1.base, main_#t~mem27#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L566 {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem27#1.base, main_#t~mem27#1.offset;havoc main_#t~mem27#1.base, main_#t~mem27#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~st~0#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume main_~st~0#1.base < #StackHeapBarrier; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem28#1.base, main_#t~mem28#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L568 {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_#t~mem28#1.base != 0 || main_#t~mem28#1.offset != 0);havoc main_#t~mem28#1.base, main_#t~mem28#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem31#1.base, main_#t~mem31#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L568-3 {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_#t~mem31#1.base != 0 || main_#t~mem31#1.offset != 0);havoc main_#t~mem31#1.base, main_#t~mem31#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~n~0#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume main_~n~0#1.base < #StackHeapBarrier; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~n~0#1.base || 1 == #valid[main_~n~0#1.base];call ULTIMATE.dealloc(main_~n~0#1.base, main_~n~0#1.offset); {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {21305#false} is VALID [2022-02-20 23:47:12,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {21305#false} assume !(1 == #valid[main_~s~0#1.base]); {21305#false} is VALID [2022-02-20 23:47:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:12,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:12,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {21305#false} assume !(1 == #valid[main_~s~0#1.base]); {21305#false} is VALID [2022-02-20 23:47:12,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {21305#false} is VALID [2022-02-20 23:47:12,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~n~0#1.base || 1 == #valid[main_~n~0#1.base];call ULTIMATE.dealloc(main_~n~0#1.base, main_~n~0#1.offset); {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume main_~n~0#1.base < #StackHeapBarrier; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~n~0#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_#t~mem31#1.base != 0 || main_#t~mem31#1.offset != 0);havoc main_#t~mem31#1.base, main_#t~mem31#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem31#1.base, main_#t~mem31#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L568-3 {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_#t~mem28#1.base != 0 || main_#t~mem28#1.offset != 0);havoc main_#t~mem28#1.base, main_#t~mem28#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem28#1.base, main_#t~mem28#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L568 {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume main_~st~0#1.base < #StackHeapBarrier; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~st~0#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem27#1.base, main_#t~mem27#1.offset;havoc main_#t~mem27#1.base, main_#t~mem27#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem27#1.base, main_#t~mem27#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L566 {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {21307#(and (= |ULTIMATE.start_main_#t~mem26#1.base| 0) (= |ULTIMATE.start_main_#t~mem26#1.offset| 0))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem26#1.base, main_#t~mem26#1.offset;havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {21308#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:12,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L565 {21307#(and (= |ULTIMATE.start_main_#t~mem26#1.base| 0) (= |ULTIMATE.start_main_#t~mem26#1.offset| 0))} is VALID [2022-02-20 23:47:12,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:12,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L561-1 {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:12,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {21304#true} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {21306#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:12,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {21304#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc25#1.base, main_#t~malloc25#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_#t~malloc25#1.base, main_#t~malloc25#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {21304#true} is VALID [2022-02-20 23:47:12,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {21304#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {21304#true} is VALID [2022-02-20 23:47:12,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {21304#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {21304#true} is VALID [2022-02-20 23:47:12,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {21304#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 8 + main_~root~0#1.offset, 4); srcloc: L536 {21304#true} is VALID [2022-02-20 23:47:12,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {21304#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L535-1 {21304#true} is VALID [2022-02-20 23:47:12,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {21304#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L535 {21304#true} is VALID [2022-02-20 23:47:12,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {21304#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~nondet19#1, main_#t~short20#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~nondet4#1, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~malloc29#1.base, main_#t~malloc29#1.offset, main_#t~mem30#1.base, main_#t~mem30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_#t~malloc32#1.base, main_#t~malloc32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {21304#true} is VALID [2022-02-20 23:47:12,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {21304#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(18, 2); {21304#true} is VALID [2022-02-20 23:47:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:12,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23415115] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:12,595 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:47:12,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-02-20 23:47:12,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216613072] [2022-02-20 23:47:12,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:12,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) Word has length 27 [2022-02-20 23:47:12,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:12,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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:47:12,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:12,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:12,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:12,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:12,619 INFO L87 Difference]: Start difference. First operand 168 states and 196 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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:47:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:12,927 INFO L93 Difference]: Finished difference Result 174 states and 202 transitions. [2022-02-20 23:47:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:12,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) Word has length 27 [2022-02-20 23:47:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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:47:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2022-02-20 23:47:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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:47:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2022-02-20 23:47:12,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 131 transitions. [2022-02-20 23:47:13,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:13,036 INFO L225 Difference]: With dead ends: 174 [2022-02-20 23:47:13,036 INFO L226 Difference]: Without dead ends: 174 [2022-02-20 23:47:13,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:13,037 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 12 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:13,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 341 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-20 23:47:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2022-02-20 23:47:13,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:13,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 170 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:13,040 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 170 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:13,040 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 170 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:13,042 INFO L93 Difference]: Finished difference Result 174 states and 202 transitions. [2022-02-20 23:47:13,042 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2022-02-20 23:47:13,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:13,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:13,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 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 174 states. [2022-02-20 23:47:13,043 INFO L87 Difference]: Start difference. First operand has 170 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 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 174 states. [2022-02-20 23:47:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:13,045 INFO L93 Difference]: Finished difference Result 174 states and 202 transitions. [2022-02-20 23:47:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2022-02-20 23:47:13,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:13,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:13,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:13,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2022-02-20 23:47:13,048 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 27 [2022-02-20 23:47:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:13,049 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2022-02-20 23:47:13,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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:47:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2022-02-20 23:47:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:47:13,049 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:13,049 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:13,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:13,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-02-20 23:47:13,264 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:13,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:13,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1856650752, now seen corresponding path program 1 times [2022-02-20 23:47:13,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:13,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446566877] [2022-02-20 23:47:13,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:13,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:13,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-20 23:47:13,322 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.addInterpolantClausePathSeg(ArrayInterpolator.java:2041) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.closeWeakPath(ArrayInterpolator.java:1402) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.interpolateWeakPathInfo(ArrayInterpolator.java:1070) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.buildRecursiveInterpolant(ArrayInterpolator.java:2229) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.interpolateStorePathInfoExt(ArrayInterpolator.java:1206) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator.computeWeakeqExtInterpolants(ArrayInterpolator.java:306) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator.computeInterpolants(ArrayInterpolator.java:197) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:326) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:145) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:250) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:879) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:803) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 23:47:13,327 INFO L158 Benchmark]: Toolchain (without parser) took 26153.73ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 58.3MB in the beginning and 80.1MB in the end (delta: -21.8MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2022-02-20 23:47:13,327 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory was 63.0MB in the beginning and 63.0MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:47:13,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.69ms. Allocated memory is still 92.3MB. Free memory was 58.1MB in the beginning and 60.2MB in the end (delta: -2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:47:13,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.21ms. Allocated memory is still 92.3MB. Free memory was 60.2MB in the beginning and 57.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:47:13,327 INFO L158 Benchmark]: Boogie Preprocessor took 57.54ms. Allocated memory is still 92.3MB. Free memory was 57.7MB in the beginning and 55.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:47:13,328 INFO L158 Benchmark]: RCFGBuilder took 821.99ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 55.2MB in the beginning and 70.5MB in the end (delta: -15.3MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2022-02-20 23:47:13,328 INFO L158 Benchmark]: TraceAbstraction took 24824.68ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 70.5MB in the beginning and 80.1MB in the end (delta: -9.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2022-02-20 23:47:13,329 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 92.3MB. Free memory was 63.0MB in the beginning and 63.0MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.69ms. Allocated memory is still 92.3MB. Free memory was 58.1MB in the beginning and 60.2MB in the end (delta: -2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.21ms. Allocated memory is still 92.3MB. Free memory was 60.2MB in the beginning and 57.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.54ms. Allocated memory is still 92.3MB. Free memory was 57.7MB in the beginning and 55.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 821.99ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 55.2MB in the beginning and 70.5MB in the end (delta: -15.3MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * TraceAbstraction took 24824.68ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 70.5MB in the beginning and 80.1MB in the end (delta: -9.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.addInterpolantClausePathSeg(ArrayInterpolator.java:2041) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:47:13,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-ext/tree_parent_ptr.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 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:47:15,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:47:15,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:47:15,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:47:15,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:47:15,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:47:15,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:47:15,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:47:15,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:47:15,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:47:15,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:47:15,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:47:15,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:47:15,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:47:15,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:47:15,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:47:15,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:47:15,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:47:15,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:47:15,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:47:15,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:47:15,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:47:15,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:47:15,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:47:15,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:47:15,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:47:15,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:47:15,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:47:15,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:47:15,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:47:15,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:47:15,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:47:15,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:47:15,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:47:15,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:47:15,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:47:15,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:47:15,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:47:15,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:47:15,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:47:15,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:47:15,324 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:47:15,357 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:47:15,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:47:15,359 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:47:15,359 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:47:15,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:47:15,360 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:47:15,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:47:15,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:47:15,361 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:47:15,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:47:15,362 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:47:15,362 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:47:15,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:47:15,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:47:15,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:47:15,363 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:47:15,363 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:47:15,363 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:47:15,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:47:15,364 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:47:15,364 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:47:15,364 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:47:15,364 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:47:15,371 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:47:15,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:47:15,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:47:15,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:47:15,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:15,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:47:15,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:47:15,373 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:47:15,373 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:47:15,373 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:47:15,373 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 -> 6e14aa3eeddc5d261248d26114db1375e0f229d6456e2c7754877a082dc10921 [2022-02-20 23:47:15,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:47:15,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:47:15,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:47:15,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:47:15,694 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:47:15,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2022-02-20 23:47:15,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bed1e22/c38c653fc84e4aa2b02851094c45eea7/FLAGc3ab7315a [2022-02-20 23:47:16,227 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:47:16,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2022-02-20 23:47:16,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bed1e22/c38c653fc84e4aa2b02851094c45eea7/FLAGc3ab7315a [2022-02-20 23:47:16,566 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bed1e22/c38c653fc84e4aa2b02851094c45eea7 [2022-02-20 23:47:16,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:47:16,569 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:47:16,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:16,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:47:16,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:47:16,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:16" (1/1) ... [2022-02-20 23:47:16,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c170ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:16, skipping insertion in model container [2022-02-20 23:47:16,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:16" (1/1) ... [2022-02-20 23:47:16,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:47:16,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:16,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:16,919 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:47:16,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:16,996 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:47:16,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:16 WrapperNode [2022-02-20 23:47:16,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:16,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:16,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:47:16,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:47:17,004 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:47:16" (1/1) ... [2022-02-20 23:47:17,032 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:47:16" (1/1) ... [2022-02-20 23:47:17,064 INFO L137 Inliner]: procedures = 124, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 136 [2022-02-20 23:47:17,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:17,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:47:17,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:47:17,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:47:17,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:16" (1/1) ... [2022-02-20 23:47:17,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:16" (1/1) ... [2022-02-20 23:47:17,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:16" (1/1) ... [2022-02-20 23:47:17,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:16" (1/1) ... [2022-02-20 23:47:17,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:16" (1/1) ... [2022-02-20 23:47:17,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:16" (1/1) ... [2022-02-20 23:47:17,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:16" (1/1) ... [2022-02-20 23:47:17,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:47:17,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:47:17,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:47:17,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:47:17,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:16" (1/1) ... [2022-02-20 23:47:17,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:17,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:17,155 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:47:17,156 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:47:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:47:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:47:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:47:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:47:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:47:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:47:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:47:17,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:47:17,274 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:47:17,276 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:47:17,888 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:47:17,897 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:47:17,897 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:47:17,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:17 BoogieIcfgContainer [2022-02-20 23:47:17,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:47:17,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:47:17,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:47:17,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:47:17,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:47:16" (1/3) ... [2022-02-20 23:47:17,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e40c743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:17, skipping insertion in model container [2022-02-20 23:47:17,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:16" (2/3) ... [2022-02-20 23:47:17,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e40c743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:17, skipping insertion in model container [2022-02-20 23:47:17,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:17" (3/3) ... [2022-02-20 23:47:17,909 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr.i [2022-02-20 23:47:17,913 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:47:17,914 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2022-02-20 23:47:17,961 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:47:17,970 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:47:17,970 INFO L340 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2022-02-20 23:47:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 72 states have (on average 2.236111111111111) internal successors, (161), 149 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:47:18,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:18,003 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:47:18,003 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:18,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:18,009 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:47:18,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:18,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410337092] [2022-02-20 23:47:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:18,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:18,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:18,027 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:47:18,034 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:47:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:18,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:47:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:18,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:18,200 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:47:18,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#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(18bv32, 2bv32); {153#true} is VALID [2022-02-20 23:47:18,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {161#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:18,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~root~0#1.base]); {154#false} is VALID [2022-02-20 23:47:18,220 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:47:18,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:18,221 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:18,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410337092] [2022-02-20 23:47:18,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410337092] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:18,222 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:18,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:18,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081400271] [2022-02-20 23:47:18,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:18,230 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:47:18,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:18,233 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:47:18,242 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:47:18,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:18,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:18,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:18,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:18,276 INFO L87 Difference]: Start difference. First operand has 150 states, 72 states have (on average 2.236111111111111) internal successors, (161), 149 states have internal predecessors, (161), 0 states have call successors, (0), 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:47:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,015 INFO L93 Difference]: Finished difference Result 167 states and 175 transitions. [2022-02-20 23:47:19,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:19,016 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:47:19,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:19,017 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:47:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2022-02-20 23:47:19,026 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:47:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2022-02-20 23:47:19,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 182 transitions. [2022-02-20 23:47:19,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:19,282 INFO L225 Difference]: With dead ends: 167 [2022-02-20 23:47:19,282 INFO L226 Difference]: Without dead ends: 163 [2022-02-20 23:47:19,283 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:47:19,286 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 113 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:19,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 121 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:19,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-02-20 23:47:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 145. [2022-02-20 23:47:19,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:19,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 145 states, 71 states have (on average 2.1549295774647885) internal successors, (153), 144 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,316 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 145 states, 71 states have (on average 2.1549295774647885) internal successors, (153), 144 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,316 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 145 states, 71 states have (on average 2.1549295774647885) internal successors, (153), 144 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,324 INFO L93 Difference]: Finished difference Result 163 states and 171 transitions. [2022-02-20 23:47:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2022-02-20 23:47:19,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:19,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:19,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 71 states have (on average 2.1549295774647885) internal successors, (153), 144 states have internal predecessors, (153), 0 states have call successors, (0), 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 163 states. [2022-02-20 23:47:19,327 INFO L87 Difference]: Start difference. First operand has 145 states, 71 states have (on average 2.1549295774647885) internal successors, (153), 144 states have internal predecessors, (153), 0 states have call successors, (0), 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 163 states. [2022-02-20 23:47:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,334 INFO L93 Difference]: Finished difference Result 163 states and 171 transitions. [2022-02-20 23:47:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2022-02-20 23:47:19,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:19,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:19,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:19,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 71 states have (on average 2.1549295774647885) internal successors, (153), 144 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2022-02-20 23:47:19,349 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 3 [2022-02-20 23:47:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:19,350 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2022-02-20 23:47:19,350 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:47:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2022-02-20 23:47:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:47:19,351 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:19,351 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:47:19,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:19,559 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:47:19,559 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:19,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:47:19,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:19,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045729122] [2022-02-20 23:47:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:19,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:19,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:19,563 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:47:19,565 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:47:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:19,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:19,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:19,642 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:47:19,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {802#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(18bv32, 2bv32); {802#true} is VALID [2022-02-20 23:47:19,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {802#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {810#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:19,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {810#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~root~0#1.offset), #length[main_~root~0#1.base]) && ~bvule32(main_~root~0#1.offset, ~bvadd32(4bv32, main_~root~0#1.offset))) && ~bvule32(0bv32, main_~root~0#1.offset)); {803#false} is VALID [2022-02-20 23:47:19,655 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:47:19,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:19,655 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:19,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045729122] [2022-02-20 23:47:19,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045729122] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:19,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:19,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:19,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257375852] [2022-02-20 23:47:19,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:19,659 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:47:19,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:19,659 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:47:19,664 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:47:19,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:19,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:19,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:19,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:19,665 INFO L87 Difference]: Start difference. First operand 145 states and 153 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:47:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,327 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2022-02-20 23:47:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:20,327 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:47:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:20,327 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:47:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2022-02-20 23:47:20,330 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:47:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2022-02-20 23:47:20,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2022-02-20 23:47:20,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:20,528 INFO L225 Difference]: With dead ends: 142 [2022-02-20 23:47:20,528 INFO L226 Difference]: Without dead ends: 142 [2022-02-20 23:47:20,529 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:47:20,530 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 85 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:20,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 137 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:20,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-02-20 23:47:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-02-20 23:47:20,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:20,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 142 states, 71 states have (on average 2.112676056338028) internal successors, (150), 141 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,537 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 142 states, 71 states have (on average 2.112676056338028) internal successors, (150), 141 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,537 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 142 states, 71 states have (on average 2.112676056338028) internal successors, (150), 141 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,541 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2022-02-20 23:47:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2022-02-20 23:47:20,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:20,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:20,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 71 states have (on average 2.112676056338028) internal successors, (150), 141 states have internal predecessors, (150), 0 states have call successors, (0), 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 142 states. [2022-02-20 23:47:20,543 INFO L87 Difference]: Start difference. First operand has 142 states, 71 states have (on average 2.112676056338028) internal successors, (150), 141 states have internal predecessors, (150), 0 states have call successors, (0), 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 142 states. [2022-02-20 23:47:20,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,547 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2022-02-20 23:47:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2022-02-20 23:47:20,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:20,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:20,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:20,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 71 states have (on average 2.112676056338028) internal successors, (150), 141 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2022-02-20 23:47:20,558 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 3 [2022-02-20 23:47:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:20,559 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2022-02-20 23:47:20,559 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:47:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2022-02-20 23:47:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:47:20,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:20,560 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:20,571 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:47:20,768 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:47:20,768 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:20,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:20,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027241, now seen corresponding path program 1 times [2022-02-20 23:47:20,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:20,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292104977] [2022-02-20 23:47:20,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:20,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:20,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:20,775 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:47:20,777 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:47:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:20,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:20,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:20,853 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:47:20,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {1381#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(18bv32, 2bv32); {1381#true} is VALID [2022-02-20 23:47:20,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {1381#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {1389#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:20,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {1389#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {1389#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:20,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {1389#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {1389#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:20,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {1389#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {1389#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:20,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {1389#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {1402#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:20,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {1402#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~n~0#1.base]); {1382#false} is VALID [2022-02-20 23:47:20,885 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:47:20,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:20,885 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:20,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292104977] [2022-02-20 23:47:20,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292104977] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:20,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:20,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:20,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275823598] [2022-02-20 23:47:20,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:20,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:47:20,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:20,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:20,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:20,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:20,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:20,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:20,899 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:21,631 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2022-02-20 23:47:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:21,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:47:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2022-02-20 23:47:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2022-02-20 23:47:21,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 174 transitions. [2022-02-20 23:47:21,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:21,805 INFO L225 Difference]: With dead ends: 147 [2022-02-20 23:47:21,805 INFO L226 Difference]: Without dead ends: 147 [2022-02-20 23:47:21,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:21,806 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 185 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:21,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 91 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:21,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-20 23:47:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2022-02-20 23:47:21,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:21,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 126 states, 72 states have (on average 1.875) internal successors, (135), 125 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,812 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 126 states, 72 states have (on average 1.875) internal successors, (135), 125 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,812 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 126 states, 72 states have (on average 1.875) internal successors, (135), 125 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:21,816 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2022-02-20 23:47:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2022-02-20 23:47:21,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:21,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:21,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 72 states have (on average 1.875) internal successors, (135), 125 states have internal predecessors, (135), 0 states have call successors, (0), 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 147 states. [2022-02-20 23:47:21,818 INFO L87 Difference]: Start difference. First operand has 126 states, 72 states have (on average 1.875) internal successors, (135), 125 states have internal predecessors, (135), 0 states have call successors, (0), 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 147 states. [2022-02-20 23:47:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:21,821 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2022-02-20 23:47:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2022-02-20 23:47:21,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:21,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:21,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:21,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 72 states have (on average 1.875) internal successors, (135), 125 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2022-02-20 23:47:21,826 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 7 [2022-02-20 23:47:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:21,826 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2022-02-20 23:47:21,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2022-02-20 23:47:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:47:21,827 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:21,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:21,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 23:47:22,035 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:47:22,035 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:22,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027242, now seen corresponding path program 1 times [2022-02-20 23:47:22,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:22,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749629829] [2022-02-20 23:47:22,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:22,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:22,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:22,038 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:47:22,039 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:47:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:22,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:22,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:22,133 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:47:22,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {1974#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(18bv32, 2bv32); {1974#true} is VALID [2022-02-20 23:47:22,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {1974#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {1982#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:22,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {1982#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {1982#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:22,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {1982#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {1982#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:22,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {1982#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {1982#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:22,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {1982#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {1995#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:22,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {1995#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, main_~n~0#1.offset), #length[main_~n~0#1.base]) && ~bvule32(main_~n~0#1.offset, ~bvadd32(4bv32, main_~n~0#1.offset))) && ~bvule32(0bv32, main_~n~0#1.offset)); {1975#false} is VALID [2022-02-20 23:47:22,200 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:47:22,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:22,201 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:22,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749629829] [2022-02-20 23:47:22,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749629829] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:22,201 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:22,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:22,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831336092] [2022-02-20 23:47:22,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:22,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:47:22,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:22,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:22,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:22,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:22,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:22,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:22,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:22,214 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:23,244 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2022-02-20 23:47:23,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:47:23,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:47:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-02-20 23:47:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-02-20 23:47:23,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-02-20 23:47:23,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:23,503 INFO L225 Difference]: With dead ends: 176 [2022-02-20 23:47:23,503 INFO L226 Difference]: Without dead ends: 176 [2022-02-20 23:47:23,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:23,504 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 172 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:23,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 165 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:47:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-02-20 23:47:23,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 158. [2022-02-20 23:47:23,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:23,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 158 states, 104 states have (on average 1.7403846153846154) internal successors, (181), 157 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,512 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 158 states, 104 states have (on average 1.7403846153846154) internal successors, (181), 157 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,513 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 158 states, 104 states have (on average 1.7403846153846154) internal successors, (181), 157 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:23,517 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2022-02-20 23:47:23,517 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2022-02-20 23:47:23,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:23,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:23,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 104 states have (on average 1.7403846153846154) internal successors, (181), 157 states have internal predecessors, (181), 0 states have call successors, (0), 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 176 states. [2022-02-20 23:47:23,518 INFO L87 Difference]: Start difference. First operand has 158 states, 104 states have (on average 1.7403846153846154) internal successors, (181), 157 states have internal predecessors, (181), 0 states have call successors, (0), 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 176 states. [2022-02-20 23:47:23,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:23,522 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2022-02-20 23:47:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2022-02-20 23:47:23,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:23,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:23,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:23,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 104 states have (on average 1.7403846153846154) internal successors, (181), 157 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2022-02-20 23:47:23,527 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 7 [2022-02-20 23:47:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:23,527 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2022-02-20 23:47:23,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2022-02-20 23:47:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:47:23,528 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:23,528 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:23,537 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:47:23,737 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:47:23,737 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:23,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:23,738 INFO L85 PathProgramCache]: Analyzing trace with hash 59271121, now seen corresponding path program 1 times [2022-02-20 23:47:23,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:23,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115135241] [2022-02-20 23:47:23,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:23,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:23,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:23,740 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:47:23,741 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:47:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:23,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:47:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:23,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:23,837 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:47:23,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {2686#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(18bv32, 2bv32); {2686#true} is VALID [2022-02-20 23:47:23,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {2686#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {2686#true} is VALID [2022-02-20 23:47:23,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {2686#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {2686#true} is VALID [2022-02-20 23:47:23,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {2686#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {2686#true} is VALID [2022-02-20 23:47:23,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {2686#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {2686#true} is VALID [2022-02-20 23:47:23,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {2686#true} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {2686#true} is VALID [2022-02-20 23:47:23,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {2686#true} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {2709#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:23,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {2709#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~s~0#1.base]); {2687#false} is VALID [2022-02-20 23:47:23,845 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:47:23,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:23,845 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:23,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115135241] [2022-02-20 23:47:23,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115135241] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:23,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:23,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:23,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415929225] [2022-02-20 23:47:23,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:23,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:23,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:23,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:23,856 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:47:23,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:23,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:23,857 INFO L87 Difference]: Start difference. First operand 158 states and 181 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:24,320 INFO L93 Difference]: Finished difference Result 162 states and 185 transitions. [2022-02-20 23:47:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:24,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 23:47:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 23:47:24,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2022-02-20 23:47:24,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:24,465 INFO L225 Difference]: With dead ends: 162 [2022-02-20 23:47:24,465 INFO L226 Difference]: Without dead ends: 162 [2022-02-20 23:47:24,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:47:24,466 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 10 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:24,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 185 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-02-20 23:47:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2022-02-20 23:47:24,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:24,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 158 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 157 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:24,472 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 158 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 157 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:24,472 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 158 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 157 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:24,476 INFO L93 Difference]: Finished difference Result 162 states and 185 transitions. [2022-02-20 23:47:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 185 transitions. [2022-02-20 23:47:24,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:24,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:24,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 157 states have internal predecessors, (183), 0 states have call successors, (0), 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 162 states. [2022-02-20 23:47:24,477 INFO L87 Difference]: Start difference. First operand has 158 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 157 states have internal predecessors, (183), 0 states have call successors, (0), 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 162 states. [2022-02-20 23:47:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:24,481 INFO L93 Difference]: Finished difference Result 162 states and 185 transitions. [2022-02-20 23:47:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 185 transitions. [2022-02-20 23:47:24,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:24,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:24,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:24,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 157 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2022-02-20 23:47:24,485 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 8 [2022-02-20 23:47:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:24,485 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2022-02-20 23:47:24,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2022-02-20 23:47:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:47:24,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:24,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:24,492 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:47:24,686 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:47:24,686 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash 59271122, now seen corresponding path program 1 times [2022-02-20 23:47:24,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:24,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837561623] [2022-02-20 23:47:24,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:24,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:24,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:24,689 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:47:24,689 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:47:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:24,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:24,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:24,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:24,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {3356#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(18bv32, 2bv32); {3356#true} is VALID [2022-02-20 23:47:24,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {3356#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {3356#true} is VALID [2022-02-20 23:47:24,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {3356#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {3356#true} is VALID [2022-02-20 23:47:24,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {3356#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {3356#true} is VALID [2022-02-20 23:47:24,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {3356#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {3356#true} is VALID [2022-02-20 23:47:24,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {3356#true} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {3356#true} is VALID [2022-02-20 23:47:24,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {3356#true} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {3379#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:24,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {3379#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~s~0#1.offset), #length[main_~s~0#1.base]) && ~bvule32(main_~s~0#1.offset, ~bvadd32(4bv32, main_~s~0#1.offset))) && ~bvule32(0bv32, main_~s~0#1.offset)); {3357#false} is VALID [2022-02-20 23:47:24,788 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:47:24,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:24,788 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:24,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837561623] [2022-02-20 23:47:24,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837561623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:24,789 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:24,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:24,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894575807] [2022-02-20 23:47:24,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:24,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:24,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:24,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:24,799 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:47:24,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:24,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:24,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:24,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:24,800 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:25,349 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2022-02-20 23:47:25,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:25,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:25,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 23:47:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 23:47:25,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2022-02-20 23:47:25,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:25,504 INFO L225 Difference]: With dead ends: 160 [2022-02-20 23:47:25,504 INFO L226 Difference]: Without dead ends: 160 [2022-02-20 23:47:25,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:47:25,505 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:25,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 175 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-20 23:47:25,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2022-02-20 23:47:25,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:25,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 156 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 155 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:25,522 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 156 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 155 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:25,522 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 156 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 155 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:25,526 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2022-02-20 23:47:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2022-02-20 23:47:25,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:25,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:25,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 155 states have internal predecessors, (180), 0 states have call successors, (0), 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 160 states. [2022-02-20 23:47:25,528 INFO L87 Difference]: Start difference. First operand has 156 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 155 states have internal predecessors, (180), 0 states have call successors, (0), 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 160 states. [2022-02-20 23:47:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:25,531 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2022-02-20 23:47:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2022-02-20 23:47:25,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:25,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:25,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:25,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 106 states have (on average 1.6981132075471699) internal successors, (180), 155 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 180 transitions. [2022-02-20 23:47:25,539 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 180 transitions. Word has length 8 [2022-02-20 23:47:25,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:25,539 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 180 transitions. [2022-02-20 23:47:25,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:47:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 180 transitions. [2022-02-20 23:47:25,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:47:25,540 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:25,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:25,551 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:47:25,743 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:47:25,744 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:25,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1229976389, now seen corresponding path program 1 times [2022-02-20 23:47:25,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:25,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140496875] [2022-02-20 23:47:25,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:25,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:25,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:25,746 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:47:25,746 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:47:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:25,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:47:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:25,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:25,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {4018#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(18bv32, 2bv32); {4018#true} is VALID [2022-02-20 23:47:25,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {4018#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {4018#true} is VALID [2022-02-20 23:47:25,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {4018#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {4018#true} is VALID [2022-02-20 23:47:25,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {4018#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {4018#true} is VALID [2022-02-20 23:47:25,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {4018#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {4018#true} is VALID [2022-02-20 23:47:25,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {4018#true} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {4018#true} is VALID [2022-02-20 23:47:25,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {4018#true} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {4041#(not (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:25,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {4041#(not (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {4041#(not (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:25,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {4041#(not (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L561-1 {4041#(not (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:25,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {4041#(not (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)))} assume !(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32); {4019#false} is VALID [2022-02-20 23:47:25,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {4019#false} main_#res#1 := 0bv32; {4019#false} is VALID [2022-02-20 23:47:25,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {4019#false} assume !(#valid == main_old_#valid#1); {4019#false} is VALID [2022-02-20 23:47:25,859 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:47:25,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:25,859 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:25,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140496875] [2022-02-20 23:47:25,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140496875] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:25,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:25,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:25,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088763328] [2022-02-20 23:47:25,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:25,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:47:25,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:25,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:25,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:25,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:25,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:25,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:25,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:25,877 INFO L87 Difference]: Start difference. First operand 156 states and 180 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:26,221 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2022-02-20 23:47:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:26,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:47:26,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2022-02-20 23:47:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2022-02-20 23:47:26,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 133 transitions. [2022-02-20 23:47:26,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:26,352 INFO L225 Difference]: With dead ends: 157 [2022-02-20 23:47:26,352 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:47:26,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:47:26,353 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:26,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 240 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:26,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:47:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2022-02-20 23:47:26,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:26,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 156 states, 106 states have (on average 1.6886792452830188) internal successors, (179), 155 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,357 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 156 states, 106 states have (on average 1.6886792452830188) internal successors, (179), 155 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,357 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 156 states, 106 states have (on average 1.6886792452830188) internal successors, (179), 155 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:26,361 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2022-02-20 23:47:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2022-02-20 23:47:26,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:26,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:26,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 106 states have (on average 1.6886792452830188) internal successors, (179), 155 states have internal predecessors, (179), 0 states have call successors, (0), 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 157 states. [2022-02-20 23:47:26,362 INFO L87 Difference]: Start difference. First operand has 156 states, 106 states have (on average 1.6886792452830188) internal successors, (179), 155 states have internal predecessors, (179), 0 states have call successors, (0), 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 157 states. [2022-02-20 23:47:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:26,366 INFO L93 Difference]: Finished difference Result 157 states and 180 transitions. [2022-02-20 23:47:26,366 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2022-02-20 23:47:26,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:26,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:26,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:26,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 106 states have (on average 1.6886792452830188) internal successors, (179), 155 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2022-02-20 23:47:26,370 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 12 [2022-02-20 23:47:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:26,370 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2022-02-20 23:47:26,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2022-02-20 23:47:26,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:47:26,371 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:26,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:26,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-20 23:47:26,580 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:47:26,580 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:26,581 INFO L85 PathProgramCache]: Analyzing trace with hash 525436859, now seen corresponding path program 1 times [2022-02-20 23:47:26,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:26,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739886246] [2022-02-20 23:47:26,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:26,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:26,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:26,583 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:47:26,584 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:47:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:26,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:26,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:26,692 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:47:26,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {4683#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(18bv32, 2bv32); {4683#true} is VALID [2022-02-20 23:47:26,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {4683#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {4683#true} is VALID [2022-02-20 23:47:26,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {4683#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {4683#true} is VALID [2022-02-20 23:47:26,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {4683#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {4683#true} is VALID [2022-02-20 23:47:26,731 INFO L290 TraceCheckUtils]: 4: Hoare triple {4683#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {4683#true} is VALID [2022-02-20 23:47:26,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {4683#true} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {4683#true} is VALID [2022-02-20 23:47:26,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {4683#true} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {4706#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:26,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {4706#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {4706#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:26,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {4706#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L561-1 {4706#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:26,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {4706#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {4716#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:26,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {4716#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) (_ bv1 1))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L565 {4716#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:26,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {4716#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) (_ bv1 1))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {4716#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:26,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {4716#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~st~0#1.base]); {4684#false} is VALID [2022-02-20 23:47:26,735 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:47:26,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:26,736 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:26,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739886246] [2022-02-20 23:47:26,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739886246] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:26,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:26,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:26,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850043052] [2022-02-20 23:47:26,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:26,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:26,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:26,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:26,754 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:47:26,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:26,754 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:26,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:26,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:26,755 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:27,576 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2022-02-20 23:47:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:27,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:27,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2022-02-20 23:47:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2022-02-20 23:47:27,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 153 transitions. [2022-02-20 23:47:27,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:27,721 INFO L225 Difference]: With dead ends: 169 [2022-02-20 23:47:27,721 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 23:47:27,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:27,721 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 43 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:27,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 220 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 23:47:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 153. [2022-02-20 23:47:27,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:27,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 153 states, 108 states have (on average 1.6388888888888888) internal successors, (177), 152 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:27,725 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 153 states, 108 states have (on average 1.6388888888888888) internal successors, (177), 152 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:27,726 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 153 states, 108 states have (on average 1.6388888888888888) internal successors, (177), 152 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:27,729 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2022-02-20 23:47:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 193 transitions. [2022-02-20 23:47:27,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:27,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:27,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 108 states have (on average 1.6388888888888888) internal successors, (177), 152 states have internal predecessors, (177), 0 states have call successors, (0), 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 169 states. [2022-02-20 23:47:27,731 INFO L87 Difference]: Start difference. First operand has 153 states, 108 states have (on average 1.6388888888888888) internal successors, (177), 152 states have internal predecessors, (177), 0 states have call successors, (0), 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 169 states. [2022-02-20 23:47:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:27,733 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2022-02-20 23:47:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 193 transitions. [2022-02-20 23:47:27,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:27,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:27,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:27,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.6388888888888888) internal successors, (177), 152 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2022-02-20 23:47:27,737 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 13 [2022-02-20 23:47:27,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:27,737 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2022-02-20 23:47:27,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2022-02-20 23:47:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:47:27,738 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:27,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:27,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:47:27,947 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:47:27,948 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:27,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:27,948 INFO L85 PathProgramCache]: Analyzing trace with hash 525436860, now seen corresponding path program 1 times [2022-02-20 23:47:27,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:27,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468520991] [2022-02-20 23:47:27,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:27,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:27,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:27,950 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:47:27,950 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:47:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:28,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:28,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:28,075 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:47:28,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {5387#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(18bv32, 2bv32); {5387#true} is VALID [2022-02-20 23:47:28,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {5387#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {5387#true} is VALID [2022-02-20 23:47:28,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {5387#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {5387#true} is VALID [2022-02-20 23:47:28,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {5387#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {5387#true} is VALID [2022-02-20 23:47:28,154 INFO L290 TraceCheckUtils]: 4: Hoare triple {5387#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {5387#true} is VALID [2022-02-20 23:47:28,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {5387#true} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {5387#true} is VALID [2022-02-20 23:47:28,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {5387#true} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {5410#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:28,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {5410#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {5410#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:28,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {5410#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L561-1 {5410#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:28,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {5410#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {5420#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:28,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {5420#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L565 {5420#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:28,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {5420#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {5420#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:28,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {5420#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_~st~0#1.offset)), #length[main_~st~0#1.base]) && ~bvule32(~bvadd32(4bv32, main_~st~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_~st~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_~st~0#1.offset))); {5388#false} is VALID [2022-02-20 23:47:28,160 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:47:28,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:28,160 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:28,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468520991] [2022-02-20 23:47:28,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468520991] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:28,161 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:28,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:28,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671666876] [2022-02-20 23:47:28,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:28,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:28,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:28,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:28,181 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:47:28,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:28,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:28,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:28,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:28,183 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:29,153 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2022-02-20 23:47:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:29,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2022-02-20 23:47:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2022-02-20 23:47:29,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 176 transitions. [2022-02-20 23:47:29,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:29,351 INFO L225 Difference]: With dead ends: 192 [2022-02-20 23:47:29,351 INFO L226 Difference]: Without dead ends: 192 [2022-02-20 23:47:29,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:29,352 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 51 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:29,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 189 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:29,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-02-20 23:47:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 160. [2022-02-20 23:47:29,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:29,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 160 states, 119 states have (on average 1.596638655462185) internal successors, (190), 159 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,355 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 160 states, 119 states have (on average 1.596638655462185) internal successors, (190), 159 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,356 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 160 states, 119 states have (on average 1.596638655462185) internal successors, (190), 159 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:29,359 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2022-02-20 23:47:29,359 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 218 transitions. [2022-02-20 23:47:29,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:29,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:29,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 119 states have (on average 1.596638655462185) internal successors, (190), 159 states have internal predecessors, (190), 0 states have call successors, (0), 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 192 states. [2022-02-20 23:47:29,360 INFO L87 Difference]: Start difference. First operand has 160 states, 119 states have (on average 1.596638655462185) internal successors, (190), 159 states have internal predecessors, (190), 0 states have call successors, (0), 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 192 states. [2022-02-20 23:47:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:29,363 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2022-02-20 23:47:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 218 transitions. [2022-02-20 23:47:29,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:29,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:29,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:29,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 119 states have (on average 1.596638655462185) internal successors, (190), 159 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 190 transitions. [2022-02-20 23:47:29,367 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 190 transitions. Word has length 13 [2022-02-20 23:47:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:29,367 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 190 transitions. [2022-02-20 23:47:29,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:47:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 190 transitions. [2022-02-20 23:47:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:47:29,368 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:29,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:29,379 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:47:29,577 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:47:29,578 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:29,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:29,578 INFO L85 PathProgramCache]: Analyzing trace with hash 654691773, now seen corresponding path program 1 times [2022-02-20 23:47:29,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:29,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705308976] [2022-02-20 23:47:29,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:29,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:29,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:29,579 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:29,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:47:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:29,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:47:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:29,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:29,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {6167#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(18bv32, 2bv32); {6167#true} is VALID [2022-02-20 23:47:29,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {6167#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {6167#true} is VALID [2022-02-20 23:47:29,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {6167#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {6167#true} is VALID [2022-02-20 23:47:29,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {6167#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {6167#true} is VALID [2022-02-20 23:47:29,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {6167#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {6167#true} is VALID [2022-02-20 23:47:29,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {6167#true} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {6167#true} is VALID [2022-02-20 23:47:29,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {6167#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L541-2 {6167#true} is VALID [2022-02-20 23:47:29,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {6167#true} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {6167#true} is VALID [2022-02-20 23:47:29,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {6167#true} assume !main_#t~short7#1; {6196#(not |ULTIMATE.start_main_#t~short7#1|)} is VALID [2022-02-20 23:47:29,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {6196#(not |ULTIMATE.start_main_#t~short7#1|)} assume !!main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {6168#false} is VALID [2022-02-20 23:47:29,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {6168#false} assume !(0bv32 != main_#t~nondet8#1);havoc main_#t~nondet8#1; {6168#false} is VALID [2022-02-20 23:47:29,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {6168#false} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L544 {6168#false} is VALID [2022-02-20 23:47:29,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {6168#false} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {6168#false} is VALID [2022-02-20 23:47:29,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {6168#false} assume !(1bv1 == #valid[main_~n~0#1.base]); {6168#false} is VALID [2022-02-20 23:47:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:29,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:29,681 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:29,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705308976] [2022-02-20 23:47:29,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705308976] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:29,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:29,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:29,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846923631] [2022-02-20 23:47:29,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:29,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:47:29,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:29,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:47:29,698 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:47:29,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:29,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:29,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:29,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:29,699 INFO L87 Difference]: Start difference. First operand 160 states and 190 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:47:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:30,027 INFO L93 Difference]: Finished difference Result 162 states and 192 transitions. [2022-02-20 23:47:30,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:30,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:47:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:47:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-20 23:47:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:47:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-20 23:47:30,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2022-02-20 23:47:30,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:30,154 INFO L225 Difference]: With dead ends: 162 [2022-02-20 23:47:30,154 INFO L226 Difference]: Without dead ends: 162 [2022-02-20 23:47:30,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:47:30,155 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:30,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:30,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-02-20 23:47:30,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-02-20 23:47:30,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:30,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 162 states, 121 states have (on average 1.5867768595041323) internal successors, (192), 161 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:30,158 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 162 states, 121 states have (on average 1.5867768595041323) internal successors, (192), 161 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:30,159 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 162 states, 121 states have (on average 1.5867768595041323) internal successors, (192), 161 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:30,161 INFO L93 Difference]: Finished difference Result 162 states and 192 transitions. [2022-02-20 23:47:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2022-02-20 23:47:30,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:30,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:30,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 121 states have (on average 1.5867768595041323) internal successors, (192), 161 states have internal predecessors, (192), 0 states have call successors, (0), 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 162 states. [2022-02-20 23:47:30,163 INFO L87 Difference]: Start difference. First operand has 162 states, 121 states have (on average 1.5867768595041323) internal successors, (192), 161 states have internal predecessors, (192), 0 states have call successors, (0), 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 162 states. [2022-02-20 23:47:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:30,165 INFO L93 Difference]: Finished difference Result 162 states and 192 transitions. [2022-02-20 23:47:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2022-02-20 23:47:30,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:30,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:30,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:30,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 121 states have (on average 1.5867768595041323) internal successors, (192), 161 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2022-02-20 23:47:30,169 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 14 [2022-02-20 23:47:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:30,169 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2022-02-20 23:47:30,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:47:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2022-02-20 23:47:30,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:47:30,170 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:30,170 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:47:30,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:30,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:30,379 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:30,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1866203262, now seen corresponding path program 1 times [2022-02-20 23:47:30,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:30,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190930497] [2022-02-20 23:47:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:30,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:30,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:30,381 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:30,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:47:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:30,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:30,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:30,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {6859#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(18bv32, 2bv32); {6864#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:30,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {6864#(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_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {6868#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} is VALID [2022-02-20 23:47:30,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {6868#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {6868#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} is VALID [2022-02-20 23:47:30,972 INFO L290 TraceCheckUtils]: 3: Hoare triple {6868#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {6868#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} is VALID [2022-02-20 23:47:30,977 INFO L290 TraceCheckUtils]: 4: Hoare triple {6868#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {6868#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} is VALID [2022-02-20 23:47:30,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {6868#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {6868#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} is VALID [2022-02-20 23:47:30,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {6868#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {6884#(and (bvult |ULTIMATE.start_main_~s~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:30,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {6884#(and (bvult |ULTIMATE.start_main_~s~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {6884#(and (bvult |ULTIMATE.start_main_~s~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:30,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {6884#(and (bvult |ULTIMATE.start_main_~s~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L561-1 {6884#(and (bvult |ULTIMATE.start_main_~s~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:30,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {6884#(and (bvult |ULTIMATE.start_main_~s~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {6894#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:31,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {6894#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L565 {6894#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:31,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {6894#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {6894#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:31,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {6894#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} SUMMARY for call main_#t~mem25#1.base, main_#t~mem25#1.offset := read~$Pointer$(main_~st~0#1.base, ~bvadd32(4bv32, main_~st~0#1.offset), 4bv32); srcloc: L566 {6894#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:31,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {6894#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem25#1.base, main_#t~mem25#1.offset;havoc main_#t~mem25#1.base, main_#t~mem25#1.offset; {6894#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:31,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {6894#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} assume 0bv32 == main_~st~0#1.offset; {6894#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:31,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {6894#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} assume !~bvult32(main_~st~0#1.base, #StackHeapBarrier); {6860#false} is VALID [2022-02-20 23:47:31,013 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:47:31,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:31,013 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:31,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190930497] [2022-02-20 23:47:31,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190930497] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:31,013 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:31,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:31,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143232924] [2022-02-20 23:47:31,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:31,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:47:31,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:31,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:31,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:31,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:31,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:31,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:31,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:31,074 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:31,813 INFO L93 Difference]: Finished difference Result 213 states and 251 transitions. [2022-02-20 23:47:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:31,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:47:31,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:31,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2022-02-20 23:47:31,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2022-02-20 23:47:31,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 169 transitions. [2022-02-20 23:47:32,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:32,042 INFO L225 Difference]: With dead ends: 213 [2022-02-20 23:47:32,042 INFO L226 Difference]: Without dead ends: 213 [2022-02-20 23:47:32,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:32,043 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 85 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:32,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 356 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2022-02-20 23:47:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-02-20 23:47:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 203. [2022-02-20 23:47:32,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:32,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 203 states, 162 states have (on average 1.5493827160493827) internal successors, (251), 202 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,047 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 203 states, 162 states have (on average 1.5493827160493827) internal successors, (251), 202 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,048 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 203 states, 162 states have (on average 1.5493827160493827) internal successors, (251), 202 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:32,052 INFO L93 Difference]: Finished difference Result 213 states and 251 transitions. [2022-02-20 23:47:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2022-02-20 23:47:32,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:32,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:32,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 162 states have (on average 1.5493827160493827) internal successors, (251), 202 states have internal predecessors, (251), 0 states have call successors, (0), 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 213 states. [2022-02-20 23:47:32,053 INFO L87 Difference]: Start difference. First operand has 203 states, 162 states have (on average 1.5493827160493827) internal successors, (251), 202 states have internal predecessors, (251), 0 states have call successors, (0), 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 213 states. [2022-02-20 23:47:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:32,057 INFO L93 Difference]: Finished difference Result 213 states and 251 transitions. [2022-02-20 23:47:32,057 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 251 transitions. [2022-02-20 23:47:32,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:32,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:32,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:32,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 162 states have (on average 1.5493827160493827) internal successors, (251), 202 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2022-02-20 23:47:32,061 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 16 [2022-02-20 23:47:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:32,061 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2022-02-20 23:47:32,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2022-02-20 23:47:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:47:32,062 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:32,062 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:47:32,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:32,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:32,263 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:32,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:32,264 INFO L85 PathProgramCache]: Analyzing trace with hash 588601668, now seen corresponding path program 1 times [2022-02-20 23:47:32,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:32,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305020580] [2022-02-20 23:47:32,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:32,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:32,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:32,266 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:32,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:47:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:32,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:32,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:32,402 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:47:32,420 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 11 treesize of output 7 [2022-02-20 23:47:32,444 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 17 treesize of output 9 [2022-02-20 23:47:32,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {7754#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(18bv32, 2bv32); {7754#true} is VALID [2022-02-20 23:47:32,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {7754#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {7754#true} is VALID [2022-02-20 23:47:32,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {7754#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {7754#true} is VALID [2022-02-20 23:47:32,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {7754#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {7754#true} is VALID [2022-02-20 23:47:32,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {7754#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {7754#true} is VALID [2022-02-20 23:47:32,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {7754#true} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {7754#true} is VALID [2022-02-20 23:47:32,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {7754#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L541-2 {7754#true} is VALID [2022-02-20 23:47:32,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {7754#true} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {7754#true} is VALID [2022-02-20 23:47:32,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {7754#true} assume !main_#t~short7#1; {7754#true} is VALID [2022-02-20 23:47:32,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {7754#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {7754#true} is VALID [2022-02-20 23:47:32,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {7754#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L540-8 {7754#true} is VALID [2022-02-20 23:47:32,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {7754#true} assume (main_#t~mem11#1.base == 0bv32 && main_#t~mem11#1.offset == 0bv32) && 0bv32 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(12bv32); {7792#(= (select |#valid| |ULTIMATE.start_main_#t~malloc13#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:32,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {7792#(= (select |#valid| |ULTIMATE.start_main_#t~malloc13#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L547 {7796#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)))} is VALID [2022-02-20 23:47:32,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {7796#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)))} havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; {7796#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)))} is VALID [2022-02-20 23:47:32,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {7796#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L548 {7803#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:32,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {7803#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_#t~mem14#1.base]); {7755#false} is VALID [2022-02-20 23:47:32,481 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:47:32,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:32,481 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:32,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305020580] [2022-02-20 23:47:32,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305020580] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:32,482 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:32,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:32,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195259042] [2022-02-20 23:47:32,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:32,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:47:32,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:32,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:32,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:32,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:32,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:32,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:32,504 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:33,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:33,679 INFO L93 Difference]: Finished difference Result 202 states and 249 transitions. [2022-02-20 23:47:33,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:33,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:47:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-02-20 23:47:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-02-20 23:47:33,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 120 transitions. [2022-02-20 23:47:33,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:33,821 INFO L225 Difference]: With dead ends: 202 [2022-02-20 23:47:33,821 INFO L226 Difference]: Without dead ends: 202 [2022-02-20 23:47:33,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:33,822 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 6 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:33,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 274 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:47:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-02-20 23:47:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-02-20 23:47:33,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:33,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 202 states, 162 states have (on average 1.537037037037037) internal successors, (249), 201 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:33,826 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 202 states, 162 states have (on average 1.537037037037037) internal successors, (249), 201 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:33,826 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 202 states, 162 states have (on average 1.537037037037037) internal successors, (249), 201 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:33,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:33,830 INFO L93 Difference]: Finished difference Result 202 states and 249 transitions. [2022-02-20 23:47:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 249 transitions. [2022-02-20 23:47:33,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:33,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:33,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 162 states have (on average 1.537037037037037) internal successors, (249), 201 states have internal predecessors, (249), 0 states have call successors, (0), 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 202 states. [2022-02-20 23:47:33,831 INFO L87 Difference]: Start difference. First operand has 202 states, 162 states have (on average 1.537037037037037) internal successors, (249), 201 states have internal predecessors, (249), 0 states have call successors, (0), 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 202 states. [2022-02-20 23:47:33,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:33,834 INFO L93 Difference]: Finished difference Result 202 states and 249 transitions. [2022-02-20 23:47:33,835 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 249 transitions. [2022-02-20 23:47:33,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:33,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:33,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:33,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 162 states have (on average 1.537037037037037) internal successors, (249), 201 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 249 transitions. [2022-02-20 23:47:33,839 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 249 transitions. Word has length 16 [2022-02-20 23:47:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:33,839 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 249 transitions. [2022-02-20 23:47:33,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 249 transitions. [2022-02-20 23:47:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:47:33,840 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:33,840 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:47:33,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:34,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:34,047 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash 588601669, now seen corresponding path program 1 times [2022-02-20 23:47:34,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:34,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592529422] [2022-02-20 23:47:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:34,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:34,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:34,049 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:34,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:47:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:34,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:47:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:34,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:34,170 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:47:34,197 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 11 treesize of output 7 [2022-02-20 23:47:34,202 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 11 treesize of output 7 [2022-02-20 23:47:34,250 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 17 treesize of output 9 [2022-02-20 23:47:34,254 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 15 treesize of output 7 [2022-02-20 23:47:34,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {8618#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(18bv32, 2bv32); {8618#true} is VALID [2022-02-20 23:47:34,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {8618#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {8618#true} is VALID [2022-02-20 23:47:34,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {8618#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {8618#true} is VALID [2022-02-20 23:47:34,275 INFO L290 TraceCheckUtils]: 3: Hoare triple {8618#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {8618#true} is VALID [2022-02-20 23:47:34,275 INFO L290 TraceCheckUtils]: 4: Hoare triple {8618#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {8618#true} is VALID [2022-02-20 23:47:34,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {8618#true} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {8618#true} is VALID [2022-02-20 23:47:34,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {8618#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L541-2 {8618#true} is VALID [2022-02-20 23:47:34,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {8618#true} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {8618#true} is VALID [2022-02-20 23:47:34,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {8618#true} assume !main_#t~short7#1; {8618#true} is VALID [2022-02-20 23:47:34,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {8618#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {8618#true} is VALID [2022-02-20 23:47:34,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {8618#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L540-8 {8618#true} is VALID [2022-02-20 23:47:34,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {8618#true} assume (main_#t~mem11#1.base == 0bv32 && main_#t~mem11#1.offset == 0bv32) && 0bv32 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(12bv32); {8656#(and (= |ULTIMATE.start_main_#t~malloc13#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:47:34,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {8656#(and (= |ULTIMATE.start_main_#t~malloc13#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L547 {8660#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv12 32)))} is VALID [2022-02-20 23:47:34,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {8660#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv12 32)))} havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; {8660#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv12 32)))} is VALID [2022-02-20 23:47:34,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {8660#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv12 32)))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L548 {8667#(and (= (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_#t~mem14#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:34,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {8667#(and (= (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_#t~mem14#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_#t~mem14#1.offset), #length[main_#t~mem14#1.base]) && ~bvule32(main_#t~mem14#1.offset, ~bvadd32(4bv32, main_#t~mem14#1.offset))) && ~bvule32(0bv32, main_#t~mem14#1.offset)); {8619#false} is VALID [2022-02-20 23:47:34,282 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:47:34,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:34,283 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:34,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592529422] [2022-02-20 23:47:34,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592529422] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:34,283 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:34,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:34,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420140242] [2022-02-20 23:47:34,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:34,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:47:34,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:34,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:34,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:34,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:34,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:34,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:34,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:34,301 INFO L87 Difference]: Start difference. First operand 202 states and 249 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:35,527 INFO L93 Difference]: Finished difference Result 201 states and 247 transitions. [2022-02-20 23:47:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:35,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:47:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-02-20 23:47:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-02-20 23:47:35,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 119 transitions. [2022-02-20 23:47:35,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:35,676 INFO L225 Difference]: With dead ends: 201 [2022-02-20 23:47:35,676 INFO L226 Difference]: Without dead ends: 201 [2022-02-20 23:47:35,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:35,677 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:35,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 252 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:47:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-02-20 23:47:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-02-20 23:47:35,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:35,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 201 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 200 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,682 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 201 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 200 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,682 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 201 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 200 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:35,685 INFO L93 Difference]: Finished difference Result 201 states and 247 transitions. [2022-02-20 23:47:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 247 transitions. [2022-02-20 23:47:35,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:35,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:35,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 200 states have internal predecessors, (247), 0 states have call successors, (0), 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 201 states. [2022-02-20 23:47:35,687 INFO L87 Difference]: Start difference. First operand has 201 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 200 states have internal predecessors, (247), 0 states have call successors, (0), 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 201 states. [2022-02-20 23:47:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:35,690 INFO L93 Difference]: Finished difference Result 201 states and 247 transitions. [2022-02-20 23:47:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 247 transitions. [2022-02-20 23:47:35,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:35,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:35,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:35,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.5246913580246915) internal successors, (247), 200 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 247 transitions. [2022-02-20 23:47:35,695 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 247 transitions. Word has length 16 [2022-02-20 23:47:35,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:35,695 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 247 transitions. [2022-02-20 23:47:35,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,695 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 247 transitions. [2022-02-20 23:47:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:47:35,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:35,696 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:47:35,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:35,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:35,908 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:35,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:35,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1441986912, now seen corresponding path program 1 times [2022-02-20 23:47:35,909 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:35,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004378226] [2022-02-20 23:47:35,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:35,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:35,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:35,910 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:35,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:47:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:35,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:47:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:36,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:36,022 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 11 treesize of output 7 [2022-02-20 23:47:36,027 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 11 treesize of output 7 [2022-02-20 23:47:36,067 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:47:36,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:47:36,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:36,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-02-20 23:47:36,114 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:47:36,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:47:36,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:36,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2022-02-20 23:47:36,159 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 15 treesize of output 7 [2022-02-20 23:47:36,162 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 15 treesize of output 7 [2022-02-20 23:47:36,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {9478#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(18bv32, 2bv32); {9478#true} is VALID [2022-02-20 23:47:36,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {9478#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {9478#true} is VALID [2022-02-20 23:47:36,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {9478#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {9489#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:36,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {9489#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {9489#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:36,202 INFO L290 TraceCheckUtils]: 4: Hoare triple {9489#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {9489#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:36,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {9489#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {9499#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:36,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {9499#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L541-2 {9503#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem5#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:36,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {9503#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem5#1.base| (_ bv0 32)))} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {9507#(not |ULTIMATE.start_main_#t~short7#1|)} is VALID [2022-02-20 23:47:36,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {9507#(not |ULTIMATE.start_main_#t~short7#1|)} assume main_#t~short7#1; {9479#false} is VALID [2022-02-20 23:47:36,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {9479#false} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L540-3 {9479#false} is VALID [2022-02-20 23:47:36,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {9479#false} main_#t~short7#1 := main_#t~mem6#1.base != 0bv32 || main_#t~mem6#1.offset != 0bv32; {9479#false} is VALID [2022-02-20 23:47:36,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {9479#false} assume !!main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {9479#false} is VALID [2022-02-20 23:47:36,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {9479#false} assume !(0bv32 != main_#t~nondet8#1);havoc main_#t~nondet8#1; {9479#false} is VALID [2022-02-20 23:47:36,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {9479#false} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L544 {9479#false} is VALID [2022-02-20 23:47:36,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {9479#false} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {9479#false} is VALID [2022-02-20 23:47:36,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {9479#false} assume !(1bv1 == #valid[main_~n~0#1.base]); {9479#false} is VALID [2022-02-20 23:47:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:36,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:36,207 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:36,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004378226] [2022-02-20 23:47:36,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004378226] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:36,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:36,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:47:36,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19194892] [2022-02-20 23:47:36,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:36,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:47:36,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:36,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:36,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:36,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:36,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:36,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:36,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:36,229 INFO L87 Difference]: Start difference. First operand 201 states and 247 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:37,760 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2022-02-20 23:47:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:47:37,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:47:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2022-02-20 23:47:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2022-02-20 23:47:37,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 155 transitions. [2022-02-20 23:47:37,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:37,965 INFO L225 Difference]: With dead ends: 198 [2022-02-20 23:47:37,965 INFO L226 Difference]: Without dead ends: 198 [2022-02-20 23:47:37,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:47:37,966 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:37,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 429 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:47:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-02-20 23:47:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 179. [2022-02-20 23:47:37,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:37,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 179 states, 140 states have (on average 1.5) internal successors, (210), 178 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:37,969 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 179 states, 140 states have (on average 1.5) internal successors, (210), 178 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:37,969 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 179 states, 140 states have (on average 1.5) internal successors, (210), 178 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:37,975 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2022-02-20 23:47:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 230 transitions. [2022-02-20 23:47:37,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:37,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:37,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 140 states have (on average 1.5) internal successors, (210), 178 states have internal predecessors, (210), 0 states have call successors, (0), 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 198 states. [2022-02-20 23:47:37,976 INFO L87 Difference]: Start difference. First operand has 179 states, 140 states have (on average 1.5) internal successors, (210), 178 states have internal predecessors, (210), 0 states have call successors, (0), 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 198 states. [2022-02-20 23:47:37,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:37,980 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2022-02-20 23:47:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 230 transitions. [2022-02-20 23:47:37,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:37,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:37,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:37,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 140 states have (on average 1.5) internal successors, (210), 178 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 210 transitions. [2022-02-20 23:47:37,983 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 210 transitions. Word has length 16 [2022-02-20 23:47:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:37,984 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 210 transitions. [2022-02-20 23:47:37,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 210 transitions. [2022-02-20 23:47:37,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:47:37,984 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:37,985 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:37,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:38,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:38,194 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:38,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:38,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1875001061, now seen corresponding path program 1 times [2022-02-20 23:47:38,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:38,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641174601] [2022-02-20 23:47:38,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:38,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:38,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:38,196 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:38,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:47:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:38,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:47:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:38,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:38,324 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:47:38,368 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:47:38,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-02-20 23:47:38,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 23:47:38,535 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 27 treesize of output 15 [2022-02-20 23:47:38,625 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 14 treesize of output 16 [2022-02-20 23:47:38,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {10310#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(18bv32, 2bv32); {10310#true} is VALID [2022-02-20 23:47:38,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {10310#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {10318#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:38,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {10318#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {10318#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:38,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {10318#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {10318#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:38,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {10318#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {10318#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:38,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {10318#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {10318#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:38,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {10318#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {10334#(and (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:47:38,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {10334#(and (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {10334#(and (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:47:38,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {10334#(and (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L561-1 {10341#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~s~0#1.base|)))} is VALID [2022-02-20 23:47:38,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {10341#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~s~0#1.base|)))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {10345#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:38,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {10345#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L565 {10345#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:38,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {10345#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {10345#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:38,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {10345#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} SUMMARY for call main_#t~mem25#1.base, main_#t~mem25#1.offset := read~$Pointer$(main_~st~0#1.base, ~bvadd32(4bv32, main_~st~0#1.offset), 4bv32); srcloc: L566 {10355#(and (not (= |ULTIMATE.start_main_#t~mem25#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (bvadd (select |#valid| |ULTIMATE.start_main_#t~mem25#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:38,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {10355#(and (not (= |ULTIMATE.start_main_#t~mem25#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (bvadd (select |#valid| |ULTIMATE.start_main_#t~mem25#1.base|) (_ bv1 1)) (_ bv0 1)))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem25#1.base, main_#t~mem25#1.offset;havoc main_#t~mem25#1.base, main_#t~mem25#1.offset; {10359#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:47:38,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {10359#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))} assume 0bv32 == main_~st~0#1.offset; {10359#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:47:38,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {10359#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))} assume ~bvult32(main_~st~0#1.base, #StackHeapBarrier); {10359#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:47:38,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {10359#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))} assume 0bv32 == main_~st~0#1.base || 1bv1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {10369#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:38,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {10369#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))} assume !(1bv1 == #valid[main_~n~0#1.base]); {10311#false} is VALID [2022-02-20 23:47:38,656 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:47:38,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:38,656 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:38,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641174601] [2022-02-20 23:47:38,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641174601] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:38,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:38,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:47:38,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685666450] [2022-02-20 23:47:38,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:38,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:47:38,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:38,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:38,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:47:38,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:38,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:47:38,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:47:38,677 INFO L87 Difference]: Start difference. First operand 179 states and 210 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:41,058 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2022-02-20 23:47:41,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:47:41,058 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:47:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2022-02-20 23:47:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2022-02-20 23:47:41,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 154 transitions. [2022-02-20 23:47:41,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:41,222 INFO L225 Difference]: With dead ends: 200 [2022-02-20 23:47:41,222 INFO L226 Difference]: Without dead ends: 200 [2022-02-20 23:47:41,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:47:41,223 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 223 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:41,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 237 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 23:47:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-20 23:47:41,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 184. [2022-02-20 23:47:41,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:41,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 184 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 183 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:41,227 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 184 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 183 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:41,227 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 184 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 183 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:41,230 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2022-02-20 23:47:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 231 transitions. [2022-02-20 23:47:41,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:41,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:41,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 183 states have internal predecessors, (217), 0 states have call successors, (0), 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 200 states. [2022-02-20 23:47:41,231 INFO L87 Difference]: Start difference. First operand has 184 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 183 states have internal predecessors, (217), 0 states have call successors, (0), 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 200 states. [2022-02-20 23:47:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:41,234 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2022-02-20 23:47:41,234 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 231 transitions. [2022-02-20 23:47:41,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:41,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:41,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:41,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 183 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 217 transitions. [2022-02-20 23:47:41,238 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 217 transitions. Word has length 18 [2022-02-20 23:47:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:41,238 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 217 transitions. [2022-02-20 23:47:41,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 217 transitions. [2022-02-20 23:47:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:47:41,239 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:41,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:41,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:41,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:41,448 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 73 more)] === [2022-02-20 23:47:41,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:41,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1875001062, now seen corresponding path program 1 times [2022-02-20 23:47:41,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:41,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974928044] [2022-02-20 23:47:41,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:41,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:41,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:41,450 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:41,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:47:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:41,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 23:47:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:41,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:41,591 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:47:41,596 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:47:41,699 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:47:41,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-20 23:47:41,714 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:41,715 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 12 treesize of output 12 [2022-02-20 23:47:41,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 23:47:41,813 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:47:41,928 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 25 treesize of output 13 [2022-02-20 23:47:41,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-02-20 23:47:42,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {11170#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(18bv32, 2bv32); {11170#true} is VALID [2022-02-20 23:47:42,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {11170#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {11178#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:42,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {11178#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L535 {11178#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:42,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {11178#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L535-1 {11178#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:42,013 INFO L290 TraceCheckUtils]: 4: Hoare triple {11178#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(8bv32, main_~root~0#1.offset), 4bv32); srcloc: L536 {11178#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:42,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {11178#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {11178#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:42,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {11178#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {11194#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:42,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {11194#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {11194#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:42,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {11194#(and (= (select |#length| |ULTIMATE.start_main_~root~0#1.base|) (_ bv12 32)) (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L561-1 {11201#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (_ bv12 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))))} is VALID [2022-02-20 23:47:42,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {11201#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (_ bv12 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~s~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {11205#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv12 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:47:42,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {11205#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv12 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32)))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L565 {11205#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv12 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:47:42,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {11205#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv12 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32)))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {11205#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv12 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:47:42,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {11205#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv12 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32)))} SUMMARY for call main_#t~mem25#1.base, main_#t~mem25#1.offset := read~$Pointer$(main_~st~0#1.base, ~bvadd32(4bv32, main_~st~0#1.offset), 4bv32); srcloc: L566 {11215#(and (= |ULTIMATE.start_main_#t~mem25#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~mem25#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:47:42,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {11215#(and (= |ULTIMATE.start_main_#t~mem25#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~mem25#1.base|) (_ bv12 32)))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem25#1.base, main_#t~mem25#1.offset;havoc main_#t~mem25#1.base, main_#t~mem25#1.offset; {11219#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:42,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {11219#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} assume 0bv32 == main_~st~0#1.offset; {11219#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:42,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {11219#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} assume ~bvult32(main_~st~0#1.base, #StackHeapBarrier); {11219#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:42,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {11219#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} assume 0bv32 == main_~st~0#1.base || 1bv1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {11219#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:42,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {11219#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, main_~n~0#1.offset), #length[main_~n~0#1.base]) && ~bvule32(main_~n~0#1.offset, ~bvadd32(4bv32, main_~n~0#1.offset))) && ~bvule32(0bv32, main_~n~0#1.offset)); {11171#false} is VALID [2022-02-20 23:47:42,024 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:47:42,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:42,024 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:42,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974928044] [2022-02-20 23:47:42,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974928044] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:42,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:42,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:47:42,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124168200] [2022-02-20 23:47:42,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:47:42,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:42,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:42,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:47:42,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:42,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:47:42,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:47:42,049 INFO L87 Difference]: Start difference. First operand 184 states and 217 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)