./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/pc_sfifo_3_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/systemc/pc_sfifo_3_true-unreach-call_false-termination.cil.c -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 0cd94be4ea5743b633f1f4a5c7ddfdb38e323c6d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:30:42,091 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:30:42,093 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:30:42,105 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:30:42,105 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:30:42,106 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:30:42,107 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:30:42,110 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:30:42,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:30:42,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:30:42,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:30:42,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:30:42,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:30:42,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:30:42,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:30:42,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:30:42,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:30:42,122 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:30:42,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:30:42,127 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:30:42,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:30:42,130 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:30:42,133 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:30:42,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:30:42,134 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:30:42,135 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:30:42,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:30:42,137 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:30:42,138 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:30:42,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:30:42,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:30:42,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:30:42,141 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:30:42,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:30:42,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:30:42,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:30:42,144 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:30:42,162 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:30:42,167 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:30:42,168 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:30:42,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:30:42,169 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:30:42,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:30:42,169 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:30:42,169 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:30:42,171 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:30:42,172 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:30:42,172 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:30:42,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:30:42,172 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:30:42,173 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:30:42,173 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:30:42,173 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:30:42,173 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:30:42,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:30:42,178 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:30:42,179 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:30:42,179 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:30:42,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:30:42,179 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:30:42,179 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:30:42,180 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:30:42,181 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:30:42,181 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:30:42,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:30:42,181 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 0cd94be4ea5743b633f1f4a5c7ddfdb38e323c6d [2019-01-12 15:30:42,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:30:42,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:30:42,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:30:42,265 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:30:42,266 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:30:42,268 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/pc_sfifo_3_true-unreach-call_false-termination.cil.c [2019-01-12 15:30:42,323 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9157a1fee/a8678d42555c4cc4a7926e5f947c7aba/FLAGe3359b008 [2019-01-12 15:30:42,743 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:30:42,744 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/pc_sfifo_3_true-unreach-call_false-termination.cil.c [2019-01-12 15:30:42,752 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9157a1fee/a8678d42555c4cc4a7926e5f947c7aba/FLAGe3359b008 [2019-01-12 15:30:43,105 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9157a1fee/a8678d42555c4cc4a7926e5f947c7aba [2019-01-12 15:30:43,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:30:43,111 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:30:43,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:30:43,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:30:43,116 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:30:43,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:30:43" (1/1) ... [2019-01-12 15:30:43,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa91f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:43, skipping insertion in model container [2019-01-12 15:30:43,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:30:43" (1/1) ... [2019-01-12 15:30:43,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:30:43,163 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:30:43,446 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:30:43,459 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:30:43,517 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:30:43,538 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:30:43,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:43 WrapperNode [2019-01-12 15:30:43,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:30:43,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:30:43,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:30:43,540 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:30:43,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:43" (1/1) ... [2019-01-12 15:30:43,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:43" (1/1) ... [2019-01-12 15:30:43,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:30:43,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:30:43,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:30:43,676 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:30:43,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:43" (1/1) ... [2019-01-12 15:30:43,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:43" (1/1) ... [2019-01-12 15:30:43,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:43" (1/1) ... [2019-01-12 15:30:43,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:43" (1/1) ... [2019-01-12 15:30:43,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:43" (1/1) ... [2019-01-12 15:30:43,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:43" (1/1) ... [2019-01-12 15:30:43,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:43" (1/1) ... [2019-01-12 15:30:43,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:30:43,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:30:43,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:30:43,750 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:30:43,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:43" (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 [2019-01-12 15:30:43,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:30:43,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:30:44,765 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0; [2019-01-12 15:30:44,766 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !(1 == ~q_free~0); [2019-01-12 15:30:44,768 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:30:44,768 INFO L286 CfgBuilder]: Removed 70 assue(true) statements. [2019-01-12 15:30:44,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:30:44 BoogieIcfgContainer [2019-01-12 15:30:44,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:30:44,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:30:44,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:30:44,774 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:30:44,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:30:43" (1/3) ... [2019-01-12 15:30:44,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44491d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:30:44, skipping insertion in model container [2019-01-12 15:30:44,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:30:43" (2/3) ... [2019-01-12 15:30:44,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44491d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:30:44, skipping insertion in model container [2019-01-12 15:30:44,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:30:44" (3/3) ... [2019-01-12 15:30:44,778 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3_true-unreach-call_false-termination.cil.c [2019-01-12 15:30:44,788 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:30:44,796 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 15:30:44,812 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 15:30:44,843 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:30:44,844 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:30:44,844 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:30:44,844 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:30:44,845 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:30:44,845 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:30:44,845 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:30:44,845 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:30:44,845 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:30:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-01-12 15:30:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:30:44,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:44,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:30:44,873 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:44,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:44,879 INFO L82 PathProgramCache]: Analyzing trace with hash -660120607, now seen corresponding path program 1 times [2019-01-12 15:30:44,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:44,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:44,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:44,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:44,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:30:45,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:45,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:45,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:45,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:45,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:45,086 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2019-01-12 15:30:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:45,286 INFO L93 Difference]: Finished difference Result 377 states and 602 transitions. [2019-01-12 15:30:45,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:45,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:30:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:45,303 INFO L225 Difference]: With dead ends: 377 [2019-01-12 15:30:45,304 INFO L226 Difference]: Without dead ends: 248 [2019-01-12 15:30:45,308 INFO L631 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 [2019-01-12 15:30:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-12 15:30:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2019-01-12 15:30:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-01-12 15:30:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 372 transitions. [2019-01-12 15:30:45,374 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 372 transitions. Word has length 39 [2019-01-12 15:30:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:45,375 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 372 transitions. [2019-01-12 15:30:45,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 372 transitions. [2019-01-12 15:30:45,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:30:45,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:45,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:30:45,379 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:45,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:45,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1873516389, now seen corresponding path program 1 times [2019-01-12 15:30:45,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:45,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:45,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:45,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:45,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:30:45,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:45,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:45,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:45,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:45,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:45,475 INFO L87 Difference]: Start difference. First operand 244 states and 372 transitions. Second operand 3 states. [2019-01-12 15:30:45,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:45,713 INFO L93 Difference]: Finished difference Result 640 states and 969 transitions. [2019-01-12 15:30:45,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:45,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 15:30:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:45,720 INFO L225 Difference]: With dead ends: 640 [2019-01-12 15:30:45,723 INFO L226 Difference]: Without dead ends: 416 [2019-01-12 15:30:45,726 INFO L631 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 [2019-01-12 15:30:45,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-01-12 15:30:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2019-01-12 15:30:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-01-12 15:30:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 607 transitions. [2019-01-12 15:30:45,780 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 607 transitions. Word has length 39 [2019-01-12 15:30:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:45,780 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 607 transitions. [2019-01-12 15:30:45,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 607 transitions. [2019-01-12 15:30:45,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 15:30:45,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:45,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:30:45,784 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:45,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:45,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1793155390, now seen corresponding path program 1 times [2019-01-12 15:30:45,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:45,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:45,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:45,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:45,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:30:45,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:45,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:45,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:45,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:45,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:45,872 INFO L87 Difference]: Start difference. First operand 408 states and 607 transitions. Second operand 3 states. [2019-01-12 15:30:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:46,017 INFO L93 Difference]: Finished difference Result 1098 states and 1630 transitions. [2019-01-12 15:30:46,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:46,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-01-12 15:30:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:46,025 INFO L225 Difference]: With dead ends: 1098 [2019-01-12 15:30:46,025 INFO L226 Difference]: Without dead ends: 724 [2019-01-12 15:30:46,027 INFO L631 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 [2019-01-12 15:30:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-01-12 15:30:46,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 716. [2019-01-12 15:30:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-01-12 15:30:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1039 transitions. [2019-01-12 15:30:46,065 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1039 transitions. Word has length 40 [2019-01-12 15:30:46,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:46,065 INFO L480 AbstractCegarLoop]: Abstraction has 716 states and 1039 transitions. [2019-01-12 15:30:46,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1039 transitions. [2019-01-12 15:30:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 15:30:46,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:46,070 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:30:46,071 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:46,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1344512514, now seen corresponding path program 1 times [2019-01-12 15:30:46,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:46,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:46,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:46,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:46,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-12 15:30:46,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:46,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:46,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:46,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:46,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:46,179 INFO L87 Difference]: Start difference. First operand 716 states and 1039 transitions. Second operand 3 states. [2019-01-12 15:30:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:46,529 INFO L93 Difference]: Finished difference Result 2127 states and 3084 transitions. [2019-01-12 15:30:46,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:46,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-01-12 15:30:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:46,539 INFO L225 Difference]: With dead ends: 2127 [2019-01-12 15:30:46,540 INFO L226 Difference]: Without dead ends: 1427 [2019-01-12 15:30:46,542 INFO L631 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 [2019-01-12 15:30:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-01-12 15:30:46,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1423. [2019-01-12 15:30:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-01-12 15:30:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2041 transitions. [2019-01-12 15:30:46,622 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2041 transitions. Word has length 53 [2019-01-12 15:30:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:46,622 INFO L480 AbstractCegarLoop]: Abstraction has 1423 states and 2041 transitions. [2019-01-12 15:30:46,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2041 transitions. [2019-01-12 15:30:46,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 15:30:46,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:46,630 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:30:46,630 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:46,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:46,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1321880260, now seen corresponding path program 1 times [2019-01-12 15:30:46,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:46,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:46,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:46,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:46,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 15:30:46,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:46,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:46,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:46,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:46,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:46,761 INFO L87 Difference]: Start difference. First operand 1423 states and 2041 transitions. Second operand 3 states. [2019-01-12 15:30:47,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:47,229 INFO L93 Difference]: Finished difference Result 4019 states and 5733 transitions. [2019-01-12 15:30:47,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:47,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-01-12 15:30:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:47,246 INFO L225 Difference]: With dead ends: 4019 [2019-01-12 15:30:47,247 INFO L226 Difference]: Without dead ends: 2687 [2019-01-12 15:30:47,250 INFO L631 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 [2019-01-12 15:30:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2019-01-12 15:30:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2683. [2019-01-12 15:30:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2019-01-12 15:30:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 3745 transitions. [2019-01-12 15:30:47,386 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 3745 transitions. Word has length 53 [2019-01-12 15:30:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:47,386 INFO L480 AbstractCegarLoop]: Abstraction has 2683 states and 3745 transitions. [2019-01-12 15:30:47,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 3745 transitions. [2019-01-12 15:30:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 15:30:47,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:47,394 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:30:47,395 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:47,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:47,395 INFO L82 PathProgramCache]: Analyzing trace with hash 669631146, now seen corresponding path program 1 times [2019-01-12 15:30:47,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:47,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:47,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:47,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:47,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:30:47,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:47,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:47,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:47,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:47,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:47,498 INFO L87 Difference]: Start difference. First operand 2683 states and 3745 transitions. Second operand 3 states. [2019-01-12 15:30:48,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:48,040 INFO L93 Difference]: Finished difference Result 7663 states and 10675 transitions. [2019-01-12 15:30:48,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:48,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-01-12 15:30:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:48,117 INFO L225 Difference]: With dead ends: 7663 [2019-01-12 15:30:48,117 INFO L226 Difference]: Without dead ends: 5147 [2019-01-12 15:30:48,123 INFO L631 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 [2019-01-12 15:30:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5147 states. [2019-01-12 15:30:48,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5147 to 5147. [2019-01-12 15:30:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5147 states. [2019-01-12 15:30:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 7065 transitions. [2019-01-12 15:30:48,368 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 7065 transitions. Word has length 55 [2019-01-12 15:30:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:48,369 INFO L480 AbstractCegarLoop]: Abstraction has 5147 states and 7065 transitions. [2019-01-12 15:30:48,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 7065 transitions. [2019-01-12 15:30:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 15:30:48,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:48,381 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:30:48,381 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:48,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:48,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1088862051, now seen corresponding path program 1 times [2019-01-12 15:30:48,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:48,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:48,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:48,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:48,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 15:30:48,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:48,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:48,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:48,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:48,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:48,482 INFO L87 Difference]: Start difference. First operand 5147 states and 7065 transitions. Second operand 3 states. [2019-01-12 15:30:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:49,048 INFO L93 Difference]: Finished difference Result 14819 states and 20413 transitions. [2019-01-12 15:30:49,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:49,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-01-12 15:30:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:49,098 INFO L225 Difference]: With dead ends: 14819 [2019-01-12 15:30:49,098 INFO L226 Difference]: Without dead ends: 9983 [2019-01-12 15:30:49,108 INFO L631 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 [2019-01-12 15:30:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2019-01-12 15:30:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 9979. [2019-01-12 15:30:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9979 states. [2019-01-12 15:30:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9979 states to 9979 states and 13609 transitions. [2019-01-12 15:30:49,646 INFO L78 Accepts]: Start accepts. Automaton has 9979 states and 13609 transitions. Word has length 96 [2019-01-12 15:30:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:49,647 INFO L480 AbstractCegarLoop]: Abstraction has 9979 states and 13609 transitions. [2019-01-12 15:30:49,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 9979 states and 13609 transitions. [2019-01-12 15:30:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-12 15:30:49,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:30:49,675 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:30:49,675 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:30:49,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:30:49,676 INFO L82 PathProgramCache]: Analyzing trace with hash 786050006, now seen corresponding path program 1 times [2019-01-12 15:30:49,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:30:49,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:30:49,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:49,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:30:49,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:30:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:30:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:30:49,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:30:49,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:30:49,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:30:49,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:30:49,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:30:49,780 INFO L87 Difference]: Start difference. First operand 9979 states and 13609 transitions. Second operand 3 states. [2019-01-12 15:30:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:30:50,486 INFO L93 Difference]: Finished difference Result 14843 states and 20361 transitions. [2019-01-12 15:30:50,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:30:50,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-12 15:30:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:30:50,488 INFO L225 Difference]: With dead ends: 14843 [2019-01-12 15:30:50,488 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:30:50,507 INFO L631 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 [2019-01-12 15:30:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:30:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:30:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:30:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:30:50,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2019-01-12 15:30:50,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:30:50,508 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:30:50,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:30:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:30:50,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:30:50,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:30:52,397 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 15:30:52,654 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 15:30:52,880 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 15:30:53,051 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 15:30:54,241 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 15:30:54,851 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 15:30:54,852 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-01-12 15:30:54,852 INFO L448 ceAbstractionStarter]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2019-01-12 15:30:54,852 INFO L444 ceAbstractionStarter]: At program point L268-1(lines 301 305) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-01-12 15:30:54,852 INFO L448 ceAbstractionStarter]: For program point L301-2(lines 301 305) no Hoare annotation was computed. [2019-01-12 15:30:54,852 INFO L448 ceAbstractionStarter]: For program point L301-4(lines 300 313) no Hoare annotation was computed. [2019-01-12 15:30:54,852 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 509) no Hoare annotation was computed. [2019-01-12 15:30:54,853 INFO L444 ceAbstractionStarter]: At program point L500-1(lines 500 509) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,855 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 15:30:54,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-01-12 15:30:54,855 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 151) no Hoare annotation was computed. [2019-01-12 15:30:54,855 INFO L444 ceAbstractionStarter]: At program point L106(lines 84 108) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-01-12 15:30:54,855 INFO L444 ceAbstractionStarter]: At program point L106-1(lines 84 108) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,855 INFO L444 ceAbstractionStarter]: At program point L106-2(lines 84 108) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,856 INFO L444 ceAbstractionStarter]: At program point L107(lines 81 109) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-01-12 15:30:54,857 INFO L444 ceAbstractionStarter]: At program point L107-1(lines 81 109) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,858 INFO L444 ceAbstractionStarter]: At program point L107-2(lines 81 109) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,858 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 409) no Hoare annotation was computed. [2019-01-12 15:30:54,858 INFO L448 ceAbstractionStarter]: For program point L405-1(lines 400 440) no Hoare annotation was computed. [2019-01-12 15:30:54,858 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 346) no Hoare annotation was computed. [2019-01-12 15:30:54,858 INFO L444 ceAbstractionStarter]: At program point L306-1(lines 297 314) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-01-12 15:30:54,858 INFO L444 ceAbstractionStarter]: At program point L339-2(lines 335 350) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,858 INFO L444 ceAbstractionStarter]: At program point L306-3(lines 297 314) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,858 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-01-12 15:30:54,859 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-01-12 15:30:54,859 INFO L448 ceAbstractionStarter]: For program point L208-1(lines 208 218) no Hoare annotation was computed. [2019-01-12 15:30:54,861 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 150) no Hoare annotation was computed. [2019-01-12 15:30:54,861 INFO L451 ceAbstractionStarter]: At program point L10-1(lines 188 242) the Hoare annotation is: true [2019-01-12 15:30:54,861 INFO L444 ceAbstractionStarter]: At program point L143(lines 138 182) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,861 INFO L444 ceAbstractionStarter]: At program point L77(lines 55 79) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-01-12 15:30:54,861 INFO L444 ceAbstractionStarter]: At program point L77-1(lines 55 79) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,861 INFO L444 ceAbstractionStarter]: At program point L77-2(lines 55 79) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,862 INFO L444 ceAbstractionStarter]: At program point L441(lines 394 446) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,863 INFO L444 ceAbstractionStarter]: At program point L78(lines 52 80) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-01-12 15:30:54,864 INFO L444 ceAbstractionStarter]: At program point L78-1(lines 52 80) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,864 INFO L444 ceAbstractionStarter]: At program point L78-2(lines 52 80) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,864 INFO L444 ceAbstractionStarter]: At program point L541(lines 525 543) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= 2 ~q_write_ev~0) (<= 2 ~q_read_ev~0) (= ~p_dw_st~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-01-12 15:30:54,864 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 149) no Hoare annotation was computed. [2019-01-12 15:30:54,864 INFO L444 ceAbstractionStarter]: At program point L410(lines 400 440) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,864 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-01-12 15:30:54,864 INFO L448 ceAbstractionStarter]: For program point L377-2(lines 377 381) no Hoare annotation was computed. [2019-01-12 15:30:54,865 INFO L448 ceAbstractionStarter]: For program point L377-3(lines 377 381) no Hoare annotation was computed. [2019-01-12 15:30:54,867 INFO L448 ceAbstractionStarter]: For program point L377-5(lines 377 381) no Hoare annotation was computed. [2019-01-12 15:30:54,867 INFO L448 ceAbstractionStarter]: For program point L377-6(lines 377 381) no Hoare annotation was computed. [2019-01-12 15:30:54,867 INFO L448 ceAbstractionStarter]: For program point L377-8(lines 377 381) no Hoare annotation was computed. [2019-01-12 15:30:54,867 INFO L448 ceAbstractionStarter]: For program point L281(lines 281 291) no Hoare annotation was computed. [2019-01-12 15:30:54,867 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 254) no Hoare annotation was computed. [2019-01-12 15:30:54,867 INFO L448 ceAbstractionStarter]: For program point L281-1(lines 281 291) no Hoare annotation was computed. [2019-01-12 15:30:54,867 INFO L444 ceAbstractionStarter]: At program point L248-1(lines 263 267) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-01-12 15:30:54,868 INFO L448 ceAbstractionStarter]: For program point L281-2(lines 281 291) no Hoare annotation was computed. [2019-01-12 15:30:54,869 INFO L448 ceAbstractionStarter]: For program point L248-2(lines 248 254) no Hoare annotation was computed. [2019-01-12 15:30:54,870 INFO L444 ceAbstractionStarter]: At program point L248-3(lines 244 258) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,870 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 517) no Hoare annotation was computed. [2019-01-12 15:30:54,870 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 421) no Hoare annotation was computed. [2019-01-12 15:30:54,870 INFO L444 ceAbstractionStarter]: At program point L481-1(lines 315 518) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,870 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 94) no Hoare annotation was computed. [2019-01-12 15:30:54,870 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 84 108) no Hoare annotation was computed. [2019-01-12 15:30:54,870 INFO L448 ceAbstractionStarter]: For program point L85-3(lines 85 94) no Hoare annotation was computed. [2019-01-12 15:30:54,870 INFO L448 ceAbstractionStarter]: For program point L85-5(lines 84 108) no Hoare annotation was computed. [2019-01-12 15:30:54,870 INFO L448 ceAbstractionStarter]: For program point L85-6(lines 85 94) no Hoare annotation was computed. [2019-01-12 15:30:54,870 INFO L448 ceAbstractionStarter]: For program point L85-8(lines 84 108) no Hoare annotation was computed. [2019-01-12 15:30:54,871 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 15:30:54,873 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:30:54,873 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2019-01-12 15:30:54,873 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 86 91) no Hoare annotation was computed. [2019-01-12 15:30:54,873 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 86 91) no Hoare annotation was computed. [2019-01-12 15:30:54,873 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 290) no Hoare annotation was computed. [2019-01-12 15:30:54,873 INFO L448 ceAbstractionStarter]: For program point L285-1(lines 285 290) no Hoare annotation was computed. [2019-01-12 15:30:54,873 INFO L448 ceAbstractionStarter]: For program point L285-2(lines 285 290) no Hoare annotation was computed. [2019-01-12 15:30:54,873 INFO L448 ceAbstractionStarter]: For program point L385(lines 385 389) no Hoare annotation was computed. [2019-01-12 15:30:54,874 INFO L444 ceAbstractionStarter]: At program point L385-2(lines 319 323) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= 2 ~slow_clk_edge~0)) [2019-01-12 15:30:54,874 INFO L448 ceAbstractionStarter]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2019-01-12 15:30:54,874 INFO L448 ceAbstractionStarter]: For program point L385-3(lines 385 389) no Hoare annotation was computed. [2019-01-12 15:30:54,874 INFO L444 ceAbstractionStarter]: At program point L385-5(lines 319 323) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,874 INFO L448 ceAbstractionStarter]: For program point L319-3(lines 318 331) no Hoare annotation was computed. [2019-01-12 15:30:54,874 INFO L448 ceAbstractionStarter]: For program point L385-6(lines 385 389) no Hoare annotation was computed. [2019-01-12 15:30:54,874 INFO L444 ceAbstractionStarter]: At program point L154-1(lines 138 182) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,874 INFO L444 ceAbstractionStarter]: At program point L385-8(lines 355 359) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,875 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-01-12 15:30:54,875 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 65) no Hoare annotation was computed. [2019-01-12 15:30:54,875 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 55 79) no Hoare annotation was computed. [2019-01-12 15:30:54,875 INFO L448 ceAbstractionStarter]: For program point L56-3(lines 56 65) no Hoare annotation was computed. [2019-01-12 15:30:54,875 INFO L448 ceAbstractionStarter]: For program point L56-5(lines 55 79) no Hoare annotation was computed. [2019-01-12 15:30:54,875 INFO L448 ceAbstractionStarter]: For program point L56-6(lines 56 65) no Hoare annotation was computed. [2019-01-12 15:30:54,875 INFO L448 ceAbstractionStarter]: For program point L56-8(lines 55 79) no Hoare annotation was computed. [2019-01-12 15:30:54,875 INFO L451 ceAbstractionStarter]: At program point L519(lines 466 524) the Hoare annotation is: true [2019-01-12 15:30:54,875 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 197) no Hoare annotation was computed. [2019-01-12 15:30:54,875 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 62) no Hoare annotation was computed. [2019-01-12 15:30:54,876 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2019-01-12 15:30:54,876 INFO L448 ceAbstractionStarter]: For program point L57-2(lines 57 62) no Hoare annotation was computed. [2019-01-12 15:30:54,876 INFO L451 ceAbstractionStarter]: At program point L553(lines 544 555) the Hoare annotation is: true [2019-01-12 15:30:54,876 INFO L448 ceAbstractionStarter]: For program point L355-1(lines 354 367) no Hoare annotation was computed. [2019-01-12 15:30:54,876 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:30:54,876 INFO L448 ceAbstractionStarter]: For program point L455(lines 455 460) no Hoare annotation was computed. [2019-01-12 15:30:54,876 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 236) no Hoare annotation was computed. [2019-01-12 15:30:54,876 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2019-01-12 15:30:54,876 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 25 40) no Hoare annotation was computed. [2019-01-12 15:30:54,876 INFO L448 ceAbstractionStarter]: For program point L26-3(lines 26 30) no Hoare annotation was computed. [2019-01-12 15:30:54,877 INFO L448 ceAbstractionStarter]: For program point L26-5(lines 25 40) no Hoare annotation was computed. [2019-01-12 15:30:54,882 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 231) no Hoare annotation was computed. [2019-01-12 15:30:54,882 INFO L444 ceAbstractionStarter]: At program point L324-3(lines 315 332) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,882 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 196) no Hoare annotation was computed. [2019-01-12 15:30:54,882 INFO L444 ceAbstractionStarter]: At program point L193(lines 188 242) the Hoare annotation is: false [2019-01-12 15:30:54,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:30:54,882 INFO L444 ceAbstractionStarter]: At program point L425(lines 400 440) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,883 INFO L444 ceAbstractionStarter]: At program point L293(lines 280 295) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,883 INFO L444 ceAbstractionStarter]: At program point L293-1(lines 280 295) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,883 INFO L444 ceAbstractionStarter]: At program point L293-2(lines 280 295) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,883 INFO L444 ceAbstractionStarter]: At program point L161(lines 138 182) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,883 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 95 104) no Hoare annotation was computed. [2019-01-12 15:30:54,883 INFO L448 ceAbstractionStarter]: For program point L95-3(lines 95 104) no Hoare annotation was computed. [2019-01-12 15:30:54,883 INFO L448 ceAbstractionStarter]: For program point L95-5(lines 95 104) no Hoare annotation was computed. [2019-01-12 15:30:54,883 INFO L444 ceAbstractionStarter]: At program point L294(lines 277 296) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,883 INFO L444 ceAbstractionStarter]: At program point L294-1(lines 277 296) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,884 INFO L444 ceAbstractionStarter]: At program point L294-2(lines 277 296) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,884 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 101) no Hoare annotation was computed. [2019-01-12 15:30:54,884 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 96 101) no Hoare annotation was computed. [2019-01-12 15:30:54,884 INFO L448 ceAbstractionStarter]: For program point L96-2(lines 96 101) no Hoare annotation was computed. [2019-01-12 15:30:54,884 INFO L448 ceAbstractionStarter]: For program point L31-1(lines 31 35) no Hoare annotation was computed. [2019-01-12 15:30:54,884 INFO L448 ceAbstractionStarter]: For program point L31-3(lines 31 35) no Hoare annotation was computed. [2019-01-12 15:30:54,884 INFO L448 ceAbstractionStarter]: For program point L263-1(lines 262 275) no Hoare annotation was computed. [2019-01-12 15:30:54,884 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 15:30:54,884 INFO L444 ceAbstractionStarter]: At program point L462(lines 451 464) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,884 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 436) no Hoare annotation was computed. [2019-01-12 15:30:54,884 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 66 75) no Hoare annotation was computed. [2019-01-12 15:30:54,885 INFO L448 ceAbstractionStarter]: For program point L66-3(lines 66 75) no Hoare annotation was computed. [2019-01-12 15:30:54,885 INFO L448 ceAbstractionStarter]: For program point L66-5(lines 66 75) no Hoare annotation was computed. [2019-01-12 15:30:54,887 INFO L444 ceAbstractionStarter]: At program point L463(lines 447 465) the Hoare annotation is: (or (= ~c_dr_pc~0 1) (<= ~c_dr_pc~0 0)) [2019-01-12 15:30:54,887 INFO L448 ceAbstractionStarter]: For program point L67(lines 67 72) no Hoare annotation was computed. [2019-01-12 15:30:54,887 INFO L448 ceAbstractionStarter]: For program point L67-1(lines 67 72) no Hoare annotation was computed. [2019-01-12 15:30:54,887 INFO L448 ceAbstractionStarter]: For program point L67-2(lines 67 72) no Hoare annotation was computed. [2019-01-12 15:30:54,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:30:54 BoogieIcfgContainer [2019-01-12 15:30:54,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:30:54,918 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:30:54,918 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:30:54,918 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:30:54,918 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:30:44" (3/4) ... [2019-01-12 15:30:54,924 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:30:54,942 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 15:30:54,943 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:30:55,071 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:30:55,075 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:30:55,076 INFO L168 Benchmark]: Toolchain (without parser) took 11966.43 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.6 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -312.2 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2019-01-12 15:30:55,077 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:30:55,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.30 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:30:55,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -210.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:30:55,078 INFO L168 Benchmark]: Boogie Preprocessor took 73.78 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-01-12 15:30:55,079 INFO L168 Benchmark]: RCFGBuilder took 1019.67 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: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2019-01-12 15:30:55,080 INFO L168 Benchmark]: TraceAbstraction took 10146.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -174.1 MB). Peak memory consumption was 454.6 MB. Max. memory is 11.5 GB. [2019-01-12 15:30:55,080 INFO L168 Benchmark]: Witness Printer took 157.44 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-01-12 15:30:55,084 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 427.30 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 136.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -210.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.78 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: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1019.67 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: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10146.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -174.1 MB). Peak memory consumption was 454.6 MB. Max. memory is 11.5 GB. * Witness Printer took 157.44 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 525]: Loop Invariant Derived loop invariant: ((((p_dw_pc <= 0 && 2 <= q_write_ev) && 2 <= q_read_ev) && p_dw_st == 0) && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 466]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((p_dw_pc <= 0 && p_dw_st == 0) && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 315]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 544]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 500]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (p_dw_pc <= 0 && c_dr_pc <= 0) && 2 <= slow_clk_edge - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - InvariantResult [Line: 447]: Loop Invariant Derived loop invariant: c_dr_pc == 1 || c_dr_pc <= 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 2 error locations. SAFE Result, 10.0s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1693 SDtfs, 1151 SDslu, 1210 SDs, 0 SdLazy, 147 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9979occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 32 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 43 PreInvPairs, 3777 NumberOfFragments, 316 HoareAnnotationTreeSize, 43 FomulaSimplifications, 47557 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 43 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 464 ConstructedInterpolants, 0 QuantifiedInterpolants, 53124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 81/81 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...