java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label47.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:08:25,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:08:25,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:08:25,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:08:25,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:08:25,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:08:25,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:08:25,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:08:25,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:08:25,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:08:25,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:08:25,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:08:25,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:08:25,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:08:25,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:08:25,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:08:25,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:08:25,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:08:25,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:08:25,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:08:25,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:08:25,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:08:25,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:08:25,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:08:25,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:08:25,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:08:25,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:08:25,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:08:25,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:08:25,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:08:25,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:08:25,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:08:25,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:08:25,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:08:25,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:08:25,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:08:25,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:08:25,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:08:25,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:08:25,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:08:25,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:08:25,676 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 01:08:25,697 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:08:25,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:08:25,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:08:25,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:08:25,700 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:08:25,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:08:25,701 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:08:25,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:08:25,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:08:25,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:08:25,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:08:25,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:08:25,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:08:25,703 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:08:25,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:08:25,704 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:08:25,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:08:25,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:08:25,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:08:25,704 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:08:25,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:08:25,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:08:25,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:08:25,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:08:25,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:08:25,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:08:25,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:08:25,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:08:25,706 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:08:25,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:08:25,777 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:08:25,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:08:25,786 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:08:25,786 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:08:25,787 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label47.c [2019-10-02 01:08:25,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03637698b/58413466be46412b8b6ec020284f8c5a/FLAGee9777d9e [2019-10-02 01:08:26,482 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:08:26,482 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label47.c [2019-10-02 01:08:26,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03637698b/58413466be46412b8b6ec020284f8c5a/FLAGee9777d9e [2019-10-02 01:08:26,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03637698b/58413466be46412b8b6ec020284f8c5a [2019-10-02 01:08:26,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:08:26,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:08:26,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:08:26,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:08:26,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:08:26,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:08:26" (1/1) ... [2019-10-02 01:08:26,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134703a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:08:26, skipping insertion in model container [2019-10-02 01:08:26,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:08:26" (1/1) ... [2019-10-02 01:08:26,697 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:08:26,762 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:08:27,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:08:27,429 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:08:27,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:08:27,760 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:08:27,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:08:27 WrapperNode [2019-10-02 01:08:27,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:08:27,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:08:27,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:08:27,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:08:27,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:08:27" (1/1) ... [2019-10-02 01:08:27,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:08:27" (1/1) ... [2019-10-02 01:08:27,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:08:27" (1/1) ... [2019-10-02 01:08:27,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:08:27" (1/1) ... [2019-10-02 01:08:27,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:08:27" (1/1) ... [2019-10-02 01:08:27,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:08:27" (1/1) ... [2019-10-02 01:08:27,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:08:27" (1/1) ... [2019-10-02 01:08:27,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:08:27,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:08:27,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:08:27,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:08:27,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:08:27" (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-10-02 01:08:28,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:08:28,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:08:28,049 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:08:28,049 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:08:28,049 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:08:28,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:08:28,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:08:28,050 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:08:28,050 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:08:28,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:08:28,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:08:30,009 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:08:30,009 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:08:30,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:08:30 BoogieIcfgContainer [2019-10-02 01:08:30,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:08:30,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:08:30,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:08:30,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:08:30,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:08:26" (1/3) ... [2019-10-02 01:08:30,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b7ea20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:08:30, skipping insertion in model container [2019-10-02 01:08:30,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:08:27" (2/3) ... [2019-10-02 01:08:30,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b7ea20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:08:30, skipping insertion in model container [2019-10-02 01:08:30,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:08:30" (3/3) ... [2019-10-02 01:08:30,023 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label47.c [2019-10-02 01:08:30,034 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:08:30,044 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:08:30,064 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:08:30,111 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:08:30,112 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:08:30,112 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:08:30,112 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:08:30,112 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:08:30,112 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:08:30,113 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:08:30,113 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:08:30,113 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:08:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-10-02 01:08:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 01:08:30,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:08:30,155 INFO L411 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] [2019-10-02 01:08:30,157 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:08:30,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:08:30,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1102823458, now seen corresponding path program 1 times [2019-10-02 01:08:30,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:08:30,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:08:30,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:30,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:30,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:08:30,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:08:30,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:08:30,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:08:30,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:08:30,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:08:30,652 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 3 states. [2019-10-02 01:08:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:08:32,097 INFO L93 Difference]: Finished difference Result 787 states and 1379 transitions. [2019-10-02 01:08:32,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:08:32,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-02 01:08:32,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:08:32,129 INFO L225 Difference]: With dead ends: 787 [2019-10-02 01:08:32,129 INFO L226 Difference]: Without dead ends: 433 [2019-10-02 01:08:32,138 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:08:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-10-02 01:08:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 426. [2019-10-02 01:08:32,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-10-02 01:08:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 678 transitions. [2019-10-02 01:08:32,258 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 678 transitions. Word has length 41 [2019-10-02 01:08:32,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:08:32,258 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 678 transitions. [2019-10-02 01:08:32,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:08:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 678 transitions. [2019-10-02 01:08:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 01:08:32,263 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:08:32,264 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:08:32,264 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:08:32,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:08:32,265 INFO L82 PathProgramCache]: Analyzing trace with hash -659313835, now seen corresponding path program 1 times [2019-10-02 01:08:32,265 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:08:32,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:08:32,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:32,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:32,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:08:32,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:08:32,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 01:08:32,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:08:32,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:08:32,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:08:32,458 INFO L87 Difference]: Start difference. First operand 426 states and 678 transitions. Second operand 5 states. [2019-10-02 01:08:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:08:34,225 INFO L93 Difference]: Finished difference Result 1259 states and 2034 transitions. [2019-10-02 01:08:34,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:08:34,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-10-02 01:08:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:08:34,232 INFO L225 Difference]: With dead ends: 1259 [2019-10-02 01:08:34,233 INFO L226 Difference]: Without dead ends: 839 [2019-10-02 01:08:34,235 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:08:34,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-10-02 01:08:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 627. [2019-10-02 01:08:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-02 01:08:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 934 transitions. [2019-10-02 01:08:34,279 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 934 transitions. Word has length 116 [2019-10-02 01:08:34,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:08:34,281 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 934 transitions. [2019-10-02 01:08:34,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:08:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 934 transitions. [2019-10-02 01:08:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 01:08:34,289 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:08:34,289 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:08:34,291 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:08:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:08:34,292 INFO L82 PathProgramCache]: Analyzing trace with hash -548845122, now seen corresponding path program 1 times [2019-10-02 01:08:34,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:08:34,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:08:34,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:34,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:34,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:34,463 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:08:34,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:08:34,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 01:08:34,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 01:08:34,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 01:08:34,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 01:08:34,468 INFO L87 Difference]: Start difference. First operand 627 states and 934 transitions. Second operand 5 states. [2019-10-02 01:08:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:08:36,300 INFO L93 Difference]: Finished difference Result 1872 states and 2846 transitions. [2019-10-02 01:08:36,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:08:36,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-10-02 01:08:36,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:08:36,309 INFO L225 Difference]: With dead ends: 1872 [2019-10-02 01:08:36,310 INFO L226 Difference]: Without dead ends: 1251 [2019-10-02 01:08:36,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 01:08:36,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-10-02 01:08:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1032. [2019-10-02 01:08:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-10-02 01:08:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1433 transitions. [2019-10-02 01:08:36,366 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1433 transitions. Word has length 127 [2019-10-02 01:08:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:08:36,369 INFO L475 AbstractCegarLoop]: Abstraction has 1032 states and 1433 transitions. [2019-10-02 01:08:36,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 01:08:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1433 transitions. [2019-10-02 01:08:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 01:08:36,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:08:36,379 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:08:36,379 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:08:36,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:08:36,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1324114650, now seen corresponding path program 1 times [2019-10-02 01:08:36,381 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:08:36,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:08:36,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:36,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:36,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 29 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:08:36,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:08:36,772 INFO L224 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-10-02 01:08:36,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:36,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:08:36,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:08:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:08:36,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:08:36,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 01:08:36,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:08:36,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:08:36,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:08:36,976 INFO L87 Difference]: Start difference. First operand 1032 states and 1433 transitions. Second operand 9 states. [2019-10-02 01:08:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:08:40,772 INFO L93 Difference]: Finished difference Result 4235 states and 6413 transitions. [2019-10-02 01:08:40,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 01:08:40,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 172 [2019-10-02 01:08:40,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:08:40,797 INFO L225 Difference]: With dead ends: 4235 [2019-10-02 01:08:40,797 INFO L226 Difference]: Without dead ends: 3209 [2019-10-02 01:08:40,801 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:08:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2019-10-02 01:08:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 3198. [2019-10-02 01:08:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3198 states. [2019-10-02 01:08:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 4444 transitions. [2019-10-02 01:08:40,907 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 4444 transitions. Word has length 172 [2019-10-02 01:08:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:08:40,908 INFO L475 AbstractCegarLoop]: Abstraction has 3198 states and 4444 transitions. [2019-10-02 01:08:40,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:08:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 4444 transitions. [2019-10-02 01:08:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 01:08:40,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:08:40,913 INFO L411 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, 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] [2019-10-02 01:08:40,913 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:08:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:08:40,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1507016755, now seen corresponding path program 1 times [2019-10-02 01:08:40,914 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:08:40,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:08:40,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:40,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:40,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 68 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:08:41,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:08:41,072 INFO L224 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-10-02 01:08:41,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:41,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:08:41,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:08:41,238 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:08:41,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:08:41,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 01:08:41,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:08:41,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:08:41,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:08:41,245 INFO L87 Difference]: Start difference. First operand 3198 states and 4444 transitions. Second operand 9 states. [2019-10-02 01:08:43,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:08:43,750 INFO L93 Difference]: Finished difference Result 10231 states and 15481 transitions. [2019-10-02 01:08:43,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 01:08:43,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2019-10-02 01:08:43,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:08:43,807 INFO L225 Difference]: With dead ends: 10231 [2019-10-02 01:08:43,807 INFO L226 Difference]: Without dead ends: 7043 [2019-10-02 01:08:43,826 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:08:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7043 states. [2019-10-02 01:08:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7043 to 6949. [2019-10-02 01:08:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6949 states. [2019-10-02 01:08:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6949 states to 6949 states and 9952 transitions. [2019-10-02 01:08:44,155 INFO L78 Accepts]: Start accepts. Automaton has 6949 states and 9952 transitions. Word has length 200 [2019-10-02 01:08:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:08:44,156 INFO L475 AbstractCegarLoop]: Abstraction has 6949 states and 9952 transitions. [2019-10-02 01:08:44,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:08:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 6949 states and 9952 transitions. [2019-10-02 01:08:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 01:08:44,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:08:44,161 INFO L411 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, 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] [2019-10-02 01:08:44,162 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:08:44,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:08:44,162 INFO L82 PathProgramCache]: Analyzing trace with hash -163070871, now seen corresponding path program 1 times [2019-10-02 01:08:44,162 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:08:44,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:08:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:44,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 01:08:44,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:08:44,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:08:44,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:08:44,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:08:44,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:08:44,303 INFO L87 Difference]: Start difference. First operand 6949 states and 9952 transitions. Second operand 3 states. [2019-10-02 01:08:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:08:45,418 INFO L93 Difference]: Finished difference Result 17383 states and 26149 transitions. [2019-10-02 01:08:45,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:08:45,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-10-02 01:08:45,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:08:45,478 INFO L225 Difference]: With dead ends: 17383 [2019-10-02 01:08:45,478 INFO L226 Difference]: Without dead ends: 10628 [2019-10-02 01:08:45,506 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:08:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10628 states. [2019-10-02 01:08:45,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10628 to 9864. [2019-10-02 01:08:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9864 states. [2019-10-02 01:08:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9864 states to 9864 states and 14178 transitions. [2019-10-02 01:08:45,980 INFO L78 Accepts]: Start accepts. Automaton has 9864 states and 14178 transitions. Word has length 202 [2019-10-02 01:08:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:08:45,981 INFO L475 AbstractCegarLoop]: Abstraction has 9864 states and 14178 transitions. [2019-10-02 01:08:45,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:08:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 9864 states and 14178 transitions. [2019-10-02 01:08:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 01:08:45,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:08:45,993 INFO L411 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, 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] [2019-10-02 01:08:45,993 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:08:45,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:08:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1403985033, now seen corresponding path program 1 times [2019-10-02 01:08:45,997 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:08:45,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:08:45,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:45,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:45,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 139 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:08:46,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:08:46,723 INFO L224 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) [2019-10-02 01:08:46,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:08:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:46,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:08:46,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:08:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 01:08:47,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:08:47,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-10-02 01:08:47,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 01:08:47,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 01:08:47,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 01:08:47,002 INFO L87 Difference]: Start difference. First operand 9864 states and 14178 transitions. Second operand 13 states. [2019-10-02 01:08:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:08:52,781 INFO L93 Difference]: Finished difference Result 25483 states and 37964 transitions. [2019-10-02 01:08:52,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 01:08:52,782 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 230 [2019-10-02 01:08:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:08:52,874 INFO L225 Difference]: With dead ends: 25483 [2019-10-02 01:08:52,874 INFO L226 Difference]: Without dead ends: 15617 [2019-10-02 01:08:52,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 01:08:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15617 states. [2019-10-02 01:08:54,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15617 to 13528. [2019-10-02 01:08:54,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13528 states. [2019-10-02 01:08:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13528 states to 13528 states and 19020 transitions. [2019-10-02 01:08:54,091 INFO L78 Accepts]: Start accepts. Automaton has 13528 states and 19020 transitions. Word has length 230 [2019-10-02 01:08:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:08:54,092 INFO L475 AbstractCegarLoop]: Abstraction has 13528 states and 19020 transitions. [2019-10-02 01:08:54,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 01:08:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 13528 states and 19020 transitions. [2019-10-02 01:08:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 01:08:54,123 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:08:54,124 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 01:08:54,124 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:08:54,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:08:54,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2125335593, now seen corresponding path program 1 times [2019-10-02 01:08:54,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:08:54,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:08:54,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:54,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:54,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:08:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 9 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:08:54,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:08:54,616 INFO L224 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-10-02 01:08:54,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:08:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:08:54,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:08:54,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:08:54,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:08:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 01:08:54,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:08:54,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 01:08:54,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 01:08:54,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 01:08:54,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:08:54,935 INFO L87 Difference]: Start difference. First operand 13528 states and 19020 transitions. Second operand 14 states. [2019-10-02 01:09:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:06,259 INFO L93 Difference]: Finished difference Result 37698 states and 54220 transitions. [2019-10-02 01:09:06,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-02 01:09:06,260 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 280 [2019-10-02 01:09:06,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:06,377 INFO L225 Difference]: With dead ends: 37698 [2019-10-02 01:09:06,378 INFO L226 Difference]: Without dead ends: 23984 [2019-10-02 01:09:06,421 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=970, Invalid=4000, Unknown=0, NotChecked=0, Total=4970 [2019-10-02 01:09:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23984 states. [2019-10-02 01:09:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23984 to 20859. [2019-10-02 01:09:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20859 states. [2019-10-02 01:09:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20859 states to 20859 states and 27631 transitions. [2019-10-02 01:09:06,985 INFO L78 Accepts]: Start accepts. Automaton has 20859 states and 27631 transitions. Word has length 280 [2019-10-02 01:09:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:06,985 INFO L475 AbstractCegarLoop]: Abstraction has 20859 states and 27631 transitions. [2019-10-02 01:09:06,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 01:09:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 20859 states and 27631 transitions. [2019-10-02 01:09:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-10-02 01:09:07,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:07,009 INFO L411 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, 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, 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] [2019-10-02 01:09:07,010 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:07,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:07,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1210048352, now seen corresponding path program 1 times [2019-10-02 01:09:07,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:07,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:07,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:07,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:07,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 182 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:09:08,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:09:08,029 INFO L224 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-10-02 01:09:08,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:08,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-02 01:09:08,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:09:08,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:09:08,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:09:08,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:09:08,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:09:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 182 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:09:08,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:09:08,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 17 [2019-10-02 01:09:08,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 01:09:08,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 01:09:08,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:09:08,763 INFO L87 Difference]: Start difference. First operand 20859 states and 27631 transitions. Second operand 17 states. [2019-10-02 01:09:08,899 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-10-02 01:09:09,589 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-10-02 01:09:10,498 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-02 01:09:11,164 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-10-02 01:09:12,035 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-02 01:09:12,201 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-10-02 01:09:13,632 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-10-02 01:09:14,627 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-10-02 01:09:14,852 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-10-02 01:09:15,107 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-10-02 01:09:15,276 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-10-02 01:09:15,945 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-02 01:09:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:09:16,762 INFO L93 Difference]: Finished difference Result 43135 states and 58363 transitions. [2019-10-02 01:09:16,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-02 01:09:16,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 323 [2019-10-02 01:09:16,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:09:16,850 INFO L225 Difference]: With dead ends: 43135 [2019-10-02 01:09:16,850 INFO L226 Difference]: Without dead ends: 22660 [2019-10-02 01:09:16,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=822, Invalid=2484, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 01:09:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22660 states. [2019-10-02 01:09:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22660 to 22463. [2019-10-02 01:09:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22463 states. [2019-10-02 01:09:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22463 states to 22463 states and 29236 transitions. [2019-10-02 01:09:17,335 INFO L78 Accepts]: Start accepts. Automaton has 22463 states and 29236 transitions. Word has length 323 [2019-10-02 01:09:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:09:17,336 INFO L475 AbstractCegarLoop]: Abstraction has 22463 states and 29236 transitions. [2019-10-02 01:09:17,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 01:09:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 22463 states and 29236 transitions. [2019-10-02 01:09:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-10-02 01:09:17,357 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:09:17,357 INFO L411 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, 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, 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] [2019-10-02 01:09:17,358 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:09:17,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:09:17,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1392969753, now seen corresponding path program 1 times [2019-10-02 01:09:17,358 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:09:17,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:09:17,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:17,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:17,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:09:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 182 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:09:17,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:09:17,690 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:09:17,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:09:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:09:17,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 01:09:17,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:09:17,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:09:17,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:09:21,688 WARN L191 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 26 DAG size of output: 15 [2019-10-02 01:09:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 4 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:09:22,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:09:22,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2019-10-02 01:09:22,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:09:22,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:09:22,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=80, Unknown=2, NotChecked=0, Total=110 [2019-10-02 01:09:22,005 INFO L87 Difference]: Start difference. First operand 22463 states and 29236 transitions. Second operand 11 states. [2019-10-02 01:09:23,614 WARN L191 SmtUtils]: Spent 833.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-10-02 01:09:32,917 WARN L191 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 17 [2019-10-02 01:10:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:10:31,227 INFO L93 Difference]: Finished difference Result 50541 states and 67965 transitions. [2019-10-02 01:10:31,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 01:10:31,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 354 [2019-10-02 01:10:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:10:31,321 INFO L225 Difference]: With dead ends: 50541 [2019-10-02 01:10:31,322 INFO L226 Difference]: Without dead ends: 28462 [2019-10-02 01:10:31,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 361 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=217, Invalid=644, Unknown=9, NotChecked=0, Total=870 [2019-10-02 01:10:31,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28462 states. [2019-10-02 01:10:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28462 to 27319. [2019-10-02 01:10:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27319 states. [2019-10-02 01:10:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27319 states to 27319 states and 34569 transitions. [2019-10-02 01:10:32,145 INFO L78 Accepts]: Start accepts. Automaton has 27319 states and 34569 transitions. Word has length 354 [2019-10-02 01:10:32,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:10:32,145 INFO L475 AbstractCegarLoop]: Abstraction has 27319 states and 34569 transitions. [2019-10-02 01:10:32,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:10:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 27319 states and 34569 transitions. [2019-10-02 01:10:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-10-02 01:10:32,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:10:32,185 INFO L411 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:10:32,185 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:10:32,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:10:32,186 INFO L82 PathProgramCache]: Analyzing trace with hash 282719499, now seen corresponding path program 1 times [2019-10-02 01:10:32,186 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:10:32,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:10:32,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:32,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:10:32,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:10:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 297 proven. 33 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 01:10:32,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:10:32,533 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 01:10:32,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:10:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:10:32,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 01:10:32,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:10:32,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:10:32,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:10:32,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:10:32,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:10:32,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:10:32,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:10:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 110 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:10:33,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:10:33,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 14 [2019-10-02 01:10:33,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 01:10:33,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 01:10:33,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:10:33,148 INFO L87 Difference]: Start difference. First operand 27319 states and 34569 transitions. Second operand 14 states. [2019-10-02 01:10:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:10:45,055 INFO L93 Difference]: Finished difference Result 54975 states and 70806 transitions. [2019-10-02 01:10:45,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-10-02 01:10:45,056 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 432 [2019-10-02 01:10:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:10:45,057 INFO L225 Difference]: With dead ends: 54975 [2019-10-02 01:10:45,057 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:10:45,112 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 494 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3394 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1425, Invalid=7887, Unknown=0, NotChecked=0, Total=9312 [2019-10-02 01:10:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:10:45,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:10:45,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:10:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:10:45,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 432 [2019-10-02 01:10:45,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:10:45,114 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:10:45,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 01:10:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:10:45,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:10:45,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:10:48,386 WARN L191 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 989 DAG size of output: 559 [2019-10-02 01:10:50,038 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 989 DAG size of output: 559 [2019-10-02 01:11:20,671 WARN L191 SmtUtils]: Spent 30.46 s on a formula simplification. DAG size of input: 631 DAG size of output: 110 [2019-10-02 01:11:26,401 WARN L191 SmtUtils]: Spent 5.71 s on a formula simplification. DAG size of input: 518 DAG size of output: 107 [2019-10-02 01:11:30,999 WARN L191 SmtUtils]: Spent 4.59 s on a formula simplification. DAG size of input: 518 DAG size of output: 107 [2019-10-02 01:11:31,001 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:11:31,002 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a29~0 |old(~a29~0)|) (= ~a23~0 |old(~a23~0)|) (= ~a4~0 |old(~a4~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-10-02 01:11:31,002 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:11:31,002 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-02 01:11:31,002 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-10-02 01:11:31,002 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-10-02 01:11:31,002 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,002 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,002 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,002 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,002 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,002 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,002 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,003 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-10-02 01:11:31,003 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-10-02 01:11:31,003 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-02 01:11:31,003 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,003 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,003 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,003 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,003 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,003 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,003 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,003 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,003 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,003 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-10-02 01:11:31,004 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-10-02 01:11:31,004 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-10-02 01:11:31,004 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,004 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,004 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,004 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,004 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,004 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,004 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,004 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,004 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,004 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-10-02 01:11:31,004 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-10-02 01:11:31,005 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-10-02 01:11:31,005 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-10-02 01:11:31,005 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-10-02 01:11:31,005 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-10-02 01:11:31,005 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-10-02 01:11:31,005 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,005 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,005 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,006 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,006 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,006 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,006 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,006 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,006 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,006 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,007 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-10-02 01:11:31,007 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-10-02 01:11:31,007 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-10-02 01:11:31,007 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,007 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,007 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 111) no Hoare annotation was computed. [2019-10-02 01:11:31,007 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,007 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,008 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,008 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-10-02 01:11:31,008 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-10-02 01:11:31,008 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-10-02 01:11:31,008 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,008 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,008 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,008 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,008 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,009 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-10-02 01:11:31,009 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-10-02 01:11:31,009 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,009 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,009 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,009 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,009 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,009 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,009 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-10-02 01:11:31,010 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-10-02 01:11:31,010 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,010 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,010 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-10-02 01:11:31,010 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-02 01:11:31,010 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-10-02 01:11:31,010 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,010 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,011 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,011 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,011 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,011 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,011 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,011 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-10-02 01:11:31,011 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-10-02 01:11:31,011 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-10-02 01:11:31,011 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-10-02 01:11:31,012 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-10-02 01:11:31,014 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-10-02 01:11:31,014 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-10-02 01:11:31,014 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,014 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,014 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-10-02 01:11:31,014 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-10-02 01:11:31,014 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,015 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,015 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,015 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,015 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 22 1026) the Hoare annotation is: (let ((.cse13 (= 12 |old(~a25~0)|)) (.cse15 (= 1 |old(~a4~0)|)) (.cse1 (= ~a23~0 |old(~a23~0)|)) (.cse2 (= ~a29~0 |old(~a29~0)|)) (.cse18 (= ~a4~0 |old(~a4~0)|)) (.cse19 (= ~a25~0 |old(~a25~0)|))) (let ((.cse7 (and .cse1 .cse2 .cse18 .cse19)) (.cse0 (not (<= |old(~a29~0)| 599999))) (.cse17 (not (<= 246 |old(~a29~0)|))) (.cse10 (not (<= |old(~a29~0)| 599998))) (.cse12 (not (<= 1 |old(~a4~0)|))) (.cse8 (= 13 |old(~a25~0)|)) (.cse5 (not .cse15)) (.cse11 (not (< 306 |old(~a23~0)|))) (.cse14 (forall ((v_~a29~0_507 Int)) (let ((.cse20 (+ v_~a29~0_507 69157))) (or (not (<= 0 .cse20)) (not (<= |old(~a29~0)| (+ (mod .cse20 299861) 300138))) (not (<= |old(~a29~0)| v_~a29~0_507)))))) (.cse3 (not (= 15 ~a8~0))) (.cse4 (not (= 1 ~a3~0))) (.cse6 (and .cse2 .cse1 .cse18 .cse19)) (.cse9 (not (<= 130 |old(~a29~0)|))) (.cse16 (not .cse13))) (and (or .cse0 (and (and (= ~a25~0 9) .cse1 (= 1 ~a4~0)) .cse2) (or .cse3 .cse4 (not (= 9 |old(~a25~0)|)) .cse5)) (or .cse6 .cse3 .cse4 (not (<= (+ |old(~a29~0)| 22) 0))) (or .cse7 (or .cse3 .cse4 (not (<= |old(~a29~0)| 140)) .cse8 (not (<= |old(~a4~0)| 0))) .cse9) (or .cse10 (or .cse11 .cse3 .cse4 .cse12 .cse13) .cse6) (or .cse14 .cse6 .cse3 .cse4 .cse15 .cse9 .cse16) (or .cse14 (or .cse3 .cse4 (or .cse8 .cse17)) .cse6) (or .cse14 .cse6 .cse9 (or .cse3 .cse4 .cse12 .cse13)) (or .cse10 .cse7 (or .cse3 .cse4 (not (<= 312 |old(~a23~0)|)) .cse5)) (or .cse0 (and (and .cse2 .cse1) .cse18 .cse19) (or .cse11 .cse3 .cse4 (or .cse5 .cse17))) (or .cse3 .cse4 .cse10 .cse6 .cse12 .cse13 .cse8) (or .cse6 (or .cse3 .cse4 .cse5) .cse16 (not (<= (+ |old(~a29~0)| 21) 0))) (or .cse11 .cse14 .cse3 .cse4 .cse6 .cse9 .cse16)))) [2019-10-02 01:11:31,015 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,016 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-10-02 01:11:31,016 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-10-02 01:11:31,016 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-10-02 01:11:31,016 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,016 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,016 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,018 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,018 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,018 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,018 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-10-02 01:11:31,018 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-10-02 01:11:31,018 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-10-02 01:11:31,018 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,018 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,018 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,019 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,019 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,019 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,019 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,019 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,019 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-10-02 01:11:31,019 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-10-02 01:11:31,019 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-10-02 01:11:31,019 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,019 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,020 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,020 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,020 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,020 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,020 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,020 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,020 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,021 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,022 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,022 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-10-02 01:11:31,022 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-10-02 01:11:31,022 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-10-02 01:11:31,022 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-10-02 01:11:31,022 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-10-02 01:11:31,022 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,022 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,022 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,023 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,023 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,023 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,023 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,023 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-10-02 01:11:31,023 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-02 01:11:31,023 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-10-02 01:11:31,023 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,023 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,023 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,024 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-10-02 01:11:31,024 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-10-02 01:11:31,024 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,024 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,024 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,024 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,024 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,024 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-10-02 01:11:31,024 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-10-02 01:11:31,024 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,025 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,025 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-10-02 01:11:31,025 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-10-02 01:11:31,025 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,025 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,025 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,025 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,025 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,025 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,025 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-10-02 01:11:31,026 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-10-02 01:11:31,026 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-10-02 01:11:31,026 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-10-02 01:11:31,027 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,028 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,028 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,028 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,028 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,028 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,028 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,028 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,028 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-10-02 01:11:31,028 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-10-02 01:11:31,029 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-10-02 01:11:31,029 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-10-02 01:11:31,029 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-10-02 01:11:31,029 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-10-02 01:11:31,029 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,029 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,029 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,029 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,029 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,030 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,030 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,030 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-10-02 01:11:31,030 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-10-02 01:11:31,030 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,030 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,030 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,030 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,030 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,030 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,030 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,030 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-10-02 01:11:31,031 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-10-02 01:11:31,031 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,031 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,031 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,031 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,031 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,031 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,031 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,032 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-10-02 01:11:31,032 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,032 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,032 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,032 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-10-02 01:11:31,032 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-10-02 01:11:31,032 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-10-02 01:11:31,032 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,033 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-10-02 01:11:31,033 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,033 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-10-02 01:11:31,033 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,033 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,033 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,033 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,033 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,034 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,034 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-10-02 01:11:31,034 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-10-02 01:11:31,034 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-10-02 01:11:31,034 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,034 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,034 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,034 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,034 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,035 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,035 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,035 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,035 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,035 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,035 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-10-02 01:11:31,035 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-10-02 01:11:31,035 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-10-02 01:11:31,036 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,036 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-10-02 01:11:31,036 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-10-02 01:11:31,036 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,036 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,036 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,036 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,036 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,036 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,037 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-10-02 01:11:31,037 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-10-02 01:11:31,037 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-10-02 01:11:31,037 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,037 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,037 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,037 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,037 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-10-02 01:11:31,037 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-10-02 01:11:31,037 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,038 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,038 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-10-02 01:11:31,038 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,038 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,038 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-10-02 01:11:31,038 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:11:31,038 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 1 ~a3~0) (<= (+ ~a29~0 ~a23~0) 116092) (<= 1 ~a4~0) (<= ~a29~0 130) (= 15 ~a8~0) (<= ~a25~0 10) (<= 130 ~a29~0) (<= 312 ~a23~0)) [2019-10-02 01:11:31,038 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:11:31,038 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:11:31,038 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1028 1044) the Hoare annotation is: (or (not (<= 130 |old(~a29~0)|)) (not (<= 1 |old(~a4~0)|)) (and (= ~a23~0 |old(~a23~0)|) (<= 130 ~a29~0) (<= ~a29~0 130) (= ~a4~0 |old(~a4~0)|) (= ~a25~0 |old(~a25~0)|)) (not (= 15 ~a8~0)) (not (= 1 ~a3~0)) (not (<= 312 |old(~a23~0)|)) (not (<= (+ |old(~a29~0)| |old(~a23~0)|) 116092)) (not (<= |old(~a29~0)| 130)) (not (<= |old(~a25~0)| 10))) [2019-10-02 01:11:31,038 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1028 1044) no Hoare annotation was computed. [2019-10-02 01:11:31,039 INFO L439 ceAbstractionStarter]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse2 (= 1 |old(~a4~0)|))) (let ((.cse0 (<= ~a29~0 599999)) (.cse13 (= ~a25~0 9)) (.cse14 (<= ~a29~0 130)) (.cse3 (<= 246 ~a29~0)) (.cse1 (< 306 ~a23~0)) (.cse8 (exists ((v_~a29~0_507 Int)) (let ((.cse17 (+ v_~a29~0_507 69157))) (and (<= 0 .cse17) (<= |old(~a29~0)| v_~a29~0_507) (<= ~a29~0 (+ (mod .cse17 299861) 300138)))))) (.cse10 (= 1 ~a4~0)) (.cse4 (= ~a4~0 |old(~a4~0)|)) (.cse6 (not (= 12 ~a25~0))) (.cse11 (<= ~a29~0 599998)) (.cse7 (<= 1 ~a4~0)) (.cse16 (<= ~a4~0 0)) (.cse9 (not (= ~a25~0 13))) (.cse12 (<= 130 ~a29~0)) (.cse5 (or (not (= 9 |old(~a25~0)|)) (not .cse2))) (.cse15 (<= ~a29~0 140))) (or (and .cse0 (and .cse1 (and .cse2 .cse3 .cse4) .cse5)) (and .cse6 .cse2 .cse1 .cse7 .cse8 .cse5) (and (and .cse9 .cse4 .cse5) (<= (+ ~a29~0 21) 0) .cse10) (not (<= 130 |old(~a29~0)|)) (not (<= 312 |old(~a23~0)|)) (and .cse6 .cse2 .cse11 .cse7 .cse12 .cse5) (and .cse2 .cse11 .cse7 (not .cse10) .cse12 .cse5) (and .cse13 (<= ~a23~0 306) .cse14 .cse10 .cse5) (and .cse2 (<= (+ ~a29~0 22) 0) .cse5) (and .cse2 .cse4 .cse5 (<= 312 ~a23~0) .cse15) (and .cse0 (and .cse13 .cse4 .cse10 .cse5)) (and (= ~a23~0 |old(~a23~0)|) .cse12 .cse14 .cse4 (= ~a25~0 |old(~a25~0)|)) (and .cse2 .cse3 .cse11 .cse9 .cse5) (not (<= (+ |old(~a29~0)| |old(~a23~0)|) 116092)) (not (<= |old(~a25~0)| 10)) (and (= ~a25~0 12) .cse16 .cse2 .cse11 .cse12 .cse5) (not (<= 1 |old(~a4~0)|)) (and .cse1 .cse8 .cse10 .cse12 .cse4 .cse5) (not (= 1 ~a3~0)) (not (<= |old(~a29~0)| 130)) (and .cse6 .cse2 .cse9 .cse11 .cse7 .cse5) (and .cse16 .cse2 .cse9 .cse12 .cse5 .cse15) (not (= 15 ~a8~0))))) [2019-10-02 01:11:31,039 INFO L443 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed. [2019-10-02 01:11:31,039 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-10-02 01:11:31,039 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse2 (= 1 |old(~a4~0)|))) (let ((.cse0 (<= ~a29~0 599999)) (.cse13 (= ~a25~0 9)) (.cse14 (<= ~a29~0 130)) (.cse3 (<= 246 ~a29~0)) (.cse1 (< 306 ~a23~0)) (.cse8 (exists ((v_~a29~0_507 Int)) (let ((.cse17 (+ v_~a29~0_507 69157))) (and (<= 0 .cse17) (<= |old(~a29~0)| v_~a29~0_507) (<= ~a29~0 (+ (mod .cse17 299861) 300138)))))) (.cse10 (= 1 ~a4~0)) (.cse4 (= ~a4~0 |old(~a4~0)|)) (.cse6 (not (= 12 ~a25~0))) (.cse11 (<= ~a29~0 599998)) (.cse7 (<= 1 ~a4~0)) (.cse16 (<= ~a4~0 0)) (.cse9 (not (= ~a25~0 13))) (.cse12 (<= 130 ~a29~0)) (.cse5 (or (not (= 9 |old(~a25~0)|)) (not .cse2))) (.cse15 (<= ~a29~0 140))) (or (and .cse0 (and .cse1 (and .cse2 .cse3 .cse4) .cse5)) (and .cse6 .cse2 .cse1 .cse7 .cse8 .cse5) (and (and .cse9 .cse4 .cse5) (<= (+ ~a29~0 21) 0) .cse10) (not (<= 130 |old(~a29~0)|)) (not (<= 312 |old(~a23~0)|)) (and .cse6 .cse2 .cse11 .cse7 .cse12 .cse5) (and .cse2 .cse11 .cse7 (not .cse10) .cse12 .cse5) (and .cse13 (<= ~a23~0 306) .cse14 .cse10 .cse5) (and .cse2 (<= (+ ~a29~0 22) 0) .cse5) (and .cse2 .cse4 .cse5 (<= 312 ~a23~0) .cse15) (and .cse0 (and .cse13 .cse4 .cse10 .cse5)) (and (= ~a23~0 |old(~a23~0)|) .cse12 .cse14 .cse4 (= ~a25~0 |old(~a25~0)|)) (and .cse2 .cse3 .cse11 .cse9 .cse5) (not (<= (+ |old(~a29~0)| |old(~a23~0)|) 116092)) (not (<= |old(~a25~0)| 10)) (and (= ~a25~0 12) .cse16 .cse2 .cse11 .cse12 .cse5) (not (<= 1 |old(~a4~0)|)) (and .cse1 .cse8 .cse10 .cse12 .cse4 .cse5) (not (= 1 ~a3~0)) (not (<= |old(~a29~0)| 130)) (and .cse6 .cse2 .cse9 .cse11 .cse7 .cse5) (and .cse16 .cse2 .cse9 .cse12 .cse5 .cse15) (not (= 15 ~a8~0))))) [2019-10-02 01:11:31,039 INFO L443 ceAbstractionStarter]: For program point L1034-3(lines 1028 1044) no Hoare annotation was computed. [2019-10-02 01:11:31,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,121 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,139 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,140 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,141 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:11:31 BoogieIcfgContainer [2019-10-02 01:11:31,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:11:31,148 INFO L168 Benchmark]: Toolchain (without parser) took 184466.87 ms. Allocated memory was 140.0 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 84.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-10-02 01:11:31,148 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 140.0 MB. Free memory is still 105.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 01:11:31,149 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1080.98 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 84.1 MB in the beginning and 136.2 MB in the end (delta: -52.2 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2019-10-02 01:11:31,150 INFO L168 Benchmark]: Boogie Preprocessor took 217.85 ms. Allocated memory is still 200.3 MB. Free memory was 136.2 MB in the beginning and 128.9 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. [2019-10-02 01:11:31,151 INFO L168 Benchmark]: RCFGBuilder took 2029.20 ms. Allocated memory was 200.3 MB in the beginning and 224.9 MB in the end (delta: 24.6 MB). Free memory was 128.9 MB in the beginning and 71.8 MB in the end (delta: 57.1 MB). Peak memory consumption was 81.7 MB. Max. memory is 7.1 GB. [2019-10-02 01:11:31,152 INFO L168 Benchmark]: TraceAbstraction took 181133.06 ms. Allocated memory was 224.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 71.8 MB in the beginning and 1.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-02 01:11:31,156 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43 ms. Allocated memory is still 140.0 MB. Free memory is still 105.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1080.98 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 84.1 MB in the beginning and 136.2 MB in the end (delta: -52.2 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 217.85 ms. Allocated memory is still 200.3 MB. Free memory was 136.2 MB in the beginning and 128.9 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2029.20 ms. Allocated memory was 200.3 MB in the beginning and 224.9 MB in the end (delta: 24.6 MB). Free memory was 128.9 MB in the beginning and 71.8 MB in the end (delta: 57.1 MB). Peak memory consumption was 81.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 181133.06 ms. Allocated memory was 224.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 71.8 MB in the beginning and 1.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 111]: 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: 1034]: Loop Invariant [2019-10-02 01:11:31,166 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,167 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,170 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,171 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2019-10-02 01:11:31,172 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a29 <= 599999 && (306 < a23 && (1 == \old(a4) && 246 <= a29) && a4 == \old(a4)) && (!(9 == \old(a25)) || !(1 == \old(a4)))) || (((((!(12 == a25) && 1 == \old(a4)) && 306 < a23) && 1 <= a4) && (\exists v_~a29~0_507 : int :: (0 <= v_~a29~0_507 + 69157 && \old(a29) <= v_~a29~0_507) && a29 <= (v_~a29~0_507 + 69157) % 299861 + 300138)) && (!(9 == \old(a25)) || !(1 == \old(a4))))) || ((((!(a25 == 13) && a4 == \old(a4)) && (!(9 == \old(a25)) || !(1 == \old(a4)))) && a29 + 21 <= 0) && 1 == a4)) || !(130 <= \old(a29))) || !(312 <= \old(a23))) || (((((!(12 == a25) && 1 == \old(a4)) && a29 <= 599998) && 1 <= a4) && 130 <= a29) && (!(9 == \old(a25)) || !(1 == \old(a4))))) || (((((1 == \old(a4) && a29 <= 599998) && 1 <= a4) && !(1 == a4)) && 130 <= a29) && (!(9 == \old(a25)) || !(1 == \old(a4))))) || ((((a25 == 9 && a23 <= 306) && a29 <= 130) && 1 == a4) && (!(9 == \old(a25)) || !(1 == \old(a4))))) || ((1 == \old(a4) && a29 + 22 <= 0) && (!(9 == \old(a25)) || !(1 == \old(a4))))) || ((((1 == \old(a4) && a4 == \old(a4)) && (!(9 == \old(a25)) || !(1 == \old(a4)))) && 312 <= a23) && a29 <= 140)) || (a29 <= 599999 && ((a25 == 9 && a4 == \old(a4)) && 1 == a4) && (!(9 == \old(a25)) || !(1 == \old(a4))))) || ((((a23 == \old(a23) && 130 <= a29) && a29 <= 130) && a4 == \old(a4)) && a25 == \old(a25))) || ((((1 == \old(a4) && 246 <= a29) && a29 <= 599998) && !(a25 == 13)) && (!(9 == \old(a25)) || !(1 == \old(a4))))) || !(\old(a29) + \old(a23) <= 116092)) || !(\old(a25) <= 10)) || (((((a25 == 12 && a4 <= 0) && 1 == \old(a4)) && a29 <= 599998) && 130 <= a29) && (!(9 == \old(a25)) || !(1 == \old(a4))))) || !(1 <= \old(a4))) || (((((306 < a23 && (\exists v_~a29~0_507 : int :: (0 <= v_~a29~0_507 + 69157 && \old(a29) <= v_~a29~0_507) && a29 <= (v_~a29~0_507 + 69157) % 299861 + 300138)) && 1 == a4) && 130 <= a29) && a4 == \old(a4)) && (!(9 == \old(a25)) || !(1 == \old(a4))))) || !(1 == a3)) || !(\old(a29) <= 130)) || (((((!(12 == a25) && 1 == \old(a4)) && !(a25 == 13)) && a29 <= 599998) && 1 <= a4) && (!(9 == \old(a25)) || !(1 == \old(a4))))) || (((((a4 <= 0 && 1 == \old(a4)) && !(a25 == 13)) && 130 <= a29) && (!(9 == \old(a25)) || !(1 == \old(a4)))) && a29 <= 140)) || !(15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 292 locations, 1 error locations. SAFE Result, 180.9s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 119.6s AutomataDifference, 0.0s DeadEndRemovalTime, 45.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1121 SDtfs, 17629 SDslu, 2505 SDs, 0 SdLazy, 32673 SolverSat, 7069 SolverUnsat, 32 SolverUnknown, 0 SolverNotchecked, 90.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2447 GetRequests, 2110 SyntacticMatches, 8 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6641 ImplicationChecksByTransitivity, 21.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27319occurred in iteration=10, 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: 4.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 7861 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 855 PreInvPairs, 1275 NumberOfFragments, 1452 HoareAnnotationTreeSize, 855 FomulaSimplifications, 163368 FormulaSimplificationTreeSizeReduction, 4.9s HoareSimplificationTime, 7 FomulaSimplificationsInter, 90065 FormulaSimplificationTreeSizeReductionInter, 40.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 4468 NumberOfCodeBlocks, 4468 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4450 ConstructedInterpolants, 4 QuantifiedInterpolants, 8319207 SizeOfPredicates, 16 NumberOfNonLiveVariables, 3433 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 1978/2792 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...