./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label26_true-unreach-call_false-termination.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/eca-rers2012/Problem01_label26_true-unreach-call_false-termination.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 e002fb6463a65ebb6b75b40986db95c31112380a ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:52:30,638 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:52:30,640 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:52:30,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:52:30,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:52:30,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:52:30,661 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:52:30,663 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:52:30,665 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:52:30,666 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:52:30,667 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:52:30,667 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:52:30,668 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:52:30,669 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:52:30,671 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:52:30,672 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:52:30,673 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:52:30,674 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:52:30,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:52:30,679 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:52:30,680 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:52:30,681 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:52:30,684 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:52:30,684 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:52:30,684 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:52:30,685 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:52:30,686 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:52:30,687 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:52:30,688 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:52:30,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:52:30,690 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:52:30,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:52:30,691 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:52:30,691 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:52:30,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:52:30,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:52:30,693 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:52:30,710 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:52:30,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:52:30,713 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:52:30,713 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:52:30,713 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:52:30,714 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:52:30,714 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:52:30,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:52:30,714 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:52:30,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:52:30,714 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:52:30,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:52:30,718 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:52:30,718 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:52:30,718 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:52:30,718 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:52:30,718 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:52:30,720 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:52:30,720 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:52:30,720 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:52:30,720 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:52:30,720 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:52:30,721 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:52:30,721 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:52:30,721 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:52:30,721 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:52:30,721 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:52:30,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:52:30,722 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 -> e002fb6463a65ebb6b75b40986db95c31112380a [2019-01-12 00:52:30,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:52:30,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:52:30,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:52:30,804 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:52:30,804 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:52:30,805 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label26_true-unreach-call_false-termination.c [2019-01-12 00:52:30,862 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9e7c1b08/8dff50a72b8544b6bbdd82e519c51fa2/FLAGb7102206f [2019-01-12 00:52:31,454 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:52:31,455 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label26_true-unreach-call_false-termination.c [2019-01-12 00:52:31,475 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9e7c1b08/8dff50a72b8544b6bbdd82e519c51fa2/FLAGb7102206f [2019-01-12 00:52:31,707 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9e7c1b08/8dff50a72b8544b6bbdd82e519c51fa2 [2019-01-12 00:52:31,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:52:31,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:52:31,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:52:31,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:52:31,720 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:52:31,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:52:31" (1/1) ... [2019-01-12 00:52:31,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fc82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:31, skipping insertion in model container [2019-01-12 00:52:31,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:52:31" (1/1) ... [2019-01-12 00:52:31,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:52:31,789 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:52:32,299 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:52:32,305 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:52:32,421 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:52:32,442 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:52:32,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:32 WrapperNode [2019-01-12 00:52:32,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:52:32,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:52:32,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:52:32,445 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:52:32,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:32" (1/1) ... [2019-01-12 00:52:32,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:32" (1/1) ... [2019-01-12 00:52:32,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:52:32,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:52:32,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:52:32,630 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:52:32,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:32" (1/1) ... [2019-01-12 00:52:32,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:32" (1/1) ... [2019-01-12 00:52:32,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:32" (1/1) ... [2019-01-12 00:52:32,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:32" (1/1) ... [2019-01-12 00:52:32,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:32" (1/1) ... [2019-01-12 00:52:32,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:32" (1/1) ... [2019-01-12 00:52:32,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:32" (1/1) ... [2019-01-12 00:52:32,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:52:32,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:52:32,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:52:32,732 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:52:32,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:32" (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 00:52:32,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:52:32,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:52:35,777 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:52:35,778 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:52:35,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:52:35 BoogieIcfgContainer [2019-01-12 00:52:35,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:52:35,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:52:35,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:52:35,785 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:52:35,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:52:31" (1/3) ... [2019-01-12 00:52:35,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734de7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:52:35, skipping insertion in model container [2019-01-12 00:52:35,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:32" (2/3) ... [2019-01-12 00:52:35,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734de7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:52:35, skipping insertion in model container [2019-01-12 00:52:35,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:52:35" (3/3) ... [2019-01-12 00:52:35,789 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label26_true-unreach-call_false-termination.c [2019-01-12 00:52:35,801 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:52:35,811 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:52:35,831 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:52:35,869 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:52:35,870 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:52:35,870 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:52:35,870 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:52:35,870 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:52:35,871 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:52:35,871 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:52:35,871 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:52:35,871 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:52:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:52:35,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 00:52:35,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:35,908 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, 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 00:52:35,912 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:35,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:35,918 INFO L82 PathProgramCache]: Analyzing trace with hash -583926962, now seen corresponding path program 1 times [2019-01-12 00:52:35,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:35,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:35,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:35,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:35,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:36,545 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 00:52:36,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:36,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:52:36,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:52:36,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:52:36,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:36,573 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-01-12 00:52:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:38,794 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-01-12 00:52:38,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:52:38,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-01-12 00:52:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:38,816 INFO L225 Difference]: With dead ends: 662 [2019-01-12 00:52:38,817 INFO L226 Difference]: Without dead ends: 397 [2019-01-12 00:52:38,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:38,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-12 00:52:38,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-01-12 00:52:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-12 00:52:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-01-12 00:52:38,935 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 103 [2019-01-12 00:52:38,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:38,936 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-01-12 00:52:38,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:52:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-01-12 00:52:38,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 00:52:38,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:38,942 INFO L402 BasicCegarLoop]: trace histogram [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, 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 00:52:38,942 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:38,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:38,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1625453403, now seen corresponding path program 1 times [2019-01-12 00:52:38,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:38,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:38,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:38,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:38,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:39,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:39,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:52:39,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:52:39,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:52:39,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:39,183 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 4 states. [2019-01-12 00:52:40,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:40,516 INFO L93 Difference]: Finished difference Result 1447 states and 2019 transitions. [2019-01-12 00:52:40,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:52:40,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-01-12 00:52:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:40,525 INFO L225 Difference]: With dead ends: 1447 [2019-01-12 00:52:40,526 INFO L226 Difference]: Without dead ends: 1052 [2019-01-12 00:52:40,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-01-12 00:52:40,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2019-01-12 00:52:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-01-12 00:52:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-01-12 00:52:40,605 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 110 [2019-01-12 00:52:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:40,605 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-01-12 00:52:40,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:52:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-01-12 00:52:40,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-12 00:52:40,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:40,613 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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 00:52:40,613 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:40,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:40,614 INFO L82 PathProgramCache]: Analyzing trace with hash 733143454, now seen corresponding path program 1 times [2019-01-12 00:52:40,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:40,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:40,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:40,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:40,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:40,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:40,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:52:40,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:52:40,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:52:40,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:40,721 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-01-12 00:52:42,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:42,935 INFO L93 Difference]: Finished difference Result 1578 states and 1998 transitions. [2019-01-12 00:52:42,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:52:42,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-01-12 00:52:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:42,943 INFO L225 Difference]: With dead ends: 1578 [2019-01-12 00:52:42,943 INFO L226 Difference]: Without dead ends: 790 [2019-01-12 00:52:42,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:42,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-12 00:52:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-01-12 00:52:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-01-12 00:52:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 930 transitions. [2019-01-12 00:52:42,969 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 930 transitions. Word has length 124 [2019-01-12 00:52:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:42,970 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 930 transitions. [2019-01-12 00:52:42,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:52:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 930 transitions. [2019-01-12 00:52:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-12 00:52:42,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:42,979 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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 00:52:42,979 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:42,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:42,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2001117315, now seen corresponding path program 1 times [2019-01-12 00:52:42,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:42,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:42,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:42,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:42,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:43,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:43,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:52:43,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:43,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:43,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:43,097 INFO L87 Difference]: Start difference. First operand 790 states and 930 transitions. Second operand 3 states. [2019-01-12 00:52:44,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:44,086 INFO L93 Difference]: Finished difference Result 2233 states and 2643 transitions. [2019-01-12 00:52:44,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:44,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-01-12 00:52:44,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:44,097 INFO L225 Difference]: With dead ends: 2233 [2019-01-12 00:52:44,097 INFO L226 Difference]: Without dead ends: 1445 [2019-01-12 00:52:44,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-01-12 00:52:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-01-12 00:52:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-01-12 00:52:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1374 transitions. [2019-01-12 00:52:44,127 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1374 transitions. Word has length 125 [2019-01-12 00:52:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:44,127 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1374 transitions. [2019-01-12 00:52:44,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1374 transitions. [2019-01-12 00:52:44,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 00:52:44,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:44,131 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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 00:52:44,131 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:44,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:44,131 INFO L82 PathProgramCache]: Analyzing trace with hash 891303243, now seen corresponding path program 1 times [2019-01-12 00:52:44,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:44,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:44,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:44,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:44,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 00:52:44,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:44,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:52:44,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:44,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:44,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:44,232 INFO L87 Difference]: Start difference. First operand 1183 states and 1374 transitions. Second operand 3 states. [2019-01-12 00:52:44,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:44,787 INFO L93 Difference]: Finished difference Result 3150 states and 3674 transitions. [2019-01-12 00:52:44,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:44,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-01-12 00:52:44,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:44,797 INFO L225 Difference]: With dead ends: 3150 [2019-01-12 00:52:44,797 INFO L226 Difference]: Without dead ends: 1969 [2019-01-12 00:52:44,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-01-12 00:52:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1445. [2019-01-12 00:52:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-01-12 00:52:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions. [2019-01-12 00:52:44,832 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 129 [2019-01-12 00:52:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:44,833 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions. [2019-01-12 00:52:44,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions. [2019-01-12 00:52:44,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-12 00:52:44,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:44,837 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 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 00:52:44,837 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:44,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:44,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1514660785, now seen corresponding path program 1 times [2019-01-12 00:52:44,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:44,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:44,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:44,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:52:44,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:44,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:52:44,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:44,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:44,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:44,941 INFO L87 Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand 3 states. [2019-01-12 00:52:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:45,647 INFO L93 Difference]: Finished difference Result 3019 states and 3514 transitions. [2019-01-12 00:52:45,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:45,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-01-12 00:52:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:45,655 INFO L225 Difference]: With dead ends: 3019 [2019-01-12 00:52:45,655 INFO L226 Difference]: Without dead ends: 1576 [2019-01-12 00:52:45,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-01-12 00:52:45,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2019-01-12 00:52:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-01-12 00:52:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions. [2019-01-12 00:52:45,687 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 131 [2019-01-12 00:52:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:45,688 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions. [2019-01-12 00:52:45,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions. [2019-01-12 00:52:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-12 00:52:45,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:45,692 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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 00:52:45,692 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:45,692 INFO L82 PathProgramCache]: Analyzing trace with hash 263294258, now seen corresponding path program 1 times [2019-01-12 00:52:45,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:45,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:45,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:45,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:45,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:45,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:45,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:52:45,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:45,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:45,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:45,838 INFO L87 Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand 3 states. [2019-01-12 00:52:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:46,767 INFO L93 Difference]: Finished difference Result 3281 states and 3792 transitions. [2019-01-12 00:52:46,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:46,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-01-12 00:52:46,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:46,776 INFO L225 Difference]: With dead ends: 3281 [2019-01-12 00:52:46,776 INFO L226 Difference]: Without dead ends: 1838 [2019-01-12 00:52:46,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-01-12 00:52:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-01-12 00:52:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-01-12 00:52:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1965 transitions. [2019-01-12 00:52:46,817 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1965 transitions. Word has length 132 [2019-01-12 00:52:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:46,817 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 1965 transitions. [2019-01-12 00:52:46,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1965 transitions. [2019-01-12 00:52:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-12 00:52:46,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:46,824 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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 00:52:46,824 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:46,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:46,825 INFO L82 PathProgramCache]: Analyzing trace with hash 294946666, now seen corresponding path program 1 times [2019-01-12 00:52:46,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:46,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:46,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:46,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:47,439 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-12 00:52:47,837 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-12 00:52:48,228 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2019-01-12 00:52:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:48,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:48,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 00:52:48,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:52:48,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:52:48,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:52:48,371 INFO L87 Difference]: Start difference. First operand 1707 states and 1965 transitions. Second operand 8 states. [2019-01-12 00:52:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:50,055 INFO L93 Difference]: Finished difference Result 3582 states and 4117 transitions. [2019-01-12 00:52:50,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 00:52:50,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2019-01-12 00:52:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:50,065 INFO L225 Difference]: With dead ends: 3582 [2019-01-12 00:52:50,065 INFO L226 Difference]: Without dead ends: 2008 [2019-01-12 00:52:50,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:52:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-01-12 00:52:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1707. [2019-01-12 00:52:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-01-12 00:52:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1953 transitions. [2019-01-12 00:52:50,108 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1953 transitions. Word has length 136 [2019-01-12 00:52:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:50,108 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 1953 transitions. [2019-01-12 00:52:50,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:52:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1953 transitions. [2019-01-12 00:52:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-12 00:52:50,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:50,114 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:52:50,115 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:50,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2118430365, now seen corresponding path program 1 times [2019-01-12 00:52:50,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:50,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:50,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:50,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:50,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:50,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:50,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:52:50,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:50,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:50,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:50,266 INFO L87 Difference]: Start difference. First operand 1707 states and 1953 transitions. Second operand 3 states. [2019-01-12 00:52:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:50,829 INFO L93 Difference]: Finished difference Result 2102 states and 2422 transitions. [2019-01-12 00:52:50,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:50,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-01-12 00:52:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:50,841 INFO L225 Difference]: With dead ends: 2102 [2019-01-12 00:52:50,841 INFO L226 Difference]: Without dead ends: 2100 [2019-01-12 00:52:50,842 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 00:52:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-01-12 00:52:50,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-01-12 00:52:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:52:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2129 transitions. [2019-01-12 00:52:50,881 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2129 transitions. Word has length 162 [2019-01-12 00:52:50,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:50,881 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2129 transitions. [2019-01-12 00:52:50,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2129 transitions. [2019-01-12 00:52:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-12 00:52:50,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:50,888 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:52:50,888 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash 172823534, now seen corresponding path program 1 times [2019-01-12 00:52:50,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:50,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:50,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:50,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:50,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-01-12 00:52:51,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:51,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:52:51,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:51,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:51,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:51,013 INFO L87 Difference]: Start difference. First operand 1838 states and 2129 transitions. Second operand 3 states. [2019-01-12 00:52:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:53,446 INFO L93 Difference]: Finished difference Result 3674 states and 4254 transitions. [2019-01-12 00:52:53,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:53,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-01-12 00:52:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:53,454 INFO L225 Difference]: With dead ends: 3674 [2019-01-12 00:52:53,455 INFO L226 Difference]: Without dead ends: 1838 [2019-01-12 00:52:53,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-01-12 00:52:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-01-12 00:52:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:52:53,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2011 transitions. [2019-01-12 00:52:53,492 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2011 transitions. Word has length 167 [2019-01-12 00:52:53,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:53,492 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2011 transitions. [2019-01-12 00:52:53,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:53,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2011 transitions. [2019-01-12 00:52:53,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-01-12 00:52:53,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:53,499 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 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, 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 00:52:53,499 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:53,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:53,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1369122589, now seen corresponding path program 1 times [2019-01-12 00:52:53,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:53,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:53,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:53,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:53,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 00:52:53,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:53,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:52:53,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:53,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:53,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:53,705 INFO L87 Difference]: Start difference. First operand 1838 states and 2011 transitions. Second operand 3 states. [2019-01-12 00:52:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:54,223 INFO L93 Difference]: Finished difference Result 3674 states and 4020 transitions. [2019-01-12 00:52:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:54,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-01-12 00:52:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:54,228 INFO L225 Difference]: With dead ends: 3674 [2019-01-12 00:52:54,229 INFO L226 Difference]: Without dead ends: 1838 [2019-01-12 00:52:54,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-01-12 00:52:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-01-12 00:52:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-01-12 00:52:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1855 transitions. [2019-01-12 00:52:54,262 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1855 transitions. Word has length 197 [2019-01-12 00:52:54,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:54,263 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 1855 transitions. [2019-01-12 00:52:54,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1855 transitions. [2019-01-12 00:52:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-12 00:52:54,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:54,269 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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 00:52:54,270 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:54,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:54,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2102385007, now seen corresponding path program 1 times [2019-01-12 00:52:54,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:54,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:54,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:54,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:54,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:54,649 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-12 00:52:54,914 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-12 00:52:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 181 proven. 93 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-12 00:52:55,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:52:55,124 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 00:52:55,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:55,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:52:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-01-12 00:52:55,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:52:55,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-01-12 00:52:55,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 00:52:55,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 00:52:55,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-01-12 00:52:55,387 INFO L87 Difference]: Start difference. First operand 1707 states and 1855 transitions. Second operand 9 states. [2019-01-12 00:52:57,808 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 00:53:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:00,396 INFO L93 Difference]: Finished difference Result 3586 states and 3908 transitions. [2019-01-12 00:53:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 00:53:00,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 226 [2019-01-12 00:53:00,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:00,401 INFO L225 Difference]: With dead ends: 3586 [2019-01-12 00:53:00,401 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:53:00,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-01-12 00:53:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:53:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:53:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:53:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:53:00,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 226 [2019-01-12 00:53:00,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:00,406 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:53:00,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 00:53:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:53:00,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:53:00,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:53:00,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:00,530 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 30 [2019-01-12 00:53:00,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:00,659 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 30 [2019-01-12 00:53:01,790 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-01-12 00:53:02,654 WARN L181 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-01-12 00:53:02,657 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:53:02,657 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:53:02,657 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,657 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,658 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,658 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,658 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,658 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,658 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:53:02,658 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:53:02,658 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:53:02,658 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:53:02,658 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:53:02,658 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:53:02,659 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:53:02,659 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:53:02,659 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:53:02,659 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:53:02,659 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,659 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,659 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,659 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,659 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,659 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,659 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:53:02,660 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:53:02,660 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:53:02,660 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:53:02,660 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:53:02,660 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:53:02,660 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:53:02,660 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:53:02,660 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:53:02,660 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:53:02,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 485) no Hoare annotation was computed. [2019-01-12 00:53:02,661 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:53:02,661 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:53:02,661 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:53:02,661 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:53:02,661 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:53:02,661 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,661 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,661 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,661 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,661 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,662 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:53:02,662 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:53:02,662 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:53:02,662 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:53:02,662 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:53:02,662 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:53:02,662 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:53:02,662 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:53:02,662 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:53:02,666 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (<= ~a20~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse1 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and (= ~a16~0 4) .cse1 .cse2) (not (= ~a8~0 15)) (and .cse1 .cse2 (= ~a16~0 5)) (and .cse0 (= ~a20~0 1) .cse1))) [2019-01-12 00:53:02,667 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,667 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,667 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,667 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,667 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,667 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:53:02,667 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:53:02,667 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:53:02,667 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:53:02,667 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:53:02,667 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:53:02,668 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:53:02,668 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:53:02,668 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:53:02,668 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:53:02,668 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:53:02,668 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:53:02,668 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:53:02,668 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:53:02,668 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,668 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,668 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,669 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,669 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,673 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:53:02,673 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:53:02,673 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:53:02,673 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:53:02,673 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:53:02,673 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:53:02,673 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:53:02,673 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:53:02,673 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:53:02,674 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,674 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,674 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,674 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,674 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:53:02,674 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,674 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:53:02,674 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:53:02,674 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:53:02,674 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:53:02,674 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:53:02,675 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:53:02,675 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:53:02,675 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:53:02,675 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:53:02,675 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:53:02,675 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:53:02,675 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:53:02,675 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:53:02,675 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:53:02,675 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,676 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (<= ~a20~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse1 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and (= ~a16~0 4) .cse1 .cse2) (not (= ~a8~0 15)) (and .cse1 .cse2 (= ~a16~0 5)) (and .cse0 (= ~a20~0 1) .cse1))) [2019-01-12 00:53:02,676 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,676 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,676 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,676 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,676 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:53:02,676 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:53:02,676 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:53:02,676 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:53:02,676 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:53:02,676 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:53:02,677 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:53:02,677 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:53:02,684 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,684 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,684 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,684 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,684 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,684 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:53:02,684 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:53:02,684 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:53:02,684 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:53:02,684 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:53:02,685 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:53:02,686 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:53:02,686 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:53:02,686 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:53:02,686 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:53:02,686 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:53:02,686 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:53:02,686 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:53:02,686 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:53:02,686 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:53:02,686 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,686 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,686 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,686 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,687 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,687 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:53:02,687 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,687 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:53:02,687 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:53:02,687 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:53:02,687 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:53:02,687 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:53:02,687 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:53:02,687 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:53:02,687 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:53:02,687 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:53:02,688 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:53:02,688 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:53:02,688 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:53:02,688 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:53:02,688 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:53:02,688 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:53:02,688 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,688 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,688 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,688 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,688 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,688 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:02,689 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:53:02,689 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:53:02,689 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:53:02,689 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:53:02,689 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:53:02,689 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:53:02,689 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:53:02,689 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:53:02,689 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:53:02,689 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:53:02,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:53:02 BoogieIcfgContainer [2019-01-12 00:53:02,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:53:02,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:53:02,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:53:02,715 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:53:02,715 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:52:35" (3/4) ... [2019-01-12 00:53:02,720 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:53:02,760 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:53:02,762 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:53:02,964 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:53:02,968 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:53:02,969 INFO L168 Benchmark]: Toolchain (without parser) took 31256.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 377.0 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -232.4 MB). Peak memory consumption was 144.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:02,970 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 00:53:02,970 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.29 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:02,971 INFO L168 Benchmark]: Boogie Procedure Inliner took 184.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -199.5 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:02,971 INFO L168 Benchmark]: Boogie Preprocessor took 101.65 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:02,971 INFO L168 Benchmark]: RCFGBuilder took 3048.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:02,971 INFO L168 Benchmark]: TraceAbstraction took 26932.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.0 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:02,972 INFO L168 Benchmark]: Witness Printer took 253.84 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:02,977 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 728.29 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 184.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -199.5 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.65 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3048.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26932.78 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.8 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.0 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. * Witness Printer took 253.84 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 485]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((!(a7 == 1) && a21 == 1) && a20 <= 0) || ((a16 == 4 && a21 == 1) && a20 <= 0)) || !(a8 == 15)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((!(a7 == 1) && a20 == 1) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((!(a7 == 1) && a21 == 1) && a20 <= 0) || ((a16 == 4 && a21 == 1) && a20 <= 0)) || !(a8 == 15)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((!(a7 == 1) && a20 == 1) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 26.8s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 19.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 648 SDtfs, 2410 SDslu, 171 SDs, 0 SdLazy, 7901 SolverSat, 944 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 249 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=9, 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: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 2135 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 72 NumberOfFragments, 95 HoareAnnotationTreeSize, 3 FomulaSimplifications, 31706 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 26 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1968 NumberOfCodeBlocks, 1968 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1955 ConstructedInterpolants, 0 QuantifiedInterpolants, 719614 SizeOfPredicates, 1 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1058/1151 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...