./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem10_label59_true-unreach-call.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/Problem10_label59_true-unreach-call.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 5f1f3e9c958502587d73771213325403adeeeeae ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:33:07,719 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:33:07,720 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:33:07,733 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:33:07,733 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:33:07,734 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:33:07,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:33:07,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:33:07,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:33:07,740 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:33:07,741 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:33:07,741 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:33:07,742 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:33:07,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:33:07,745 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:33:07,746 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:33:07,746 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:33:07,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:33:07,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:33:07,752 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:33:07,753 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:33:07,755 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:33:07,758 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:33:07,758 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:33:07,758 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:33:07,759 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:33:07,760 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:33:07,762 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:33:07,762 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:33:07,763 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:33:07,764 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:33:07,765 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:33:07,765 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:33:07,765 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:33:07,767 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:33:07,767 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:33:07,768 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:33:07,783 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:33:07,783 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:33:07,785 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:33:07,785 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:33:07,785 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:33:07,786 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:33:07,786 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:33:07,786 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:33:07,786 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:33:07,786 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:33:07,786 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:33:07,787 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:33:07,787 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:33:07,787 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:33:07,787 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:33:07,787 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:33:07,787 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:33:07,788 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:33:07,789 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:33:07,789 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:33:07,790 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:33:07,790 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:33:07,790 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:33:07,790 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:33:07,790 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:33:07,791 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:33:07,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:33:07,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:33:07,792 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 -> 5f1f3e9c958502587d73771213325403adeeeeae [2019-01-12 03:33:07,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:33:07,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:33:07,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:33:07,859 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:33:07,859 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:33:07,860 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem10_label59_true-unreach-call.c [2019-01-12 03:33:07,909 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a270b68a/77b8e97d6e39484487928c39ccafac41/FLAG1ffe44f63 [2019-01-12 03:33:08,454 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:33:08,457 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem10_label59_true-unreach-call.c [2019-01-12 03:33:08,473 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a270b68a/77b8e97d6e39484487928c39ccafac41/FLAG1ffe44f63 [2019-01-12 03:33:08,714 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a270b68a/77b8e97d6e39484487928c39ccafac41 [2019-01-12 03:33:08,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:33:08,720 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:33:08,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:33:08,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:33:08,724 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:33:08,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:33:08" (1/1) ... [2019-01-12 03:33:08,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bf390c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:08, skipping insertion in model container [2019-01-12 03:33:08,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:33:08" (1/1) ... [2019-01-12 03:33:08,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:33:08,797 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:33:09,284 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:33:09,292 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:33:09,542 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:33:09,692 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:33:09,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09 WrapperNode [2019-01-12 03:33:09,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:33:09,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:33:09,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:33:09,696 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:33:09,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:33:09,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:33:09,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:33:09,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:33:09,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:33:09,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:33:09,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:33:09,912 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:33:09,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (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 03:33:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:33:09,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:33:12,889 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:33:12,890 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:33:12,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:33:12 BoogieIcfgContainer [2019-01-12 03:33:12,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:33:12,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:33:12,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:33:12,896 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:33:12,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:33:08" (1/3) ... [2019-01-12 03:33:12,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37637ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:33:12, skipping insertion in model container [2019-01-12 03:33:12,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (2/3) ... [2019-01-12 03:33:12,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37637ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:33:12, skipping insertion in model container [2019-01-12 03:33:12,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:33:12" (3/3) ... [2019-01-12 03:33:12,900 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label59_true-unreach-call.c [2019-01-12 03:33:12,908 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:33:12,916 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:33:12,932 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:33:12,967 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:33:12,968 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:33:12,968 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:33:12,968 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:33:12,968 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:33:12,968 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:33:12,968 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:33:12,969 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:33:12,969 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:33:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-01-12 03:33:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 03:33:13,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:13,004 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] [2019-01-12 03:33:13,007 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:13,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:13,013 INFO L82 PathProgramCache]: Analyzing trace with hash 962891993, now seen corresponding path program 1 times [2019-01-12 03:33:13,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:13,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:13,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:13,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:13,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:13,541 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 03:33:13,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:13,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:33:13,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:33:13,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:33:13,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:13,575 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-01-12 03:33:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:15,902 INFO L93 Difference]: Finished difference Result 709 states and 1261 transitions. [2019-01-12 03:33:15,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:33:15,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-01-12 03:33:15,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:15,925 INFO L225 Difference]: With dead ends: 709 [2019-01-12 03:33:15,925 INFO L226 Difference]: Without dead ends: 421 [2019-01-12 03:33:15,930 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 03:33:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-12 03:33:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-01-12 03:33:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-12 03:33:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-01-12 03:33:16,006 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 65 [2019-01-12 03:33:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:16,007 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-01-12 03:33:16,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:33:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-01-12 03:33:16,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-12 03:33:16,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:16,014 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:16,015 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:16,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2138327860, now seen corresponding path program 1 times [2019-01-12 03:33:16,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:16,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:16,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:16,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:16,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:16,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:16,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:33:16,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:33:16,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:33:16,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:16,345 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 4 states. [2019-01-12 03:33:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:17,988 INFO L93 Difference]: Finished difference Result 1118 states and 1720 transitions. [2019-01-12 03:33:17,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:33:17,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-01-12 03:33:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:17,997 INFO L225 Difference]: With dead ends: 1118 [2019-01-12 03:33:17,997 INFO L226 Difference]: Without dead ends: 838 [2019-01-12 03:33:18,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 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 03:33:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-01-12 03:33:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-01-12 03:33:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-01-12 03:33:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1138 transitions. [2019-01-12 03:33:18,049 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1138 transitions. Word has length 131 [2019-01-12 03:33:18,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:18,050 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1138 transitions. [2019-01-12 03:33:18,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:33:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1138 transitions. [2019-01-12 03:33:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-12 03:33:18,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:18,058 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:18,058 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:18,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1097584517, now seen corresponding path program 1 times [2019-01-12 03:33:18,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:18,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:18,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:18,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:18,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:18,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:18,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:33:18,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:33:18,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:33:18,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:18,445 INFO L87 Difference]: Start difference. First operand 838 states and 1138 transitions. Second operand 4 states. [2019-01-12 03:33:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:20,940 INFO L93 Difference]: Finished difference Result 1952 states and 2682 transitions. [2019-01-12 03:33:20,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:33:20,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-01-12 03:33:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:20,951 INFO L225 Difference]: With dead ends: 1952 [2019-01-12 03:33:20,951 INFO L226 Difference]: Without dead ends: 1116 [2019-01-12 03:33:20,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-01-12 03:33:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2019-01-12 03:33:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2019-01-12 03:33:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1386 transitions. [2019-01-12 03:33:21,005 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1386 transitions. Word has length 142 [2019-01-12 03:33:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:21,006 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1386 transitions. [2019-01-12 03:33:21,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:33:21,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1386 transitions. [2019-01-12 03:33:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-12 03:33:21,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:21,026 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, 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] [2019-01-12 03:33:21,026 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:21,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:21,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1600410530, now seen corresponding path program 1 times [2019-01-12 03:33:21,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:21,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:21,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:21,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:21,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:21,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:21,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:33:21,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:33:21,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:33:21,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:21,440 INFO L87 Difference]: Start difference. First operand 1116 states and 1386 transitions. Second operand 4 states. [2019-01-12 03:33:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:22,752 INFO L93 Difference]: Finished difference Result 3759 states and 4676 transitions. [2019-01-12 03:33:22,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:33:22,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-01-12 03:33:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:22,768 INFO L225 Difference]: With dead ends: 3759 [2019-01-12 03:33:22,768 INFO L226 Difference]: Without dead ends: 2645 [2019-01-12 03:33:22,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 03:33:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2019-01-12 03:33:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1672. [2019-01-12 03:33:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-01-12 03:33:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2043 transitions. [2019-01-12 03:33:22,828 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2043 transitions. Word has length 192 [2019-01-12 03:33:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:22,831 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2043 transitions. [2019-01-12 03:33:22,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:33:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2043 transitions. [2019-01-12 03:33:22,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-01-12 03:33:22,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:22,836 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 03:33:22,836 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:22,836 INFO L82 PathProgramCache]: Analyzing trace with hash -354141657, now seen corresponding path program 1 times [2019-01-12 03:33:22,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:22,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:22,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:22,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 127 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:23,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:33:23,193 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 03:33:23,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:23,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:33:23,693 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 15 [2019-01-12 03:33:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 127 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:23,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:33:23,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-01-12 03:33:23,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:33:23,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:33:23,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:33:23,996 INFO L87 Difference]: Start difference. First operand 1672 states and 2043 transitions. Second operand 8 states. [2019-01-12 03:33:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:31,811 INFO L93 Difference]: Finished difference Result 4593 states and 5616 transitions. [2019-01-12 03:33:31,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 03:33:31,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-01-12 03:33:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:31,834 INFO L225 Difference]: With dead ends: 4593 [2019-01-12 03:33:31,834 INFO L226 Difference]: Without dead ends: 2923 [2019-01-12 03:33:31,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-12 03:33:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2019-01-12 03:33:31,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2367. [2019-01-12 03:33:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-01-12 03:33:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2718 transitions. [2019-01-12 03:33:31,892 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2718 transitions. Word has length 213 [2019-01-12 03:33:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:31,893 INFO L480 AbstractCegarLoop]: Abstraction has 2367 states and 2718 transitions. [2019-01-12 03:33:31,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:33:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2718 transitions. [2019-01-12 03:33:31,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-01-12 03:33:31,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:31,899 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:31,899 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:31,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:31,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1412343006, now seen corresponding path program 1 times [2019-01-12 03:33:31,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:31,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:31,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:31,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:31,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:32,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:32,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:33:32,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:33:32,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:33:32,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:33:32,292 INFO L87 Difference]: Start difference. First operand 2367 states and 2718 transitions. Second operand 5 states. [2019-01-12 03:33:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:34,128 INFO L93 Difference]: Finished difference Result 6261 states and 7189 transitions. [2019-01-12 03:33:34,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:33:34,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2019-01-12 03:33:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:34,139 INFO L225 Difference]: With dead ends: 6261 [2019-01-12 03:33:34,140 INFO L226 Difference]: Without dead ends: 2228 [2019-01-12 03:33:34,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:33:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2019-01-12 03:33:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2089. [2019-01-12 03:33:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2019-01-12 03:33:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2311 transitions. [2019-01-12 03:33:34,189 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2311 transitions. Word has length 217 [2019-01-12 03:33:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:34,190 INFO L480 AbstractCegarLoop]: Abstraction has 2089 states and 2311 transitions. [2019-01-12 03:33:34,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:33:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2311 transitions. [2019-01-12 03:33:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-12 03:33:34,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:34,197 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 03:33:34,197 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:34,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:34,202 INFO L82 PathProgramCache]: Analyzing trace with hash 219066406, now seen corresponding path program 1 times [2019-01-12 03:33:34,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:34,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:34,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:34,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:34,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:34,527 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 03:33:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-01-12 03:33:34,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:34,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 03:33:34,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:33:34,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:33:34,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:33:34,789 INFO L87 Difference]: Start difference. First operand 2089 states and 2311 transitions. Second operand 7 states. [2019-01-12 03:33:36,835 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-12 03:33:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:38,497 INFO L93 Difference]: Finished difference Result 4329 states and 4781 transitions. [2019-01-12 03:33:38,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:33:38,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 252 [2019-01-12 03:33:38,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:38,514 INFO L225 Difference]: With dead ends: 4329 [2019-01-12 03:33:38,514 INFO L226 Difference]: Without dead ends: 2242 [2019-01-12 03:33:38,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:33:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2019-01-12 03:33:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2228. [2019-01-12 03:33:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2019-01-12 03:33:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2454 transitions. [2019-01-12 03:33:38,571 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2454 transitions. Word has length 252 [2019-01-12 03:33:38,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:38,571 INFO L480 AbstractCegarLoop]: Abstraction has 2228 states and 2454 transitions. [2019-01-12 03:33:38,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:33:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2454 transitions. [2019-01-12 03:33:38,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-01-12 03:33:38,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:38,583 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:38,583 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:38,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:38,583 INFO L82 PathProgramCache]: Analyzing trace with hash 352328165, now seen corresponding path program 1 times [2019-01-12 03:33:38,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:38,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:38,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:38,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 292 proven. 100 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-01-12 03:33:39,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:33:39,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:33:39,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:39,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:33:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 330 proven. 62 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-01-12 03:33:40,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:33:40,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-01-12 03:33:40,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:33:40,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:33:40,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:33:40,092 INFO L87 Difference]: Start difference. First operand 2228 states and 2454 transitions. Second operand 8 states. [2019-01-12 03:33:43,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:43,105 INFO L93 Difference]: Finished difference Result 5705 states and 6295 transitions. [2019-01-12 03:33:43,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 03:33:43,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 363 [2019-01-12 03:33:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:43,122 INFO L225 Difference]: With dead ends: 5705 [2019-01-12 03:33:43,122 INFO L226 Difference]: Without dead ends: 3618 [2019-01-12 03:33:43,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 360 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:33:43,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3618 states. [2019-01-12 03:33:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3618 to 2506. [2019-01-12 03:33:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-01-12 03:33:43,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2722 transitions. [2019-01-12 03:33:43,182 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2722 transitions. Word has length 363 [2019-01-12 03:33:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:43,183 INFO L480 AbstractCegarLoop]: Abstraction has 2506 states and 2722 transitions. [2019-01-12 03:33:43,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:33:43,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2722 transitions. [2019-01-12 03:33:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-01-12 03:33:43,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:43,193 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:33:43,194 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:43,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:43,194 INFO L82 PathProgramCache]: Analyzing trace with hash -127843405, now seen corresponding path program 1 times [2019-01-12 03:33:43,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:43,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:43,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:43,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:43,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 37 proven. 418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:44,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:33:44,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:33:44,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:44,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:33:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 12 proven. 381 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-01-12 03:33:45,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:33:45,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 16 [2019-01-12 03:33:45,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 03:33:45,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 03:33:45,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-01-12 03:33:45,982 INFO L87 Difference]: Start difference. First operand 2506 states and 2722 transitions. Second operand 17 states. [2019-01-12 03:33:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:55,722 INFO L93 Difference]: Finished difference Result 5854 states and 6378 transitions. [2019-01-12 03:33:55,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 03:33:55,723 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 382 [2019-01-12 03:33:55,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:55,736 INFO L225 Difference]: With dead ends: 5854 [2019-01-12 03:33:55,737 INFO L226 Difference]: Without dead ends: 3489 [2019-01-12 03:33:55,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 378 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 03:33:55,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2019-01-12 03:33:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 2708. [2019-01-12 03:33:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2708 states. [2019-01-12 03:33:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 2921 transitions. [2019-01-12 03:33:55,802 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 2921 transitions. Word has length 382 [2019-01-12 03:33:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:55,803 INFO L480 AbstractCegarLoop]: Abstraction has 2708 states and 2921 transitions. [2019-01-12 03:33:55,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 03:33:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 2921 transitions. [2019-01-12 03:33:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-01-12 03:33:55,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:55,821 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 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] [2019-01-12 03:33:55,821 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:55,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1832472030, now seen corresponding path program 1 times [2019-01-12 03:33:55,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:55,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:55,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:55,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:55,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:56,447 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 03:33:56,705 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 03:33:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 330 proven. 580 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-01-12 03:33:57,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:33:57,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:33:57,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:57,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:33:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 811 proven. 38 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-01-12 03:33:58,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:33:58,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 9 [2019-01-12 03:33:58,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 03:33:58,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 03:33:58,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:33:58,331 INFO L87 Difference]: Start difference. First operand 2708 states and 2921 transitions. Second operand 10 states. [2019-01-12 03:34:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:34:00,725 INFO L93 Difference]: Finished difference Result 5349 states and 5771 transitions. [2019-01-12 03:34:00,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 03:34:00,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 549 [2019-01-12 03:34:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:34:00,739 INFO L225 Difference]: With dead ends: 5349 [2019-01-12 03:34:00,740 INFO L226 Difference]: Without dead ends: 2782 [2019-01-12 03:34:00,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 548 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-01-12 03:34:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2019-01-12 03:34:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2569. [2019-01-12 03:34:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2019-01-12 03:34:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 2753 transitions. [2019-01-12 03:34:00,800 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 2753 transitions. Word has length 549 [2019-01-12 03:34:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:34:00,801 INFO L480 AbstractCegarLoop]: Abstraction has 2569 states and 2753 transitions. [2019-01-12 03:34:00,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 03:34:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 2753 transitions. [2019-01-12 03:34:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2019-01-12 03:34:00,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:34:00,810 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 03:34:00,811 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:34:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:34:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1566047763, now seen corresponding path program 1 times [2019-01-12 03:34:00,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:34:00,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:34:00,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:34:00,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:34:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:34:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:34:01,380 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 03:34:01,608 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 03:34:02,053 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-01-12 03:34:02,400 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2019-01-12 03:34:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 706 proven. 265 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-01-12 03:34:03,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:34:03,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:34:03,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:34:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:34:03,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:34:08,005 WARN L181 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 41 DAG size of output: 20 [2019-01-12 03:34:08,383 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 26 [2019-01-12 03:34:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 788 proven. 126 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-01-12 03:34:09,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:34:09,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2019-01-12 03:34:09,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 03:34:09,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 03:34:09,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=142, Unknown=2, NotChecked=0, Total=182 [2019-01-12 03:34:09,113 INFO L87 Difference]: Start difference. First operand 2569 states and 2753 transitions. Second operand 14 states. [2019-01-12 03:34:15,872 WARN L181 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-01-12 03:34:18,032 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-01-12 03:34:20,971 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 32 [2019-01-12 03:34:23,223 WARN L181 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-01-12 03:34:24,362 WARN L181 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-01-12 03:34:25,119 WARN L181 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-01-12 03:34:27,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:34:27,412 INFO L93 Difference]: Finished difference Result 6073 states and 6491 transitions. [2019-01-12 03:34:27,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 03:34:27,413 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 579 [2019-01-12 03:34:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:34:27,415 INFO L225 Difference]: With dead ends: 6073 [2019-01-12 03:34:27,415 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:34:27,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 598 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=346, Invalid=1292, Unknown=2, NotChecked=0, Total=1640 [2019-01-12 03:34:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:34:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:34:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:34:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:34:27,422 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 579 [2019-01-12 03:34:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:34:27,422 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:34:27,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 03:34:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:34:27,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:34:27,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:34:27,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:27,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:27,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:27,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:27,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:27,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:27,896 WARN L181 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 332 [2019-01-12 03:34:27,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:27,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:28,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:28,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:28,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:28,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:28,381 WARN L181 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 351 DAG size of output: 326 [2019-01-12 03:34:46,925 WARN L181 SmtUtils]: Spent 18.54 s on a formula simplification. DAG size of input: 324 DAG size of output: 98 [2019-01-12 03:35:02,240 WARN L181 SmtUtils]: Spent 15.31 s on a formula simplification. DAG size of input: 319 DAG size of output: 93 [2019-01-12 03:35:02,245 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-01-12 03:35:02,245 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,245 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,245 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,245 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,246 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-01-12 03:35:02,247 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,248 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,252 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,252 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,252 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,252 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-01-12 03:35:02,252 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 03:35:02,252 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 03:35:02,252 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 03:35:02,252 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 03:35:02,253 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 03:35:02,253 INFO L444 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse4 (= ~a19~0 9)) (.cse13 (< 0 (+ ~a1~0 13)))) (let ((.cse7 (and .cse13 (not (= ~a19~0 10)) (not (= 0 ~a10~0)) (not (= ~a10~0 1)))) (.cse3 (<= ~a1~0 218)) (.cse8 (or (not (= 5 ULTIMATE.start_calculate_output_~input)) (< 218 ~a1~0))) (.cse1 (<= ~a10~0 2)) (.cse0 (<= 1 ~a10~0)) (.cse11 (exists ((v_~a1~0_346 Int)) (let ((.cse15 (mod v_~a1~0_346 299993))) (and (not (= 0 .cse15)) (<= (+ v_~a1~0_346 13) 0) (< v_~a1~0_346 0) (<= .cse15 (+ ~a1~0 600000)))))) (.cse12 (= ~a10~0 0)) (.cse2 (not .cse4)) (.cse10 (<= ~a19~0 8)) (.cse6 (= ~a10~0 3)) (.cse5 (= ~a12~0 0)) (.cse9 (= ~a4~0 14))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8) .cse9) (and .cse10 .cse7) (and .cse11 (and .cse4 (= ~a10~0 4) .cse5 .cse9 (or .cse3 (not (= ULTIMATE.start_calculate_output_~input 5))))) (and (and .cse8 .cse12 .cse13) .cse5 .cse9) (and (and .cse5 .cse9 .cse1) .cse0) (and .cse6 (<= ~a1~0 4) .cse11 (not (= 2 ULTIMATE.start_calculate_output_~input)) (and .cse4 .cse5 .cse9)) (and .cse12 .cse2) (and .cse10 (not (= 3 ~a10~0))) (and (and .cse6 (exists ((v_prenex_12 Int)) (let ((.cse14 (* 5 (div v_prenex_12 5)))) (and (<= 0 v_prenex_12) (<= (+ (div .cse14 5) 505228) ~a1~0) (<= 23 v_prenex_12) (<= 0 .cse14)))) .cse4) .cse5 .cse9)))) [2019-01-12 03:35:02,253 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-01-12 03:35:02,253 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-01-12 03:35:02,253 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-01-12 03:35:02,253 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-01-12 03:35:02,254 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,254 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,254 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,254 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,254 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,254 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-01-12 03:35:02,254 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-01-12 03:35:02,254 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-01-12 03:35:02,254 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 03:35:02,254 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 03:35:02,254 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 03:35:02,255 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 03:35:02,255 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 03:35:02,255 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-01-12 03:35:02,255 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-01-12 03:35:02,255 INFO L451 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-01-12 03:35:02,255 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-01-12 03:35:02,255 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-01-12 03:35:02,255 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-01-12 03:35:02,255 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,255 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,255 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,255 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,256 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,256 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 03:35:02,256 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 03:35:02,256 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 03:35:02,256 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 03:35:02,256 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 03:35:02,256 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-01-12 03:35:02,256 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-01-12 03:35:02,256 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-01-12 03:35:02,256 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-01-12 03:35:02,256 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,256 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,257 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,258 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,259 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,259 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-01-12 03:35:02,259 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-01-12 03:35:02,259 INFO L448 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-01-12 03:35:02,259 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-01-12 03:35:02,259 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 03:35:02,259 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 03:35:02,259 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 03:35:02,259 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 03:35:02,259 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 03:35:02,259 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-01-12 03:35:02,259 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-01-12 03:35:02,260 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:35:02,260 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-01-12 03:35:02,260 INFO L444 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse6 (= ~a19~0 9)) (.cse13 (< 0 (+ ~a1~0 13)))) (let ((.cse8 (and .cse13 (not (= ~a19~0 10)) (not (= 0 ~a10~0)) (not (= ~a10~0 1)))) (.cse5 (<= ~a1~0 218)) (.cse9 (or (not (= 5 ULTIMATE.start_calculate_output_~input)) (< 218 ~a1~0))) (.cse3 (<= ~a10~0 2)) (.cse2 (<= 1 ~a10~0)) (.cse12 (exists ((v_~a1~0_346 Int)) (let ((.cse15 (mod v_~a1~0_346 299993))) (and (not (= 0 .cse15)) (<= (+ v_~a1~0_346 13) 0) (< v_~a1~0_346 0) (<= .cse15 (+ ~a1~0 600000)))))) (.cse0 (= ~a10~0 0)) (.cse4 (not .cse6)) (.cse11 (<= ~a19~0 8)) (.cse7 (= ~a10~0 3)) (.cse1 (= ~a12~0 0)) (.cse10 (= ~a4~0 14))) (or (and .cse0 .cse1 (and (<= 23 ~a1~0) (<= ~a1~0 23) (= 14 ~a4~0))) (and .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 (and .cse7 .cse8 .cse9) .cse10) (and .cse11 .cse8) (and .cse12 (and .cse6 (= ~a10~0 4) .cse1 .cse10 (or .cse5 (not (= ULTIMATE.start_calculate_output_~input 5))))) (and (and .cse9 .cse0 .cse13) .cse1 .cse10) (and (and .cse1 .cse10 .cse3) .cse2) (and .cse7 (<= ~a1~0 4) .cse12 (not (= 2 ULTIMATE.start_calculate_output_~input)) (and .cse6 .cse1 .cse10)) (and .cse0 .cse4) (and .cse11 (not (= 3 ~a10~0))) (and (and .cse7 (exists ((v_prenex_12 Int)) (let ((.cse14 (* 5 (div v_prenex_12 5)))) (and (<= 0 v_prenex_12) (<= (+ (div .cse14 5) 505228) ~a1~0) (<= 23 v_prenex_12) (<= 0 .cse14)))) .cse6) .cse1 .cse10)))) [2019-01-12 03:35:02,260 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-01-12 03:35:02,260 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,260 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,260 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,260 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,261 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 03:35:02,261 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,261 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,261 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-01-12 03:35:02,261 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-01-12 03:35:02,261 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-01-12 03:35:02,261 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 03:35:02,261 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 03:35:02,261 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 03:35:02,261 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 03:35:02,261 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 03:35:02,261 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 03:35:02,262 INFO L448 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-01-12 03:35:02,262 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-01-12 03:35:02,262 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-01-12 03:35:02,262 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-01-12 03:35:02,262 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,262 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,262 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,262 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,262 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,262 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,262 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-01-12 03:35:02,263 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-01-12 03:35:02,263 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-01-12 03:35:02,263 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:35:02,263 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 03:35:02,263 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 03:35:02,263 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 03:35:02,263 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 03:35:02,263 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 03:35:02,263 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 03:35:02,263 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 199) no Hoare annotation was computed. [2019-01-12 03:35:02,263 INFO L448 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-01-12 03:35:02,264 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-01-12 03:35:02,264 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-01-12 03:35:02,264 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-01-12 03:35:02,264 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-01-12 03:35:02,264 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-01-12 03:35:02,264 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,264 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,264 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,264 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,264 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,264 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,264 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-01-12 03:35:02,265 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 03:35:02,265 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 03:35:02,265 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 03:35:02,265 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 03:35:02,265 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 03:35:02,265 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:35:02,265 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 03:35:02,265 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-01-12 03:35:02,265 INFO L448 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-01-12 03:35:02,265 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-01-12 03:35:02,265 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-01-12 03:35:02,265 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-01-12 03:35:02,266 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-01-12 03:35:02,266 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,266 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,266 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,266 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,266 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,266 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,266 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-01-12 03:35:02,266 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-01-12 03:35:02,266 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-01-12 03:35:02,266 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 03:35:02,266 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 03:35:02,267 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 03:35:02,267 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 03:35:02,267 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 03:35:02,267 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 03:35:02,267 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-01-12 03:35:02,267 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-01-12 03:35:02,267 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:35:02,267 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-01-12 03:35:02,267 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,267 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,267 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,267 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,268 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,268 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:35:02,268 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-01-12 03:35:02,268 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-01-12 03:35:02,268 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-01-12 03:35:02,268 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 03:35:02,268 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 03:35:02,268 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 03:35:02,268 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 03:35:02,268 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 03:35:02,268 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 03:35:02,268 INFO L448 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-01-12 03:35:02,269 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-01-12 03:35:02,269 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-01-12 03:35:02,297 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,337 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,340 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,340 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,340 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,341 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,341 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,341 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,341 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,341 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,342 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,342 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,342 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,349 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,350 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,350 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,350 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,350 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,351 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,351 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,351 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,351 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,351 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,351 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,352 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:35:02 BoogieIcfgContainer [2019-01-12 03:35:02,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:35:02,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:35:02,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:35:02,359 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:35:02,361 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:33:12" (3/4) ... [2019-01-12 03:35:02,364 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:35:02,383 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:35:02,384 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:35:02,417 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((a10 == 0 && a12 == 0) && (23 <= a1 && a1 <= 23) && 14 == a4) || ((1 <= a10 && a10 <= 2) && !(a19 == 9))) || ((((a1 <= 218 && a19 == 9) && a12 == 0) && (a10 == 3 && ((0 < a1 + 13 && !(a19 == 10)) && !(0 == a10)) && !(a10 == 1)) && (!(5 == input) || 218 < a1)) && a4 == 14)) || (a19 <= 8 && ((0 < a1 + 13 && !(a19 == 10)) && !(0 == a10)) && !(a10 == 1))) || ((\exists v_~a1~0_346 : int :: ((!(0 == v_~a1~0_346 % 299993) && v_~a1~0_346 + 13 <= 0) && v_~a1~0_346 < 0) && v_~a1~0_346 % 299993 <= a1 + 600000) && (((a19 == 9 && a10 == 4) && a12 == 0) && a4 == 14) && (a1 <= 218 || !(input == 5)))) || (((((!(5 == input) || 218 < a1) && a10 == 0) && 0 < a1 + 13) && a12 == 0) && a4 == 14)) || (((a12 == 0 && a4 == 14) && a10 <= 2) && 1 <= a10)) || ((((a10 == 3 && a1 <= 4) && (\exists v_~a1~0_346 : int :: ((!(0 == v_~a1~0_346 % 299993) && v_~a1~0_346 + 13 <= 0) && v_~a1~0_346 < 0) && v_~a1~0_346 % 299993 <= a1 + 600000)) && !(2 == input)) && (a19 == 9 && a12 == 0) && a4 == 14)) || (a10 == 0 && !(a19 == 9))) || (a19 <= 8 && !(3 == a10))) || ((((a10 == 3 && (\exists v_prenex_12 : int :: ((0 <= v_prenex_12 && 5 * (v_prenex_12 / 5) / 5 + 505228 <= a1) && 23 <= v_prenex_12) && 0 <= 5 * (v_prenex_12 / 5))) && a19 == 9) && a12 == 0) && a4 == 14) [2019-01-12 03:35:02,420 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 <= a10 && a10 <= 2) && !(a19 == 9)) || ((((a1 <= 218 && a19 == 9) && a12 == 0) && (a10 == 3 && ((0 < a1 + 13 && !(a19 == 10)) && !(0 == a10)) && !(a10 == 1)) && (!(5 == input) || 218 < a1)) && a4 == 14)) || (a19 <= 8 && ((0 < a1 + 13 && !(a19 == 10)) && !(0 == a10)) && !(a10 == 1))) || ((\exists v_~a1~0_346 : int :: ((!(0 == v_~a1~0_346 % 299993) && v_~a1~0_346 + 13 <= 0) && v_~a1~0_346 < 0) && v_~a1~0_346 % 299993 <= a1 + 600000) && (((a19 == 9 && a10 == 4) && a12 == 0) && a4 == 14) && (a1 <= 218 || !(input == 5)))) || (((((!(5 == input) || 218 < a1) && a10 == 0) && 0 < a1 + 13) && a12 == 0) && a4 == 14)) || (((a12 == 0 && a4 == 14) && a10 <= 2) && 1 <= a10)) || ((((a10 == 3 && a1 <= 4) && (\exists v_~a1~0_346 : int :: ((!(0 == v_~a1~0_346 % 299993) && v_~a1~0_346 + 13 <= 0) && v_~a1~0_346 < 0) && v_~a1~0_346 % 299993 <= a1 + 600000)) && !(2 == input)) && (a19 == 9 && a12 == 0) && a4 == 14)) || (a10 == 0 && !(a19 == 9))) || (a19 <= 8 && !(3 == a10))) || ((((a10 == 3 && (\exists v_prenex_12 : int :: ((0 <= v_prenex_12 && 5 * (v_prenex_12 / 5) / 5 + 505228 <= a1) && 23 <= v_prenex_12) && 0 <= 5 * (v_prenex_12 / 5))) && a19 == 9) && a12 == 0) && a4 == 14) [2019-01-12 03:35:02,557 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:35:02,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:35:02,562 INFO L168 Benchmark]: Toolchain (without parser) took 113842.90 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 872.9 MB). Free memory was 947.3 MB in the beginning and 867.9 MB in the end (delta: 79.5 MB). Peak memory consumption was 952.4 MB. Max. memory is 11.5 GB. [2019-01-12 03:35:02,562 INFO L168 Benchmark]: CDTParser took 0.15 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 03:35:02,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 974.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -130.0 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2019-01-12 03:35:02,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2019-01-12 03:35:02,563 INFO L168 Benchmark]: Boogie Preprocessor took 112.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:35:02,565 INFO L168 Benchmark]: RCFGBuilder took 2979.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 949.0 MB in the end (delta: 113.9 MB). Peak memory consumption was 113.9 MB. Max. memory is 11.5 GB. [2019-01-12 03:35:02,565 INFO L168 Benchmark]: TraceAbstraction took 109466.32 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 786.4 MB). Free memory was 949.0 MB in the beginning and 867.9 MB in the end (delta: 81.1 MB). Peak memory consumption was 867.6 MB. Max. memory is 11.5 GB. [2019-01-12 03:35:02,565 INFO L168 Benchmark]: Witness Printer took 198.64 ms. Allocated memory is still 1.9 GB. Free memory is still 867.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:35:02,569 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.15 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 974.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -130.0 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2979.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 949.0 MB in the end (delta: 113.9 MB). Peak memory consumption was 113.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 109466.32 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 786.4 MB). Free memory was 949.0 MB in the beginning and 867.9 MB in the end (delta: 81.1 MB). Peak memory consumption was 867.6 MB. Max. memory is 11.5 GB. * Witness Printer took 198.64 ms. Allocated memory is still 1.9 GB. Free memory is still 867.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 199]: 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: 582]: Loop Invariant [2019-01-12 03:35:02,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,583 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,584 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,591 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,591 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,591 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,591 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,591 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,600 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,600 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,600 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,601 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,601 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,601 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,601 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] Derived loop invariant: (((((((((((a10 == 0 && a12 == 0) && (23 <= a1 && a1 <= 23) && 14 == a4) || ((1 <= a10 && a10 <= 2) && !(a19 == 9))) || ((((a1 <= 218 && a19 == 9) && a12 == 0) && (a10 == 3 && ((0 < a1 + 13 && !(a19 == 10)) && !(0 == a10)) && !(a10 == 1)) && (!(5 == input) || 218 < a1)) && a4 == 14)) || (a19 <= 8 && ((0 < a1 + 13 && !(a19 == 10)) && !(0 == a10)) && !(a10 == 1))) || ((\exists v_~a1~0_346 : int :: ((!(0 == v_~a1~0_346 % 299993) && v_~a1~0_346 + 13 <= 0) && v_~a1~0_346 < 0) && v_~a1~0_346 % 299993 <= a1 + 600000) && (((a19 == 9 && a10 == 4) && a12 == 0) && a4 == 14) && (a1 <= 218 || !(input == 5)))) || (((((!(5 == input) || 218 < a1) && a10 == 0) && 0 < a1 + 13) && a12 == 0) && a4 == 14)) || (((a12 == 0 && a4 == 14) && a10 <= 2) && 1 <= a10)) || ((((a10 == 3 && a1 <= 4) && (\exists v_~a1~0_346 : int :: ((!(0 == v_~a1~0_346 % 299993) && v_~a1~0_346 + 13 <= 0) && v_~a1~0_346 < 0) && v_~a1~0_346 % 299993 <= a1 + 600000)) && !(2 == input)) && (a19 == 9 && a12 == 0) && a4 == 14)) || (a10 == 0 && !(a19 == 9))) || (a19 <= 8 && !(3 == a10))) || ((((a10 == 3 && (\exists v_prenex_12 : int :: ((0 <= v_prenex_12 && 5 * (v_prenex_12 / 5) / 5 + 505228 <= a1) && 23 <= v_prenex_12) && 0 <= 5 * (v_prenex_12 / 5))) && a19 == 9) && a12 == 0) && a4 == 14) - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 03:35:02,602 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,608 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2019-01-12 03:35:02,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,615 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 03:35:02,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] Derived loop invariant: ((((((((((1 <= a10 && a10 <= 2) && !(a19 == 9)) || ((((a1 <= 218 && a19 == 9) && a12 == 0) && (a10 == 3 && ((0 < a1 + 13 && !(a19 == 10)) && !(0 == a10)) && !(a10 == 1)) && (!(5 == input) || 218 < a1)) && a4 == 14)) || (a19 <= 8 && ((0 < a1 + 13 && !(a19 == 10)) && !(0 == a10)) && !(a10 == 1))) || ((\exists v_~a1~0_346 : int :: ((!(0 == v_~a1~0_346 % 299993) && v_~a1~0_346 + 13 <= 0) && v_~a1~0_346 < 0) && v_~a1~0_346 % 299993 <= a1 + 600000) && (((a19 == 9 && a10 == 4) && a12 == 0) && a4 == 14) && (a1 <= 218 || !(input == 5)))) || (((((!(5 == input) || 218 < a1) && a10 == 0) && 0 < a1 + 13) && a12 == 0) && a4 == 14)) || (((a12 == 0 && a4 == 14) && a10 <= 2) && 1 <= a10)) || ((((a10 == 3 && a1 <= 4) && (\exists v_~a1~0_346 : int :: ((!(0 == v_~a1~0_346 % 299993) && v_~a1~0_346 + 13 <= 0) && v_~a1~0_346 < 0) && v_~a1~0_346 % 299993 <= a1 + 600000)) && !(2 == input)) && (a19 == 9 && a12 == 0) && a4 == 14)) || (a10 == 0 && !(a19 == 9))) || (a19 <= 8 && !(3 == a10))) || ((((a10 == 3 && (\exists v_prenex_12 : int :: ((0 <= v_prenex_12 && 5 * (v_prenex_12 / 5) / 5 + 505228 <= a1) && 23 <= v_prenex_12) && 0 <= 5 * (v_prenex_12 / 5))) && a19 == 9) && a12 == 0) && a4 == 14) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. SAFE Result, 109.3s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 54.8s AutomataDifference, 0.0s DeadEndRemovalTime, 34.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 736 SDtfs, 8115 SDslu, 610 SDs, 0 SdLazy, 27747 SolverSat, 2294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2245 GetRequests, 2111 SyntacticMatches, 13 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 20.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2708occurred 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.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 3927 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 112 NumberOfFragments, 538 HoareAnnotationTreeSize, 3 FomulaSimplifications, 63082 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 43241 FormulaSimplificationTreeSizeReductionInter, 33.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 5171 NumberOfCodeBlocks, 5171 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 5155 ConstructedInterpolants, 458 QuantifiedInterpolants, 20176284 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2707 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 5379/7475 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...