./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list_flag-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/list_flag-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27e1465127a7716c3a524ea62953f8f9857cdca3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:56:59,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:56:59,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:56:59,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:56:59,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:56:59,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:56:59,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:56:59,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:56:59,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:56:59,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:56:59,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:56:59,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:56:59,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:56:59,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:56:59,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:56:59,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:56:59,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:56:59,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:56:59,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:56:59,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:56:59,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:56:59,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:56:59,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:56:59,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:56:59,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:56:59,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:56:59,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:56:59,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:56:59,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:56:59,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:56:59,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:56:59,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:56:59,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:56:59,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:56:59,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:56:59,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:56:59,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:56:59,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:56:59,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:56:59,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:56:59,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:56:59,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:56:59,132 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:56:59,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:56:59,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:56:59,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:56:59,134 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:56:59,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:56:59,135 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:56:59,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:56:59,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:56:59,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:56:59,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:56:59,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:56:59,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:56:59,136 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:56:59,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:56:59,140 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:56:59,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:56:59,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:56:59,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:56:59,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:56:59,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:56:59,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:56:59,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:56:59,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:56:59,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:56:59,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:56:59,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:56:59,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:56:59,144 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:56:59,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 ! call(__VERIFIER_error())) ) 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 -> 27e1465127a7716c3a524ea62953f8f9857cdca3 [2020-07-28 17:56:59,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:56:59,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:56:59,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:56:59,454 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:56:59,455 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:56:59,456 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-1.i [2020-07-28 17:56:59,522 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad099405/da2136820f8c407382035dfeec497122/FLAGb40d2ea2e [2020-07-28 17:57:00,027 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:57:00,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-1.i [2020-07-28 17:57:00,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad099405/da2136820f8c407382035dfeec497122/FLAGb40d2ea2e [2020-07-28 17:57:00,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad099405/da2136820f8c407382035dfeec497122 [2020-07-28 17:57:00,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:57:00,412 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:57:00,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:57:00,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:57:00,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:57:00,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:57:00" (1/1) ... [2020-07-28 17:57:00,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a37da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:57:00, skipping insertion in model container [2020-07-28 17:57:00,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:57:00" (1/1) ... [2020-07-28 17:57:00,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:57:00,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:57:00,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:57:00,983 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:57:01,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:57:01,120 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:57:01,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:57:01 WrapperNode [2020-07-28 17:57:01,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:57:01,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:57:01,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:57:01,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:57:01,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:57:01" (1/1) ... [2020-07-28 17:57:01,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:57:01" (1/1) ... [2020-07-28 17:57:01,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:57:01,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:57:01,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:57:01,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:57:01,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:57:01" (1/1) ... [2020-07-28 17:57:01,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:57:01" (1/1) ... [2020-07-28 17:57:01,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:57:01" (1/1) ... [2020-07-28 17:57:01,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:57:01" (1/1) ... [2020-07-28 17:57:01,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:57:01" (1/1) ... [2020-07-28 17:57:01,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:57:01" (1/1) ... [2020-07-28 17:57:01,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:57:01" (1/1) ... [2020-07-28 17:57:01,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:57:01,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:57:01,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:57:01,219 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:57:01,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:57:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:57:01,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:57:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:57:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 17:57:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-28 17:57:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-28 17:57:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:57:01,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:57:01,705 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:57:01,705 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-07-28 17:57:01,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:57:01 BoogieIcfgContainer [2020-07-28 17:57:01,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:57:01,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:57:01,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:57:01,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:57:01,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:57:00" (1/3) ... [2020-07-28 17:57:01,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25eda748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:57:01, skipping insertion in model container [2020-07-28 17:57:01,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:57:01" (2/3) ... [2020-07-28 17:57:01,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25eda748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:57:01, skipping insertion in model container [2020-07-28 17:57:01,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:57:01" (3/3) ... [2020-07-28 17:57:01,717 INFO L109 eAbstractionObserver]: Analyzing ICFG list_flag-1.i [2020-07-28 17:57:01,726 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:57:01,732 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:57:01,742 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:57:01,762 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:57:01,762 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:57:01,763 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:57:01,763 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:57:01,763 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:57:01,763 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:57:01,763 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:57:01,764 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:57:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-28 17:57:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:57:01,783 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:57:01,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:57:01,784 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:57:01,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:57:01,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1941242346, now seen corresponding path program 1 times [2020-07-28 17:57:01,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:57:01,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651446311] [2020-07-28 17:57:01,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:57:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:57:01,947 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2020-07-28 17:57:01,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~nondet4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem7, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem9, main_#t~mem11, main_~flag~0, main_~p~0.base, main_~p~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~flag~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~p~0.base, main_~p~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~t~0.base, main_~t~0.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {28#true} is VALID [2020-07-28 17:57:01,948 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#true} assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); {28#true} is VALID [2020-07-28 17:57:01,948 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#true} main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {28#true} is VALID [2020-07-28 17:57:01,950 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#true} assume !true; {29#false} is VALID [2020-07-28 17:57:01,950 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#false} call write~int(3, main_~p~0.base, main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {29#false} is VALID [2020-07-28 17:57:01,951 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#false} assume !(0 != main_~flag~0); {29#false} is VALID [2020-07-28 17:57:01,951 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#false} assume !true; {29#false} is VALID [2020-07-28 17:57:01,951 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#false} call main_#t~mem11 := read~int(main_~p~0.base, main_~p~0.offset, 4); {29#false} is VALID [2020-07-28 17:57:01,952 INFO L280 TraceCheckUtils]: 9: Hoare triple {29#false} assume 3 != main_#t~mem11;havoc main_#t~mem11; {29#false} is VALID [2020-07-28 17:57:01,952 INFO L280 TraceCheckUtils]: 10: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-28 17:57:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:57:01,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651446311] [2020-07-28 17:57:01,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:57:01,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:57:01,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729728983] [2020-07-28 17:57:01,964 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:57:01,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:57:01,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:57:01,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:57:01,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:57:01,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:57:02,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:57:02,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:57:02,007 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2020-07-28 17:57:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:02,074 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2020-07-28 17:57:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:57:02,074 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:57:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:57:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:57:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2020-07-28 17:57:02,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:57:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2020-07-28 17:57:02,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 53 transitions. [2020-07-28 17:57:02,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:57:02,207 INFO L225 Difference]: With dead ends: 38 [2020-07-28 17:57:02,207 INFO L226 Difference]: Without dead ends: 20 [2020-07-28 17:57:02,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:57:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-28 17:57:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-28 17:57:02,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:57:02,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-28 17:57:02,246 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 17:57:02,247 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 17:57:02,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:02,250 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-07-28 17:57:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-07-28 17:57:02,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:57:02,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:57:02,251 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 17:57:02,252 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 17:57:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:02,254 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-07-28 17:57:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-07-28 17:57:02,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:57:02,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:57:02,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:57:02,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:57:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-28 17:57:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-07-28 17:57:02,264 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2020-07-28 17:57:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:57:02,264 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-07-28 17:57:02,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:57:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-07-28 17:57:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 17:57:02,266 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:57:02,266 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:57:02,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:57:02,266 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:57:02,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:57:02,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1795403316, now seen corresponding path program 1 times [2020-07-28 17:57:02,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:57:02,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967915285] [2020-07-28 17:57:02,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:57:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:57:02,391 INFO L280 TraceCheckUtils]: 0: Hoare triple {140#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {140#true} is VALID [2020-07-28 17:57:02,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {140#true} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~nondet4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem7, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem9, main_#t~mem11, main_~flag~0, main_~p~0.base, main_~p~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~flag~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~p~0.base, main_~p~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~t~0.base, main_~t~0.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {140#true} is VALID [2020-07-28 17:57:02,392 INFO L280 TraceCheckUtils]: 2: Hoare triple {140#true} assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); {140#true} is VALID [2020-07-28 17:57:02,393 INFO L280 TraceCheckUtils]: 3: Hoare triple {140#true} main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {142#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 17:57:02,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {142#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {142#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 17:57:02,395 INFO L280 TraceCheckUtils]: 5: Hoare triple {142#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4; {142#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 17:57:02,397 INFO L280 TraceCheckUtils]: 6: Hoare triple {142#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} call write~int(3, main_~p~0.base, main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {143#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} is VALID [2020-07-28 17:57:02,398 INFO L280 TraceCheckUtils]: 7: Hoare triple {143#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} assume !(0 != main_~flag~0); {143#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} is VALID [2020-07-28 17:57:02,399 INFO L280 TraceCheckUtils]: 8: Hoare triple {143#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} call main_#t~mem9 := read~int(main_~p~0.base, main_~p~0.offset, 4); {143#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} is VALID [2020-07-28 17:57:02,401 INFO L280 TraceCheckUtils]: 9: Hoare triple {143#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} assume !(1 == main_#t~mem9);havoc main_#t~mem9; {143#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} is VALID [2020-07-28 17:57:02,402 INFO L280 TraceCheckUtils]: 10: Hoare triple {143#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} call main_#t~mem11 := read~int(main_~p~0.base, main_~p~0.offset, 4); {144#(= 3 |ULTIMATE.start_main_#t~mem11|)} is VALID [2020-07-28 17:57:02,403 INFO L280 TraceCheckUtils]: 11: Hoare triple {144#(= 3 |ULTIMATE.start_main_#t~mem11|)} assume 3 != main_#t~mem11;havoc main_#t~mem11; {141#false} is VALID [2020-07-28 17:57:02,403 INFO L280 TraceCheckUtils]: 12: Hoare triple {141#false} assume !false; {141#false} is VALID [2020-07-28 17:57:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:57:02,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967915285] [2020-07-28 17:57:02,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:57:02,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 17:57:02,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153997204] [2020-07-28 17:57:02,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-28 17:57:02,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:57:02,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:57:02,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:57:02,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:57:02,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:57:02,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:57:02,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:57:02,433 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 5 states. [2020-07-28 17:57:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:02,712 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-28 17:57:02,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:57:02,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-28 17:57:02,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:57:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:57:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-28 17:57:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:57:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2020-07-28 17:57:02,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2020-07-28 17:57:02,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:57:02,807 INFO L225 Difference]: With dead ends: 44 [2020-07-28 17:57:02,807 INFO L226 Difference]: Without dead ends: 40 [2020-07-28 17:57:02,808 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:57:02,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-28 17:57:02,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2020-07-28 17:57:02,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:57:02,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 28 states. [2020-07-28 17:57:02,825 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 28 states. [2020-07-28 17:57:02,825 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 28 states. [2020-07-28 17:57:02,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:02,828 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-28 17:57:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-28 17:57:02,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:57:02,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:57:02,830 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 40 states. [2020-07-28 17:57:02,830 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 40 states. [2020-07-28 17:57:02,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:02,833 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-28 17:57:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-28 17:57:02,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:57:02,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:57:02,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:57:02,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:57:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 17:57:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-07-28 17:57:02,837 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 13 [2020-07-28 17:57:02,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:57:02,838 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-07-28 17:57:02,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:57:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-07-28 17:57:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:57:02,839 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:57:02,840 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:57:02,840 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:57:02,840 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:57:02,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:57:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1242942375, now seen corresponding path program 1 times [2020-07-28 17:57:02,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:57:02,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777595571] [2020-07-28 17:57:02,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:57:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:57:02,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {317#true} is VALID [2020-07-28 17:57:02,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {317#true} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~nondet4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem7, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem9, main_#t~mem11, main_~flag~0, main_~p~0.base, main_~p~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~flag~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~p~0.base, main_~p~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~t~0.base, main_~t~0.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {317#true} is VALID [2020-07-28 17:57:02,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {317#true} assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); {317#true} is VALID [2020-07-28 17:57:02,931 INFO L280 TraceCheckUtils]: 3: Hoare triple {317#true} main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {319#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 17:57:02,932 INFO L280 TraceCheckUtils]: 4: Hoare triple {319#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {319#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 17:57:02,933 INFO L280 TraceCheckUtils]: 5: Hoare triple {319#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4; {319#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 17:57:02,935 INFO L280 TraceCheckUtils]: 6: Hoare triple {319#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} call write~int(3, main_~p~0.base, main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {320#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} is VALID [2020-07-28 17:57:02,936 INFO L280 TraceCheckUtils]: 7: Hoare triple {320#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} assume !(0 != main_~flag~0); {320#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} is VALID [2020-07-28 17:57:02,937 INFO L280 TraceCheckUtils]: 8: Hoare triple {320#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} call main_#t~mem9 := read~int(main_~p~0.base, main_~p~0.offset, 4); {321#(= 3 |ULTIMATE.start_main_#t~mem9|)} is VALID [2020-07-28 17:57:02,939 INFO L280 TraceCheckUtils]: 9: Hoare triple {321#(= 3 |ULTIMATE.start_main_#t~mem9|)} assume !!(1 == main_#t~mem9);havoc main_#t~mem9;call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem10.base, main_#t~mem10.offset;havoc main_#t~mem10.base, main_#t~mem10.offset; {318#false} is VALID [2020-07-28 17:57:02,939 INFO L280 TraceCheckUtils]: 10: Hoare triple {318#false} call main_#t~mem9 := read~int(main_~p~0.base, main_~p~0.offset, 4); {318#false} is VALID [2020-07-28 17:57:02,940 INFO L280 TraceCheckUtils]: 11: Hoare triple {318#false} assume !(1 == main_#t~mem9);havoc main_#t~mem9; {318#false} is VALID [2020-07-28 17:57:02,940 INFO L280 TraceCheckUtils]: 12: Hoare triple {318#false} call main_#t~mem11 := read~int(main_~p~0.base, main_~p~0.offset, 4); {318#false} is VALID [2020-07-28 17:57:02,940 INFO L280 TraceCheckUtils]: 13: Hoare triple {318#false} assume 3 != main_#t~mem11;havoc main_#t~mem11; {318#false} is VALID [2020-07-28 17:57:02,941 INFO L280 TraceCheckUtils]: 14: Hoare triple {318#false} assume !false; {318#false} is VALID [2020-07-28 17:57:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:57:02,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777595571] [2020-07-28 17:57:02,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:57:02,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 17:57:02,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060851539] [2020-07-28 17:57:02,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-28 17:57:02,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:57:02,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:57:02,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:57:02,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:57:02,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:57:02,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:57:02,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:57:02,968 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 5 states. [2020-07-28 17:57:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:03,204 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-28 17:57:03,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:57:03,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-28 17:57:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:57:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:57:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-28 17:57:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:57:03,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2020-07-28 17:57:03,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2020-07-28 17:57:03,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:57:03,288 INFO L225 Difference]: With dead ends: 46 [2020-07-28 17:57:03,289 INFO L226 Difference]: Without dead ends: 38 [2020-07-28 17:57:03,289 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:57:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-28 17:57:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2020-07-28 17:57:03,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:57:03,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 26 states. [2020-07-28 17:57:03,303 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 26 states. [2020-07-28 17:57:03,303 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 26 states. [2020-07-28 17:57:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:03,306 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-07-28 17:57:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2020-07-28 17:57:03,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:57:03,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:57:03,308 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 38 states. [2020-07-28 17:57:03,308 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 38 states. [2020-07-28 17:57:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:03,311 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-07-28 17:57:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2020-07-28 17:57:03,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:57:03,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:57:03,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:57:03,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:57:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 17:57:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-07-28 17:57:03,316 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2020-07-28 17:57:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:57:03,316 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-07-28 17:57:03,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:57:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-07-28 17:57:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:57:03,318 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:57:03,318 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:57:03,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 17:57:03,319 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:57:03,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:57:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash -799146, now seen corresponding path program 1 times [2020-07-28 17:57:03,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:57:03,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903277510] [2020-07-28 17:57:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:57:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:57:03,397 INFO L280 TraceCheckUtils]: 0: Hoare triple {490#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {490#true} is VALID [2020-07-28 17:57:03,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {490#true} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~nondet4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem7, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem9, main_#t~mem11, main_~flag~0, main_~p~0.base, main_~p~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~flag~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~p~0.base, main_~p~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~t~0.base, main_~t~0.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {490#true} is VALID [2020-07-28 17:57:03,398 INFO L280 TraceCheckUtils]: 2: Hoare triple {490#true} assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); {490#true} is VALID [2020-07-28 17:57:03,399 INFO L280 TraceCheckUtils]: 3: Hoare triple {490#true} main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {492#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 17:57:03,400 INFO L280 TraceCheckUtils]: 4: Hoare triple {492#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {492#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 17:57:03,402 INFO L280 TraceCheckUtils]: 5: Hoare triple {492#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4; {492#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} is VALID [2020-07-28 17:57:03,403 INFO L280 TraceCheckUtils]: 6: Hoare triple {492#(and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))} call write~int(3, main_~p~0.base, main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {493#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} is VALID [2020-07-28 17:57:03,404 INFO L280 TraceCheckUtils]: 7: Hoare triple {493#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} assume 0 != main_~flag~0; {493#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} is VALID [2020-07-28 17:57:03,406 INFO L280 TraceCheckUtils]: 8: Hoare triple {493#(= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3)} call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); {494#(= 3 |ULTIMATE.start_main_#t~mem7|)} is VALID [2020-07-28 17:57:03,407 INFO L280 TraceCheckUtils]: 9: Hoare triple {494#(= 3 |ULTIMATE.start_main_#t~mem7|)} assume !!(2 == main_#t~mem7);havoc main_#t~mem7;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~mem8.base, main_#t~mem8.offset; {491#false} is VALID [2020-07-28 17:57:03,407 INFO L280 TraceCheckUtils]: 10: Hoare triple {491#false} call main_#t~mem7 := read~int(main_~p~0.base, main_~p~0.offset, 4); {491#false} is VALID [2020-07-28 17:57:03,408 INFO L280 TraceCheckUtils]: 11: Hoare triple {491#false} assume !(2 == main_#t~mem7);havoc main_#t~mem7; {491#false} is VALID [2020-07-28 17:57:03,408 INFO L280 TraceCheckUtils]: 12: Hoare triple {491#false} call main_#t~mem11 := read~int(main_~p~0.base, main_~p~0.offset, 4); {491#false} is VALID [2020-07-28 17:57:03,409 INFO L280 TraceCheckUtils]: 13: Hoare triple {491#false} assume 3 != main_#t~mem11;havoc main_#t~mem11; {491#false} is VALID [2020-07-28 17:57:03,409 INFO L280 TraceCheckUtils]: 14: Hoare triple {491#false} assume !false; {491#false} is VALID [2020-07-28 17:57:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:57:03,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903277510] [2020-07-28 17:57:03,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:57:03,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 17:57:03,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298660903] [2020-07-28 17:57:03,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-28 17:57:03,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:57:03,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:57:03,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:57:03,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:57:03,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:57:03,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:57:03,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:57:03,436 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 5 states. [2020-07-28 17:57:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:03,653 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-07-28 17:57:03,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:57:03,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-28 17:57:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:57:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:57:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2020-07-28 17:57:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:57:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2020-07-28 17:57:03,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2020-07-28 17:57:03,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:57:03,732 INFO L225 Difference]: With dead ends: 44 [2020-07-28 17:57:03,732 INFO L226 Difference]: Without dead ends: 34 [2020-07-28 17:57:03,733 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:57:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-28 17:57:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 22. [2020-07-28 17:57:03,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:57:03,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 22 states. [2020-07-28 17:57:03,739 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 22 states. [2020-07-28 17:57:03,740 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 22 states. [2020-07-28 17:57:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:03,742 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-28 17:57:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-07-28 17:57:03,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:57:03,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:57:03,743 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 34 states. [2020-07-28 17:57:03,743 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 34 states. [2020-07-28 17:57:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:03,745 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-28 17:57:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2020-07-28 17:57:03,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:57:03,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:57:03,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:57:03,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:57:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 17:57:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-28 17:57:03,749 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2020-07-28 17:57:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:57:03,749 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-28 17:57:03,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:57:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-28 17:57:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 17:57:03,750 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:57:03,751 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:57:03,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 17:57:03,751 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:57:03,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:57:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash -172690303, now seen corresponding path program 1 times [2020-07-28 17:57:03,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:57:03,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549179941] [2020-07-28 17:57:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:57:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:57:03,804 INFO L280 TraceCheckUtils]: 0: Hoare triple {647#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {647#true} is VALID [2020-07-28 17:57:03,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {647#true} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6.base, main_#t~mem6.offset, main_#t~nondet4, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem7, main_#t~mem10.base, main_#t~mem10.offset, main_#t~mem9, main_#t~mem11, main_~flag~0, main_~p~0.base, main_~p~0.offset, main_~a~0.base, main_~a~0.offset, main_~t~0.base, main_~t~0.offset;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~flag~0 := main_#t~nondet2;havoc main_#t~nondet2;havoc main_~p~0.base, main_~p~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~t~0.base, main_~t~0.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(8);main_~a~0.base, main_~a~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {647#true} is VALID [2020-07-28 17:57:03,804 INFO L280 TraceCheckUtils]: 2: Hoare triple {647#true} assume !(main_~a~0.base == 0 && main_~a~0.offset == 0); {647#true} is VALID [2020-07-28 17:57:03,805 INFO L280 TraceCheckUtils]: 3: Hoare triple {647#true} main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {647#true} is VALID [2020-07-28 17:57:03,805 INFO L280 TraceCheckUtils]: 4: Hoare triple {647#true} assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {647#true} is VALID [2020-07-28 17:57:03,805 INFO L280 TraceCheckUtils]: 5: Hoare triple {647#true} assume !!(0 != main_#t~nondet4);havoc main_#t~nondet4; {647#true} is VALID [2020-07-28 17:57:03,806 INFO L280 TraceCheckUtils]: 6: Hoare triple {647#true} assume 0 != main_~flag~0;call write~int(1, main_~p~0.base, main_~p~0.offset, 4); {649#(not (= 0 ULTIMATE.start_main_~flag~0))} is VALID [2020-07-28 17:57:03,807 INFO L280 TraceCheckUtils]: 7: Hoare triple {649#(not (= 0 ULTIMATE.start_main_~flag~0))} call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~t~0.base, main_~t~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset; {649#(not (= 0 ULTIMATE.start_main_~flag~0))} is VALID [2020-07-28 17:57:03,808 INFO L280 TraceCheckUtils]: 8: Hoare triple {649#(not (= 0 ULTIMATE.start_main_~flag~0))} assume !(main_~t~0.base == 0 && main_~t~0.offset == 0); {649#(not (= 0 ULTIMATE.start_main_~flag~0))} is VALID [2020-07-28 17:57:03,809 INFO L280 TraceCheckUtils]: 9: Hoare triple {649#(not (= 0 ULTIMATE.start_main_~flag~0))} call write~$Pointer$(main_~t~0.base, main_~t~0.offset, main_~p~0.base, 4 + main_~p~0.offset, 4);call main_#t~mem6.base, main_#t~mem6.offset := read~$Pointer$(main_~p~0.base, 4 + main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_#t~mem6.base, main_#t~mem6.offset;havoc main_#t~mem6.base, main_#t~mem6.offset; {649#(not (= 0 ULTIMATE.start_main_~flag~0))} is VALID [2020-07-28 17:57:03,809 INFO L280 TraceCheckUtils]: 10: Hoare triple {649#(not (= 0 ULTIMATE.start_main_~flag~0))} assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {649#(not (= 0 ULTIMATE.start_main_~flag~0))} is VALID [2020-07-28 17:57:03,810 INFO L280 TraceCheckUtils]: 11: Hoare triple {649#(not (= 0 ULTIMATE.start_main_~flag~0))} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4; {649#(not (= 0 ULTIMATE.start_main_~flag~0))} is VALID [2020-07-28 17:57:03,811 INFO L280 TraceCheckUtils]: 12: Hoare triple {649#(not (= 0 ULTIMATE.start_main_~flag~0))} call write~int(3, main_~p~0.base, main_~p~0.offset, 4);main_~p~0.base, main_~p~0.offset := main_~a~0.base, main_~a~0.offset; {649#(not (= 0 ULTIMATE.start_main_~flag~0))} is VALID [2020-07-28 17:57:03,812 INFO L280 TraceCheckUtils]: 13: Hoare triple {649#(not (= 0 ULTIMATE.start_main_~flag~0))} assume !(0 != main_~flag~0); {648#false} is VALID [2020-07-28 17:57:03,812 INFO L280 TraceCheckUtils]: 14: Hoare triple {648#false} call main_#t~mem9 := read~int(main_~p~0.base, main_~p~0.offset, 4); {648#false} is VALID [2020-07-28 17:57:03,812 INFO L280 TraceCheckUtils]: 15: Hoare triple {648#false} assume !(1 == main_#t~mem9);havoc main_#t~mem9; {648#false} is VALID [2020-07-28 17:57:03,813 INFO L280 TraceCheckUtils]: 16: Hoare triple {648#false} call main_#t~mem11 := read~int(main_~p~0.base, main_~p~0.offset, 4); {648#false} is VALID [2020-07-28 17:57:03,813 INFO L280 TraceCheckUtils]: 17: Hoare triple {648#false} assume 3 != main_#t~mem11;havoc main_#t~mem11; {648#false} is VALID [2020-07-28 17:57:03,813 INFO L280 TraceCheckUtils]: 18: Hoare triple {648#false} assume !false; {648#false} is VALID [2020-07-28 17:57:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:57:03,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549179941] [2020-07-28 17:57:03,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:57:03,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:57:03,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589919234] [2020-07-28 17:57:03,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-28 17:57:03,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:57:03,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:57:03,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:57:03,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:57:03,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:57:03,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:57:03,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:57:03,843 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2020-07-28 17:57:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:03,900 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2020-07-28 17:57:03,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:57:03,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-07-28 17:57:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:57:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:57:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-28 17:57:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:57:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-28 17:57:03,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2020-07-28 17:57:03,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:57:03,984 INFO L225 Difference]: With dead ends: 50 [2020-07-28 17:57:03,984 INFO L226 Difference]: Without dead ends: 34 [2020-07-28 17:57:03,985 INFO L675 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 [2020-07-28 17:57:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-28 17:57:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2020-07-28 17:57:03,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:57:03,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 30 states. [2020-07-28 17:57:03,996 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 30 states. [2020-07-28 17:57:03,996 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 30 states. [2020-07-28 17:57:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:03,998 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-28 17:57:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-28 17:57:03,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:57:03,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:57:03,999 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 34 states. [2020-07-28 17:57:04,000 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 34 states. [2020-07-28 17:57:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:57:04,004 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-28 17:57:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-28 17:57:04,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:57:04,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:57:04,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:57:04,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:57:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-28 17:57:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2020-07-28 17:57:04,009 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2020-07-28 17:57:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:57:04,010 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2020-07-28 17:57:04,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:57:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-28 17:57:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 17:57:04,011 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:57:04,012 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:57:04,012 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-28 17:57:04,013 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:57:04,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:57:04,014 INFO L82 PathProgramCache]: Analyzing trace with hash -616427248, now seen corresponding path program 1 times [2020-07-28 17:57:04,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:57:04,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172161711] [2020-07-28 17:57:04,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:57:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:57:04,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:57:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:57:04,104 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:57:04,152 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 17:57:04,152 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:57:04,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-28 17:57:04,215 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:57:04,215 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:57:04,215 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2020-07-28 17:57:04,215 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2020-07-28 17:57:04,215 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2020-07-28 17:57:04,215 WARN L170 areAnnotationChecker]: L524-1 has no Hoare annotation [2020-07-28 17:57:04,215 WARN L170 areAnnotationChecker]: L526-3 has no Hoare annotation [2020-07-28 17:57:04,215 WARN L170 areAnnotationChecker]: L526-3 has no Hoare annotation [2020-07-28 17:57:04,216 WARN L170 areAnnotationChecker]: L526-4 has no Hoare annotation [2020-07-28 17:57:04,216 WARN L170 areAnnotationChecker]: L526-1 has no Hoare annotation [2020-07-28 17:57:04,216 WARN L170 areAnnotationChecker]: L526-1 has no Hoare annotation [2020-07-28 17:57:04,216 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2020-07-28 17:57:04,216 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2020-07-28 17:57:04,216 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2020-07-28 17:57:04,216 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2020-07-28 17:57:04,216 WARN L170 areAnnotationChecker]: L540-3 has no Hoare annotation [2020-07-28 17:57:04,216 WARN L170 areAnnotationChecker]: L540-3 has no Hoare annotation [2020-07-28 17:57:04,217 WARN L170 areAnnotationChecker]: L543-3 has no Hoare annotation [2020-07-28 17:57:04,217 WARN L170 areAnnotationChecker]: L543-3 has no Hoare annotation [2020-07-28 17:57:04,217 WARN L170 areAnnotationChecker]: L527-2 has no Hoare annotation [2020-07-28 17:57:04,217 WARN L170 areAnnotationChecker]: L543-4 has no Hoare annotation [2020-07-28 17:57:04,217 WARN L170 areAnnotationChecker]: L540-1 has no Hoare annotation [2020-07-28 17:57:04,217 WARN L170 areAnnotationChecker]: L540-1 has no Hoare annotation [2020-07-28 17:57:04,217 WARN L170 areAnnotationChecker]: L543-1 has no Hoare annotation [2020-07-28 17:57:04,217 WARN L170 areAnnotationChecker]: L543-1 has no Hoare annotation [2020-07-28 17:57:04,217 WARN L170 areAnnotationChecker]: L533 has no Hoare annotation [2020-07-28 17:57:04,218 WARN L170 areAnnotationChecker]: L533 has no Hoare annotation [2020-07-28 17:57:04,218 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2020-07-28 17:57:04,218 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2020-07-28 17:57:04,218 WARN L170 areAnnotationChecker]: L514-1 has no Hoare annotation [2020-07-28 17:57:04,218 WARN L170 areAnnotationChecker]: L533-1 has no Hoare annotation [2020-07-28 17:57:04,218 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2020-07-28 17:57:04,218 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2020-07-28 17:57:04,218 WARN L170 areAnnotationChecker]: L520 has no Hoare annotation [2020-07-28 17:57:04,218 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:57:04,219 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:57:04,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:57:04 BoogieIcfgContainer [2020-07-28 17:57:04,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:57:04,223 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:57:04,223 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:57:04,224 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:57:04,224 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:57:01" (3/4) ... [2020-07-28 17:57:04,234 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 17:57:04,339 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:57:04,339 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:57:04,347 INFO L168 Benchmark]: Toolchain (without parser) took 3930.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.4 MB). Free memory was 956.2 MB in the beginning and 1.2 GB in the end (delta: -243.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:57:04,347 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:57:04,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:57:04,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:57:04,349 INFO L168 Benchmark]: Boogie Preprocessor took 42.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:57:04,349 INFO L168 Benchmark]: RCFGBuilder took 490.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:57:04,351 INFO L168 Benchmark]: TraceAbstraction took 2512.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.2 MB). Peak memory consumption was 276.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:57:04,357 INFO L168 Benchmark]: Witness Printer took 115.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:57:04,361 INFO L336 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 708.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -170.6 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 490.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2512.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.2 MB). Peak memory consumption was 276.0 MB. Max. memory is 11.5 GB. * Witness Printer took 115.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 546]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L521] int flag = __VERIFIER_nondet_int(); [L522] List p, a, t; [L523] a = (List) malloc(sizeof(struct node)) [L524] COND FALSE !(a == 0) [L525] p = a [L526] COND TRUE __VERIFIER_nondet_int() [L527] COND TRUE \read(flag) [L528] p->h = 1 [L532] t = (List) malloc(sizeof(struct node)) [L533] COND FALSE !(t == 0) [L534] p->n = t [L535] EXPR p->n [L535] p = p->n [L526] COND FALSE !(__VERIFIER_nondet_int()) [L537] p->h = 3 [L538] p = a [L539] COND TRUE \read(flag) [L540] EXPR p->h [L540] COND FALSE !(p->h == 2) [L545] EXPR p->h [L545] COND TRUE p->h != 3 [L546] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 107 SDtfs, 71 SDslu, 136 SDs, 0 SdLazy, 135 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 2762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...